Skip to content

Serve all 384 nonunit denominator-52 tails with one reversible circuit - #7760

Open
aliromman wants to merge 1 commit into
CrocSwap:mainfrom
aliromman:codex/consecutive-result-074
Open

aliromman wants to merge 1 commit into
CrocSwap:mainfrom
aliromman:codex/consecutive-result-074

Conversation

@aliromman

@aliromman aliromman commented Nov 19, 2026 •

Copy link
Copy Markdown
Contributor

One fixed reversible circuit now covers the 288 mixed and 96 endpoint denominator-52 tails excluded from the existing nonzero-pair core. It uses 1,277 gates and 382 clean work bits per draw, with the original ordered output labels, live-node index and stopping depth. This answers the released tail-controller question in PR #7757. No new kappa or complete physical sampler is claimed.

Read the proof and contract, circuit and actual source recipes, complete bill and certificates, checker, 19 source pins and credits.

After the four-coin prefix, a mixed tail reduces to two complementary pairs over denominator thirteen, with two live nodes at every phase. An endpoint tail has one complementary pair and one live node. Runtime residues u,v, orientation and mode are read-only. The circuit computes both probability digits, orders the column-pair leaves, updates the phase and applies an explicit inverse. Packet copying, swaps and all uncomputation are included.

Resource per tail draw Count
X / CNOT / Toffoli gates 70 / 895 / 312
Total gates 1,277
Temporary work + clean packet backing 375 + 7 = 382 bits
Live packet / parameter bits / resident coin 7 / 10 / 1
Complete runtime transitions 576 parameter settings; 20,736 edges

All runtime edges pass forward and inverse checks on every wire. A separate scalar interpreter checks 1,152 cases both ways. All 169 modular additions and their reversal pass. Five gate controls detect changed stopping, parameter, mode, work state and output order. All 384 actual bounded owner witnesses and 16,128 ordered source-tail edges agree with a direct denominator-2,704 floor calculation. The original fixed-pair arithmetic verifier runs unchanged.

Python 3.12, standard library only:

python3.12 -B scripts/research_package.py --package research/nonunit52-tail-circuit

Both registered commands print:

PASS_NONUNIT52_TAIL_CIRCUIT
288 mixed and 96 endpoint source pairs; 16128 exact source-tail edges
576 runtime parameter graphs; 20736 full forward/inverse transitions
70 X; 895 CNOT; 312 Toffoli; 1277 gates; 375 temporary + 7 backing = 382 clean bits

Normal and optimized registered replay, syntax/indentation, committed bytes/source history/modes, export and sealed read-only Git-free serial replay 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 requires make 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.

Nick Petalas (@petalas) supplied the unchanged Boolean primitives, clean-oracle method and fixed-pair verifier in PR #7746. The subclass uses the unchanged primitives with its explicit wire layout; no retained function or global is patched. @JoyboyBrian supplied the actual residue-domain proof, owner constructor and mode columns in PR #6096.

Ali Romman (@aliromman), with substantial OpenAI Codex assistance, supplied the entry classification and boundary proof, interface and the PR7755 interpreter framework. @zxv supplied the ordered paired graph and probability proof in PR #6072. All retained notices preserve the inverse, normalizer, coded-producer and lifecycle lineage.

Mixed tail weights sum to two and represent two entry nodes; they are not a fresh one-root probability law. The circuit's cyclic inverse does not implement the first prefix return. Worst-case stopping remains unbounded. With fresh fair coins, endpoint entries average two tail coins; mixed nodes zero and one average one and three, respectively. These are conditional coin counts, not a physical caller bill.

Parameter preparation, prefix execution and return, physical wire/tape movement, output retention, stopping storage, conditional freshness and the complete native invoice remain open. The full inverse kernel fixtures, complete PR7757 verifier, full PR7755 runtime verifier, historical probability/mean catalogue, selected cold replay, Lean and Docker were not run. The larger generic circuit accepts a different domain; no matched physical speedup or global gate optimum is claimed. All five assumptions and the selected frontier remain unchanged.

Base: canonical main e54523517d0f03e58352e647c403a5af3e525a57, priority revision 8. The source pins identify every consumed head; no unmerged ancestry is asserted. Prepared by Ali Romman with substantial OpenAI Codex assistance in research, implementation, verification and writing. Apache-2.0. No independent human or formal-kernel acceptance is claimed. Canonical claim.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant