Show HN: ZkGolf

1 sources1 storiesFirst seen 7/2/2026Score26Mixed Progress

Single Source

Bigness

Coverage

Recency

Engagement

Velocity

Confidence

Clipability

Polarization

Claims

Contradictions

Breakthrough

Sentiment Mix

Positive0%

Neutral100%

Negative0%

Geography

North America

Expert Signals

rot256

author • 1 mention

Hacker News

source • 1 mention

AI-Generated Claims

Generated from linked receipts; click sources for full context.

Zero-Knowledge Proofs (ZKPs) let an untrusted proved show that computation was executed correctly without revealing the inputs to the verifier.

Supported by 1 story

However to prove anything, the computation first has to be expressed as a circuit: a system of polynomial equations (constraints) over a finite field.

Supported by 1 story

Circuits are the assembly language of zk and every constraint costs prover (and sometimes verifier) time, so production circuits are aggressively hand-optimized.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.

Supported by 1 story

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.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.

Supported by 1 story