Educational STARK proof system implementation in Go
A minimal, pedagogical implementation of STARK (Scalable Transparent ARgument of Knowledge) proving Fibonacci computation correctness.
- Pure Go — No external dependencies
- Transparent — No trusted setup required
- Educational — Clear code structure with comprehensive documentation
go run .- Trace — Record Fibonacci computation steps
- Extend — Interpolate to polynomials, evaluate on larger domain
- Commit — Build Merkle tree over extended trace
- Constrain — Encode Fibonacci rule as polynomial constraint
- Prove — Generate quotient polynomial via division
- Verify — Check Merkle proofs + constraint satisfaction
See OVERVIEW.md for detailed tutorial.
Educational implementation. Not production-ready:
- No zero-knowledge properties
- Simplified FRI protocol
- Educational hash function
- Single constraint system
BSD 3-Clause — See LICENSE