Repository navigation
feat(quantum): prove masked-chain endpoint security with preprocessing - #1193
alexanderlhicks wants to merge 4 commits into
Conversation
🤖 PR SummaryMathematical Formalization
Proof Completion (sorries removed)No Protocols / Soundness
Documentation
Infrastructure / CI
The core proof concentration is in Statistics
Lean Declarations ✏️ Added: 182 declaration(s)
…and 32 more not listed.
📋 **Additional Analysis**No findings. 📄 **Per-File Summaries**
Last updated: 2026-11-21 15:28 UTC. |
Build Timing Report
CPU work is Rebuilt ModulesRebuilt 1549 modules (57 without an earlier time). The 1492 with an earlier time took 5897s here against 6482s when last built (-585s (-9.0%)). Estimated clean-build compile time, summed over all 1753 modules: 7054s before, 6682s after (-372s (-5.3%)). Per-module times are wall-clock under whatever parallel load the run had, so treat small differences as noise; a large change on one module is the signal. Showing 20 slowest of 1549 rebuilt modules.
|
Summary
Prove endpoint-recovery security for the idealized masked-chain puzzle, including query-bounded preprocessing with unrestricted retained classical and quantum memory. The named scheme experiment equals the endpoint game exactly.
For$N=|G|$ , chain parameter $q$ , at most $q$ online rounds and width $k$ , the online bound is
Only programmed input vertices contribute to the collision allowance. For the one-link puzzle ($q=0$ ) without preprocessing, the bound is exactly $1/N$ . The collision allowance remains for longer chains, whose public masks can help even an adversary that makes zero queries. The online bound has order $kq^3/N$ for positive $k,q$ ; a smaller adversary round cap is currently admitted through monotonicity but does not sharpen the chain-dependent expression. Preprocessing uses both its round and total-point bounds.
Afshar et al. ePrint 2023/932, Lemma 5.5 already bounds the endpoint event. Their detailed Theorem 5.3 states order$\sqrt{kq^3/N}$ . The root-accumulation bookkeeping here gives the smaller asymptotic expression when $kq^3<N$ , without a novelty or best-known-bound claim. The hidden tuple stays joint with the output throughout.
Base: #1191. The exact byte encoding #1194 is a separate child.
Suggested review order: #1188 → #1190 → #1192 first; then #1191 → #1193; then #1194 → #1195 → #1196.
Validation
Validated head:
55a2d15c3f85c4e55b7e4e91cfd106a4e457a546. All nine hosted check types and every recorded run passed.Review response and reproducible checks · Review dispositions
The reproduction commands for this slice are:
The hosted matrix also runs the default executable/CSV suite, initializer checks, import and
isolation guards, documentation checks and downstream builds. The default axiom sweep covers
production roots; a fresh whole-test-library axiom sweep is not implied. Historical contract
comparison can be reproduced from the published baseline and committed capture tools as
specified in the integration review-response page.