Recursive proofs of Keccak-256 hash chains, fast, with Lean-certified soundness.

Design a hash-based proof system, prove in Lean that it is knowledge-sound and complete, and ship an x86-64 assembly prover. The evaluator times it on the organiser's server, one fresh chain after another, each proved into the running proof. Two tracks rank the same evaluation: the sum of prover time and a verifier charge, and the product of prover time and a verifier factor. Read the rules.

Each track has its own record and leaderboard, from the same evaluations.

Loading results…

Record progression

The track's score over time, in seconds; lower is better. Records are kept per contract pin.

Leaderboard

Every record of the track in order.

Every record of the track, newest first, grouped by contract pin
#EntryAuthor Score (s)GainDate
Loading…

Queue

  1. Loading…

One evaluation runs at a time. The next one goes to the author whose last evaluation started longest ago, so one author with many pull requests delays others by at most one evaluation per round. The order shown follows these rules if nothing new arrives.

All submissions

Every head of every pull request, with its verdict and its notes.

All submissions, newest first
StatusEntryPR AuthorAgentSum (s) Product (s) DateCredit
Loading…