Repository navigation
feat(hashsig): replay settled WOTS+ chains from a cache hint - #1186
Merged
Merged
Conversation
Characterize when hidden caches with a shared hint admit a common upper bound in the native cache order. Apply the criterion to every settled WOTS+ chain and check a two-hash chain, incomparable caches, and conflicting answers. Co-Authored-By: Codex <noreply@openai.com>
Preserve the existing VCVio instances while using the public theorem names from the target PolyFun revision. The full proof build rejects warnings from the deprecated spellings. Co-Authored-By: Codex <noreply@openai.com>
The public criterion is stated in QueryCache vocabulary. Downstream consumers need the PolyFun theorem only while elaborating its proof. Co-Authored-By: Codex <noreply@openai.com>
Keep the VCVio-specific names for explicit callers. The current PolyFun revision supplies the generic bind, pure and map simp rules for this exact-WP instance. Co-Authored-By: Codex <noreply@openai.com>
Co-Authored-By: Codex <noreply@openai.com>
Co-Authored-By: Codex <noreply@openai.com>
Co-Authored-By: Codex <noreply@openai.com>
Port the tactic, lossless expectation rule, and regression from Verified-zkEVM#1179 commit 74ef550. Co-Authored-By: Codex <noreply@openai.com>
Co-Authored-By: Codex <noreply@openai.com> (cherry picked from commit f587574)
Port the uniform-sampling rule from Verified-zkEVM#1179 commit 05df36f. The two-draw CoreVCGen regression exercises the normalized unit postcondition. Co-Authored-By: Codex <noreply@openai.com>
🤖 PR SummaryMathematical Formalization
Examples / Tests
Infrastructure / API Changes
Documentation
No Statistics
Lean Declarations ✏️ Added: 12 declaration(s)
📄 **Per-File Summaries**
Last updated: 2026-11-21 17:53 UTC. |
dtumad
marked this pull request as ready for review
November 21, 2026 00:51
dtumad
added a commit
to dtumad/VCVio
that referenced
this pull request
Nov 21, 2026
Pins PolyFun at f3eb8333 in the root lakefile and both manifests. The PolyFun changes since 528b3b1 need the compatibility edits from Verified-zkEVM#1186 in the lower-expectation and relational-algebra files and their tests. They are copied unchanged, so Verified-zkEVM#1186 rebases onto this with only its own content left. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Main now pins PolyFun at 713d8857 (Verified-zkEVM#1204), a descendant of this branch's pin 77731620, and carries this branch's compatibility edits, so the pin conflicts resolve to main's files. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
dtumad
added a commit
to sisyphm/VCVio
that referenced
this pull request
Nov 21, 2026
…support workaround (Verified-zkEVM#1204) * refactor(OracleComp): build on PolyFun's inductive return predicate for support PolyFun's `MonadAttach` instance for `FreeM P` now uses an inductive `FreeM.CanReturn`. With it, neither the kernel nor the elaborator evaluates a computation to compare `x ∈ support mx` with `x ∈ support my`. The proof of Verified-zkEVM#1197 checks without the workaround from gotcha 13b, including `simp` with `mem_support_bind_iff` on a `do` block, passing `h : x ∈ support mx` to a lemma, an `abbrev` and `unfold`. `VCVioTest/OracleComp/SupportKernel.lean` checks those four cases. `support (pure x) = {x}` no longer holds by `rfl` on `OracleComp`. Proofs that used a membership in the support of `pure` as an equation now go through `eq_of_mem_support_pure` or `mem_support_pure_iff`. Gotcha 13b describes the inductive predicate and keeps the general warning about sets computed by recursion over a program (leanprover/lean4#16613). The PolyFun pin is a cherry-pick of the PolyFun change onto the previous pin, for integration testing. It must be replaced by the merged PolyFun commit before this lands. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> * chore(deps): pin PolyFun at its support change on current main Pins PolyFun at f3eb8333 in the root lakefile and both manifests. The PolyFun changes since 528b3b1 need the compatibility edits from Verified-zkEVM#1186 in the lower-expectation and relational-algebra files and their tests. They are copied unchanged, so Verified-zkEVM#1186 rebases onto this with only its own content left. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> * docs(upstream-alignment): record PolyFun's inductive return predicate Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> * chore(deps): pin PolyFun at the merged support change Verified-zkEVM/PolyFun#509 merged as 713d8857, whose tree is identical to the PR head f3eb8333 that this branch was validated against. The root lakefile and both manifests now name the merged commit. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> --------- Co-authored-by: Claude Opus 5.5 <noreply@anthropic.com>
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.
A two-step WOTS+ chain asks for the hash of
xat addressi, then hashes that answer at addressi + 1. If one source cache contains both entries, a cache selected by its public hint can reproduce the same chain tip. The result covers arbitrary starting inputs and chain lengths.QueryCache.exists_hint_upperBound_iffcharacterizes when one cache per hint extends every history with that hint. Histories must agree on each query they both answer.exists_hint_cache_for_chainsapplies this criterion to every successful WOTS+ chain read at once. A regression uses the actual public hash queries for two consecutive steps. A separate Boolean example shows how a shared cache can complete a read that missed in both original histories, and why conflicting stored answers rule out even successful-result replay.The PolyFun pin and the compatibility fixes this PR used to carry are now on
mainthrough #1204, which pins PolyFun at713d8857, a descendant of the handler theorem at77731620. After mergingmain, this PR adds only the cache-hint results, their regression tests and the two umbrella imports.Verification
7f16b0529mergesmainate9727ae07, and the pin files are nowmain's. On that commit,lake build --wfail HashSig VCVio HashSigTestpassed. It built the new cache-hint modules, the PolyFun handler modules they import, both umbrella modules and the SLH-DSA tests that depend on them, on top of a validated build ofmain. Before the merge, the full./scripts/validate.sh --lint --test --axiomsrun passed on99bf3cd53, with zero sorry or nonstandard-axiom taint across 32,435 declarations.