Repository navigation
Conversation
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.
Sampler workspace construction: the exact denominator-52 finite-window service now uses
559+51*ceil(2*sqrt(L))clean work bits, with a linear Boolean gate count. It preserves every ordered label, first stopping depth, explicit censor flag and arbitrary-output XOR result from PR #7773. All inputs and clean work are restored. No new kappa or complete physical sampler is claimed.Read the all-L proof and exact bill, full gate generator, certificate, checker, source pins and credits. The consumed source head is
c1fe18fbca499b50c3bbfb12e11218ee9b6acf01.These are complete logical gate and wire counts. The
12+Lread-only parameter/coin wires and3+bit_length(L+1)output wires remain separate. Resident coin storage still grows linearly. This is a reduction in additional clean work with more recomputation, not a physical runtime or total-space speedup.The circuit retains block endpoints and reuses one local history bank. It accumulates each stopping-depth term exactly once while that state is available. It then clears checkpoints in reverse order. The short block goes first; a full last block saves recomputation. Among all partitions in this one-level architecture, the selector first minimizes clean work and then minimizes gates. No optimum over arbitrary circuits or deeper checkpoint schedules is claimed.
For maximum block B, K blocks and last-block length r, there are
D=4*L-2*rdraw-oracle calls. The exact gate count is3643+977*D+102*(K-1)+2*L; clean work is559+51*(B+K). The selected partition hasB+K=ceil(2*sqrt(L)). Preparation, copies, partial blocks, answer extraction and all cleanup are included. The original full-history circuit is an executed positive control.Python 3.12 and the standard library:
Both modes print this prefix and elapsed seconds:
The certificate covers all coin strings for all 2,704 source pairs at L=1,3,4,8; every stopping prefix with both constant suffixes and every live prefix at L=16; named larger-window and alternative-block cases; 524,800 block choices; and all 65,535 ordered partitions through L=16. It checks every wire forwards and backwards. Dirty outputs pass; omitted checkpoint cleanup and a missing boundary-depth term fail. The unchanged preparation and residue arithmetic also run. The full predecessor periodic-edge suite is retained, not rerun.
All 32 source files are authenticated. Normal/optimized registered replay, syntax/indentation, committed bytes/source history/modes, export, sealed read-only Git-free serial replay and publication checks pass. Hosted CI did not certify this package. The plan job failed in the shared
test_current_ci_section_matches_selected_record: the base guide names frontier6030 while the selected record requiresmake frontier7000-verify. The log reports 760 tests, one failure and 24 skipped; package replay was skipped. This package changes no shared CI file. Local replay remains the scientific evidence.C. H. Bennett supplied classical reversible checkpointing. Ali Romman (@aliromman) supplied the source finite-window proof, gate operations and checks. Nick Petalas (@petalas) supplied the underlying arithmetic gates in PR #7746. The retained credit chain credits JoyboyBrian's actual inverse domain and zxv's decision graph. The related batched-lifting checkpoint work in PR #3122 and PR #3129 uses a different machine contract; its physical tariff is not transferred.
This remains a censored finite service. Discarding or restarting censored draws is not justified. Unbounded sampling, fresh-coin delivery, owner extraction, tape movement, clean-stock funding and caller installation remain open. No selected cold replay, Lean, Docker, independent human or formal-kernel acceptance is claimed. All five assumptions and the selected frontier remain unchanged.
Base: canonical main
e54523517d0f03e58352e647c403a5af3e525a57, priority revision 8. Prepared by Ali Romman with substantial OpenAI Codex assistance in research, implementation, verification and writing. Apache-2.0. Canonical claim.