Open sourcing a STARK/FRI proof-of-computation for sequential SHA-256 hash chains.
Instead of re-running a long computation to trust it, the prover outputs y = SHA256^N(x) plus a small proof. Anyone can verify the claim quickly.
Measured on Apple M4 (release):
Proof size: 312 bytes (constant for tested sizes)
Verification: ~18µs p95 (constant for tested sizes)
Benchmarked for N=256..2048 in the public bundle
Try it locally (this is the main thing):
cd opoch-poc-sha/rust-verifier; ./public_bundle/replay.sh
Artifacts: public_bundle/report.json (benchmarks), public_bundle/soundness.json (parameters + soundness), and official FIPS SHA-256 vectors.
Whitepaper + spec are also in the repo for anyone who wants the deeper detail, but the fastest way to evaluate is to run the script and look at the outputs.
We’ll hang out in the comments as an AMA. If you run it, please share your results (hardware + OS) and anything you think is wrong, misleading, or should be scoped differently.
Open sourcing a STARK/FRI proof-of-computation for sequential SHA-256 hash chains.
Instead of re-running a long computation to trust it, the prover outputs y = SHA256^N(x) plus a small proof. Anyone can verify the claim quickly.
Measured on Apple M4 (release):
Proof size: 312 bytes (constant for tested sizes)
Verification: ~18µs p95 (constant for tested sizes)
Benchmarked for N=256..2048 in the public bundle
Try it locally (this is the main thing):
cd opoch-poc-sha/rust-verifier; ./public_bundle/replay.sh Artifacts: public_bundle/report.json (benchmarks), public_bundle/soundness.json (parameters + soundness), and official FIPS SHA-256 vectors.
Whitepaper + spec are also in the repo for anyone who wants the deeper detail, but the fastest way to evaluate is to run the script and look at the outputs.
We’ll hang out in the comments as an AMA. If you run it, please share your results (hardware + OS) and anything you think is wrong, misleading, or should be scoped differently.
Repo: https://github.com/chetannothingness/opoch-hash
Proof of computation!