Skip to content

Audit #5270: exact counterexample to the physical-reference/controller binding - #5349

Merged
Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
ahrazzle:research/pr5270-reference-audit-20261023
Oct 23, 2026
Merged

Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
ahrazzle:research/pr5270-reference-audit-20261023

Conversation

@ahrazzle

Copy link
Copy Markdown
Contributor

Change and mathematical scope

At #5270 head df9e5037587ce0cfbd23c2a944515526b301e820, the physical listing agrees with its standard() reference, but that reference differs from the thinned formal controller whose invoice is priced. This isolated audit supplies an exact four-role Gaussian-integer counterexample and binds it to the retained 512-address reference. At p19, the same specialization gives 351 differing entries.

Three discrepancies are isolated: the forward-loop odd bridge direction, nonidentity middle idles at thinned stages, and full-interval rather than thick-stage idle powers. Correcting all three passes the reference consistency controls. Retaining any one fails.

This is a finite counterexample to the binding as written, not an impossibility theorem for coded suppliers. Native rank-eight versus replay rank-nine, independent stage blocks, and the complete invoice remain separate obligations. No new κ or selected-result change is proposed.

Task and overlap

Validation

CPython 3.12.14, Linux x86-64. Standard library only:

python3 -B research/pr5270-reference-audit/verify.py
python3 -I -O -B research/pr5270-reference-audit/verify.py

Passed: sparse Laurent versus Gaussian-matrix comparison, actual retained reference on all 512 addresses for each of four role inputs modulo 65537, p2/p19 repair controls, source integrity, and deterministic receipt comparison. Normal, isolated and optimized modes were checked. No full supplier, compiler, precision, hosting or multiplication-theorem admission is claimed.

Credit

Prepared with substantial OpenAI Codex assistance. Author-checked, not yet independently reviewed.

Credit @DaysSky, Cayden Burkart / @SethBurkart123, and Dillon / @dillona. Credit also @Dugongue / @mdumitrean, Cinna Davis / @1337isnot1337, Cao Yifan / @intqwq, @zxv, and Jacob Alan Sussman / @jacobalansussman and the retained lineage. Source notices and Apache-2.0 licensing are preserved.

Open next questions

The package README gives the bounded sequence: correct the bridge/idles in a successor, bind an actual rank-eight native invocation and independent blocks with every added child charged, then recalculate the complete invoice. The present full-R gauge identity does not discharge that binding.

Automated posting by agentic team with human oversight.

Retain pinned source bytes, the four-role witness and replay controls.
Prepared with substantial OpenAI Codex assistance.
@jwr404

jwr404 commented Oct 23, 2026

Copy link
Copy Markdown
Contributor

Independent review (James Reed, with Claude Code). Head b510fc40715457fa5d92f84ed03cca9cb2d1a191.

Verdict: confirmed. I reproduced the p = 2 counterexample from the original sources, not from this PR's vendor/ copies or checker, and I confirmed all three transcription discrepancies by reading both sources.

Independent reproduction

[-i   0    0   1-i]
[ 0  -i  1-i    0 ]
[ 0   0   -1    0 ]
[ 0  -i  2-i   -1 ]

That is identical to your matrix, including column 3 = (1−i, 0, 0, −1). The formal result is diagonal while the reference has nonzero off-diagonal entries, so the mismatch does not depend on row/column conventions or a global phase.

The three discrepancies, read from source

  1. Forward-loop odd bridge. The formal bridge(dst, src, c) does matrix[2·src+1] += −c·matrix[2·dst+1], so bridge(j, j+1, ±1) updates role 2j+3 from 2j+1. standard()'s forward loop updates 2j+1 from 2j+3. The reverse sweep (bridge(j+1, j, 1) against st[2j+1] −= st[2j+3]) does match, as you say.
  2. Middle idle. The formal idle_call(stage//2, [stage], 'middle') selects only the even stage, which thin() sends to the identity. standard() applies gaussian_power(·, 1) = R.
  3. Idle powers count all stages, not thick stages.
    • Terminal: the formal selector range(2j+3, 2p+1) has p−j−1 thick stages, but the listing uses power 2(p−j−1).
    • The initial idles have the same issue. The formal selector range(stage+1) with stage = 2j+1 has j+1 thick stages, but the listing uses 2j+2. At p = 2 with pattern T no initial idle is retained, so your p2 witness only exercises the terminal case. The p19 pattern I⁹T⁹ retains nine initial idles, so this is part of the 351-entry p19 mismatch too.

This bears directly on my review of #5270, where I explicitly left the word replay and idle role-rank unchecked. My compiler and tail findings there stand independently. With this audit, #5270's priced invoice is not bound to its listed word as written.

I did not check your mod-65537 512-address binding or the p19 repair controls.

@Mister-Meeseeks
Mister-Meeseeks merged commit 3b785d5 into CrocSwap:main Oct 23, 2026
Mister-Meeseeks pushed a commit that referenced this pull request Oct 24, 2026
…#5349)

New package research/pr5270-reference-repair-20261023. It rewrites the emitted
gate list in three ways only (forward-loop odd bridges swapped, middle idles
zeroed, outer idle powers halved) and checks the repaired list, read by a plain
interpreter with no correction flags, against the formal thinned controller for
every p from 2 to 19 at the audit specialization. Mismatches go to 0 at every p
(351 at p19 before repair). Nine single-correction negative controls are
rejected. Transcription only: no native binding, no invoice, no new kappa.
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.

3 participants