<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: rot256</title><link>https://news.ycombinator.com/user?id=rot256</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Tue, 07 Jul 2026 22:47:19 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=rot256" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[Show HN: zkGolf – Competitive optimization of formally verified circuits]]></title><description><![CDATA[
<p>Zero-Knowledge Proofs (ZKPs) let an untrusted proved show that computation was executed correctly without revealing the inputs to the verifier.
However to prove anything, the computation first has to be expressed as a circuit: a system of polynomial equations (constraints) over a finite field. 
Circuits are the assembly language of zk and every constraint costs prover (and sometimes verifier) time, so production circuits are aggressively hand-optimized.<p>Over the last months, we have been experimenting with writing formal specifications instead and letting LLMs produce the circuits: as long as they could prove that their implementation was correct. 
It started with SHA-256: we hand wrote a specification in Lean for SHA-256 compression, and then we asked LLMs to write the circuit, targeting R1CS arithmetization and large fields.<p>It took a few hours of work for Opus 4.7, and some light steering into the right direction, but in the end the model came up with a reasonable implementation. We then asked the LLM to aggressively optimize the circuits, by driving down a cost metric of the circuit (number of constraints). We immediately got very promising results, just by asking to come up with optimization ideas, implement them and prove that the new circuit still satisfies soundness and completeness. Sometimes, it came up with unsound optimizations, however, since it could not prove them, it backtracked and got itself back on to the right approach.<p>The result was a (non-deterministic) circuit beating the current, human optimized, state of the art for SHA256 compression. This experience lead us to create "zk.golf" which is an open competition to produce optimized, formally verified circuits to lower the bar for the use of ZKPs and make their application more efficient.<p>Come play (<a href="https://zk.golf/llms.txt" rel="nofollow">https://zk.golf/llms.txt</a>) and learn about formal verification.</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48763246">https://news.ycombinator.com/item?id=48763246</a></p>
<p>Points: 69</p>
<p># Comments: 12</p>
]]></description><pubDate>Thu, 02 Jul 2026 15:40:05 +0000</pubDate><link>https://zk.golf/</link><dc:creator>rot256</dc:creator><comments>https://news.ycombinator.com/item?id=48763246</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48763246</guid></item><item><title><![CDATA[SlopTacker: The AI Streaming Drain]]></title><description><![CDATA[
<p>Article URL: <a href="https://sloptracker.org">https://sloptracker.org</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48583721">https://news.ycombinator.com/item?id=48583721</a></p>
<p>Points: 4</p>
<p># Comments: 0</p>
]]></description><pubDate>Thu, 18 Jun 2026 11:22:16 +0000</pubDate><link>https://sloptracker.org</link><dc:creator>rot256</dc:creator><comments>https://news.ycombinator.com/item?id=48583721</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48583721</guid></item><item><title><![CDATA[Powers-of-Funbenius]]></title><description><![CDATA[
<p>Article URL: <a href="https://blog.zksecurity.xyz/posts/powers-of-funbenius/">https://blog.zksecurity.xyz/posts/powers-of-funbenius/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48022775">https://news.ycombinator.com/item?id=48022775</a></p>
<p>Points: 10</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 05 May 2026 14:10:39 +0000</pubDate><link>https://blog.zksecurity.xyz/posts/powers-of-funbenius/</link><dc:creator>rot256</dc:creator><comments>https://news.ycombinator.com/item?id=48022775</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48022775</guid></item><item><title><![CDATA[New comment by rot256 in "Is BGP safe yet?"]]></title><description><![CDATA[
<p>For LetsEncrypt, routing <i>is</i> authentication:
if packets routed to the IP in the A record end up at your place, you can get a cert for that domain.</p>
]]></description><pubDate>Wed, 01 Apr 2026 19:07:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=47605124</link><dc:creator>rot256</dc:creator><comments>https://news.ycombinator.com/item?id=47605124</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47605124</guid></item><item><title><![CDATA[New comment by rot256 in "Is BGP safe yet?"]]></title><description><![CDATA[
<p>I think that way to solve BGPs security problems might be to use a new cryptographic hammer, "Proof-Carraying Data", where messages come with cryptographic proofs that they were produced correctly. This allows you to basically just run BGP, but every AS proves that it ran it correctly. The proofs take constant time to verify, regardless of how large the network is, or how many hops the routing message has taken. Feasibility is helped by latency not being super critical in BGP and BGP being a pretty simple protocol; which makes computing these proofs plausible.<p><a href="https://rot256.dev/post/bgp-pcd/" rel="nofollow">https://rot256.dev/post/bgp-pcd/</a><p>Proof-carrying data has come a long way in the last 10 years.<p>EDIT: you would still need RPKI, but not BGPSec</p>
]]></description><pubDate>Wed, 01 Apr 2026 15:06:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=47601914</link><dc:creator>rot256</dc:creator><comments>https://news.ycombinator.com/item?id=47601914</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47601914</guid></item><item><title><![CDATA[New comment by rot256 in "RustTraining: Beginner, advanced, expert level Rust training material"]]></title><description><![CDATA[
<p>This seems useless and misguided? This training material contents is clearly AI generated, if people can't be assed to write a book, then why should people read it?<p>Maybe it's my teaching background, but there is something uniquely soulless about teaching humans with AI slop passed off as a course; 
this is the stuff of "Amazon AI generated book spammers" and to be honest, I expected better from Microsoft.<p>If people wanted LLM output, they can generate it themselves...</p>
]]></description><pubDate>Wed, 25 Mar 2026 14:59:29 +0000</pubDate><link>https://news.ycombinator.com/item?id=47518227</link><dc:creator>rot256</dc:creator><comments>https://news.ycombinator.com/item?id=47518227</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47518227</guid></item><item><title><![CDATA[New comment by rot256 in "Thank you Google for breaking my YouTube addiction"]]></title><description><![CDATA[
<p>PipePipe? <a href="https://pipepipe.dev/" rel="nofollow">https://pipepipe.dev/</a><p>EDIT: also skips sponsor segments.</p>
]]></description><pubDate>Sun, 18 May 2025 12:23:36 +0000</pubDate><link>https://news.ycombinator.com/item?id=44020840</link><dc:creator>rot256</dc:creator><comments>https://news.ycombinator.com/item?id=44020840</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44020840</guid></item><item><title><![CDATA[New comment by rot256 in "Reports of Putin's death might not be greatly exaggerated"]]></title><description><![CDATA[
<p>As pointed out by Mark Galeotti, both the sources are less than reliable...<p><a href="https://podcasts.apple.com/gb/podcast/in-moscows-shadows-120-putin-is-dead-well-probably-not/id1510124746?i=1000632973272" rel="nofollow noreferrer">https://podcasts.apple.com/gb/podcast/in-moscows-shadows-120...</a><p>Whether dead or not, it is frankly disappointing that western media lends so much credence to sources which have been consistently wrong and made outright ridiculous claims before. Even if they try hedging it by calling them rumors, until more reliable sources emerge it is just noise...</p>
]]></description><pubDate>Tue, 31 Oct 2023 15:36:48 +0000</pubDate><link>https://news.ycombinator.com/item?id=38086486</link><dc:creator>rot256</dc:creator><comments>https://news.ycombinator.com/item?id=38086486</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=38086486</guid></item></channel></rss>