Repository navigation
doc: zero-knowledge leaves - #619
Merged
Merged
Conversation
This was referenced Oct 11, 2026
Benchmarks: base against this PR, on one runnerc89680c merged into its base, against the base d0b0f82: each benchmark run in turns on one runner, base and PR 5 times each. A size is shown when it changed; a time or a peak memory when it moved the same way in every round and its median by at least 1% (the change is the median ratio, with the rounds' range). Threads shows the named configuration; BLAKE2s
FibonacciProver stages
leanXMSS
Prover stages
Every resultBLAKE2s
Prover stages
Fibonacci
Prover stages
Field and transpose kernels
Flock
PCS
leanSPHINCS
Prover stages
leanXMSS
Prover stages
|
tcoratger
force-pushed
the
zk-stack/1-spec
branch
2 times, most recently
from
October 12, 2026 14:08
6fe1814 to
21b8504
Compare
The specification of zero-knowledge leaf proofs, before the code that implements it. - Annex B, the hiding commitment (sec:pcs-zk): every level-0 row padded past its power of two by q_0 + 2 coefficients behind the factor W_m(X + s), which vanishes nowhere on the domain, and an aligned group of four uniform rows. Lemma pcs-zk-group: the group's fold weights span E over K except with probability below 2^-120, so the folded witness and the padding's fold are uniform; one uniform row would mask each coordinate only along a line, and any functional with coefficients in K would show the other two. Theorem pcs-zk: the opening is simulatable from them, every unopened leaf keeping at least 256 bits of min-entropy. - Annex F, zero knowledge (new): the transcript under one-time-pad keys, the hidden final clock, the record as a rank-one system that depends on the transcript's shape alone, the deferred claims batched into the plain shape by one challenge, the outer zero-knowledge Spartan and the key commitment, the soundness additions (a second list factor paid by 12 more grinding bits before the bus), the zero-knowledge theorem, and recursion over zero-knowledge leaves with plain tree proofs. Co-Authored-By: Kevaundray Wedderburn <kevtheappdev@gmail.com> Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
tcoratger
force-pushed
the
zk-stack/1-spec
branch
from
October 13, 2026 14:13
21b8504 to
c89680c
Compare
kevaundray
added a commit
to kevaundray/leanVM
that referenced
this pull request
Oct 14, 2026
…zero-knowledge leaves, leanEthereum#631, leanEthereum#633, leanEthereum#634): the circuits, trees and CLI on upstream's layout and APIs; circuit leaves are never zero knowledge
This was referenced Oct 14, 2026
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Stack: #619 spec → #620 transcript → #621 pcs → #622 outer proof → #623 ZK leaves → #624 recursion. Replaces #532.
Part 1 of 6 of the zero-knowledge stack, which rebuilds #532 by @kevaundray with the hiding fixed.
The spec comes first, so the argument can be reviewed before the code.
What
The fix over #532
Lanes are words of
K, but the fold weights are inE, which is three-dimensional overK.One uniform lane masks each folded coordinate only along a line.
A revealed value with coefficients in
Kthen shows twoK-coordinates of the witness: a level-0 corrected value, or any opened symbol of level 1.Four lanes in one aligned group span
EoverK(Lemmapcs-zk-group), so the folded witness is uniform and VEIL's lemma applies as stated.Review guide
pcs-zk-groupand Theorempcs-zkin Annex B.zkin Annex F.The PDF builds with no undefined reference.
Co-authored-by: Kevaundray Wedderburn kevtheappdev@gmail.com
🤖 Generated with Claude Code