Repository navigation
Conversation
This was referenced Nov 18, 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.
Summary
Scoped construction with an exact finite certificate. One draw of the fixed (1/13, 1/13) paired sampler replaces its 702-byte transition table with a reversible arithmetic circuit. It preserves the outcome and first stopping depth on each ordered coin path.
The circuit uses 3,060 gates (232 X, 2,238 CNOT and 590 Toffoli) and 484 clean work bits. The bill includes packet copying, swapping and uncomputation. The stored transition payload is replaced by arithmetic. Circuit description and physical execution have their own costs.
Evidence
The verifier compares the emitted gates with an integer-floor specification for all 624 reachable packet and coin pairs. It checks the full forward and inverse maps, coin preservation, clean workspace, and two fault controls. Both registered modes passed in 0.11 seconds each on CPython 3.12.15. Package metadata, committed bytes, file modes, source ancestry and the generated export receipt passed. Both exact commands also passed from a read-only Git-free export.
Reproduce from the repository root with CPython 3.12 and its standard library.
The direct commands print
PASS_PAIRED_DDG_ARITHMETIC_STEPand the gate and wire counts. The proof and source pins are underresearch/paired-ddg-arithmetic-step/.Limitations
The circuit prices one draw for one fixed pair. Stopping time remains unbounded. Physical tape movement, stopping storage, conditional freshness and the actual caller bill remain open. Native and selected scientific replays, Lean and Docker were unrun. The selected κ is unaffected.
Open next questions
Related open work
CI notes
This PR carries the shared CI-doc and replay-gap sync used by other open PRs.
At
71fdb2cf1ec973b5402c4d3c2466864014a1ccda, the six current-status tests passed locally and the historical replay printedPASS_REGISTERED_RESEARCH_PACKAGE. The five source and staged file digests match the supplied sync. All three hosted checks passed on this commit. They covered planning, the historical replay-gap package and the paired sampler package. CI run 44400140942Credit
This result was produced by Nick Petalas. Credit zxv for the source graph and probability law and JoyboyBrian for the reversal context and tape/table question. PR #6072 · PR #6102 · Advance claim
Merge scope
The seven-file research package and the five-file shared CI sync are in separate commits.