LURK: Lambda, the Ultimate Recursive Knowledge
summary
Lurk is a LISP-based language plus a universal interpreter circuit that lets programs be supplied as data so zk proofs verify runs instead of flattened circuits; the implemented CK abstract-machine stepper compiles to 12,000 constraints (R1CS) versus SHA-256’s ~44,000, uses hash-coning/content-addressing to bind state, and demonstrates a proof of Fibonacci at 1,000 iterations in ~13s to generate (verifying remains much faster), a Rust implementation and audited repo exist and ongoing work targets ~10× prover speedups.
AI-written summary · about
chapters (10)
- 0:00LURK introduction
- 2:54Zero knowledge proofs
- 5:24Arithmetic circuits
- 8:36Incrementally verifiable computation
- 12:27Designing LURK as Lisp
- 14:16Circuit writing knowledge
- 16:41Hashing and authenticated data
- 18:46Functional commitments
- 20:31Cryptographic challenges
- 22:17Q&A
