Repository navigation
Research: exact raw agreement set for compact dirty-control selected-bit updates (no new kappa) - #1823
Conversation
…bit updates (no new kappa) Independent stdlib census of notes/compact-control-movement.tex's four-update gadget and both source orders at 47 complete cells (24,074,240 fiber states, n<=3, K<=6, G<=2). Sufficiency of guards G0 (source note), G1 (compact-carry-repair-audit) and H (compact-late-guard-audit-seed73) confirmed with zero violations; seed73 closed form (2) matched exactly at all 21 later-source cells; both published failure fixtures reproduced exactly. The exact raw agreement set strictly exceeds every guard everywhere (49.35% overall vs guard maxima 14.06%/7.03%/44.83%), with smallest necessity witnesses recorded. Concurrent open PR1603 is credited and positioned. Contributor: Aaron Wang, with help from opencode.
|
Batch review at Merged to Reviewed scope: Independent whole-slot raw-map census of24074240 states in47cells reproduces11880712 agreements, sufficient guard inclusions and density formula. Reviewer supplement distinguishes actual sign reversal from submitted omitted-unload control; both reject. Repair/tape costs, all-size extension and production-predicate adoption remain open. The pinned scoped command passed; the batch ledger contains its command, input hashes, environment and log. This incorporates the research/tooling contribution and does not change the selected κ or discharge the inherited multiplication-theorem assumptions. Batch review, attribution and evidence. Thank you for the contribution. |
Adversarial mathematical audit with an independent finite checker; no new kappa. The selected record, production predicates,
upstream/and all frozen pins are unchanged.supplier-boundary-audit(scope key66632af6c86d34fb0fdc, chooser OS nonce9e531d2bfd9e08f12db2843ca19eac2c, priority revision 3), scope refined to one named current condition (task card inresearch/compact-agreement-set-seed29/TASK.json).0b1cccf86e2f5132ed286a26ef0a681a495740ea, head5577d53fonresearch/agent-29-compact-repair-9e531d2b.research/compact-agreement-set-seed29/.What this adds
For the compact dirty-control selected-bit operation of
notes/compact-control-movement.tex("Guards and deterministic repair"), the exact raw agreement-and-restoration setAG— states where the complete routine already equals the ideal selected-bit XOR map and restores every dirty temporary — is computed on complete bounded domains and compared with the three published sufficient guards:G0original temporary+target guard (plusunonsaturation for the later source)G1expanded source-control predicate (lastudigit free)research/compact-carry-repair-auditHtwo-pass guard (1)research/compact-late-guard-audit-seed73n in {2,3},K in {3,4,5,6},G in {1,2}, both source orders). Both published failure fixtures reproduce exactly under the independent interpreter:(x,y,t,u,b)=(16,4224,0,1,2)returnsy=4752against idealy=4240with temporaries restored, and(2,124,1,0,7)returns the correcty=126while corrupting the temporary1 -> 5.|AG|/total = 11880712/24074240 = 49.35%overall, against guard maxima of 14.06% (G0), 7.03% (G1) and 44.83% (H); e.g. atn=2,K=5,G=1(later source):AG39.55% vsG01.562%,G13.125%,H18.750%. Smallest necessity witnesses are recorded per cell (ag_outside_all,ag_outside_all_activeinRESULT.json), e.g.[y,t,u,c]=[0,1,0,1]atn=2,K=3,G=1: the saturated temporary digit is never loaded, so the feared carry cannot fire. The guards are safe repair envelopes, not the agreement set — quantifying the gap the seed73 README leaves open ("not the global exact agreement set").H's exact density matches the enumerated counts at all 21 later-source cells (exact integer agreement required). InclusionsG0 => G1 => Hhold on every cell, andG0/G1's target condition2B <= g < 2^(K-1)-2Bis empty forK <= G+3— those guards only engage atK >= G+4.[4240,0,0,1]); low-rhotarget bits and arbitrary dirty back-field values must not change results (256 states x 4 dirty values); pinned source hashes verified; receipt replay compares withRESULT.jsonand writes no artifacts.Relation to concurrent work
Open #1603 (
research/compact-late-carry-guard, claim/handoff in #1588) is independent concurrent work on the same family: a stronger sufficient guard admitting inactive saturated digits (exactly the class of the smallestAG \ guardwitnesses above), with maximality proved only forn=1, and a handoff requesting then>1enumeration. This package supplies that enumeration layer atn=2,3and additionally includes agreement states with internalu-load carries and cancellations between individually inexact subcalls, which that PR states remain outside its guard. Its guard is not present in this base and was not transcribed or tested here.Reproduce
From the repository root, Python 3.10+, standard library only:
Expected:
PASS_COMPACT_AGREEMENT_SET: 24074240 states; 11880712 raw agreements; 47 cells; 2 fixtures; 2 controls. Registered replay (Python 3.12) passes:python3.12 scripts/research_package.py --package research/compact-agreement-set-seed29->PASS_REGISTERED_RESEARCH_PACKAGE research/compact-agreement-set-seed29 outcome=completed; metadata/pins:... --check-only->PASS_PACKAGE_METADATA_AND_PINS.Limitations and obligations not checked
TS^-1, record keys), its cost charges and the complete-range invariant after row splitting (docs/audit.mdlines 114-116) remain open; this audits the raw map before any repair.n<=3,K<=6,G<=2); no proof-assistant formalization; transcription fidelity rests on the source note, the two reproduced fixtures and the pinned hashes. Unchecked: PR 1603's guard, then=1maximality claim, hosting/precision/tape/restoration obligations outside this named condition, and any full cold replay.Credit
Predecessors:
notes/compact-control-movement.tex(Douglas Colkitt / OpenAI source semantics); #1247 (Hanson Sun) for the two-pass guardHand its density, independently re-derived with fixture 2 inresearch/compact-late-guard-audit-seed73;research/compact-carry-repair-auditforG1and fixture 1, following #1475 (Sagar Thakrar) and PR 1219's one-pass fact;scripts/audit_compact_controls.pyas the pinned source-bound checker of record (no code shared); #1603 for the concurrent stronger guard and itsn>1handoff. Overlap receipt (complete pagination, 482 open PRs / 458 discussion records at 10:53-10:55 UTC) is recorded inTASK.json.