diff --git a/docs/ci-verification.md b/docs/ci-verification.md index 63ba3e9aa8..52b62d0481 100644 --- a/docs/ci-verification.md +++ b/docs/ci-verification.md @@ -1,8 +1,25 @@ # CI verification -## Current selected-family replay: #6030 +## Current selected-family replay: #7000 with #7001 The [selected record](../certificates/selected-result.json) binds conditional +κ = 0.00363005817 to the [application review](research/pr-intake-evidence/pr7000-application/PROOF-REVIEW.md), +[validation receipts](research/pr-intake-evidence/pr7000-application/VALIDATION.json), +and [explicit source closure](../certificates/frontier7000-source.json). +`make frontier7000-verify` follows that exact-source selected replay. The review +reuses eleven authenticated preceding executions and records seven fresh serial +application, scalar and complete native-catalogue executions. The earlier +monolithic timeout is retained separately and is not completed coverage. +Consult the receipts for exact commands, source heads and limits. + +The five inherited framework assumptions remain. No complete uniform word, +literal multiplier execution, independent human proof or formal-kernel proof +is asserted. Routine research submissions do not need to rerun this +selected-family replay. The sections below preserve historical checkpoints. + +## Historical selected-family replay: #6030 + +The [historical checkpoint](../certificates/checkpoints/frontier6030.json) binds conditional κ = 0.003125804 to the [proof review](research/pr-intake-evidence/pr6030-audit/PROOF-REVIEW.md), [validation receipts](research/pr-intake-evidence/pr6030-audit/VALIDATION.json), and [explicit source closure](../certificates/frontier6030-source.json). diff --git a/research/bit-two-carrier-chronology/PROOF.md b/research/bit-two-carrier-chronology/PROOF.md new file mode 100644 index 0000000000..cf6afc3cb1 --- /dev/null +++ b/research/bit-two-carrier-chronology/PROOF.md @@ -0,0 +1,50 @@ +# Fixed-source two-carrier exclusion + +Use the exact selected #7001 native word. Public fields initially carry the +659 independent binary unit rows. An ADD XORs two cocharted rows, a SWAP +exchanges rows and frames, and a MOVE changes the chart label. Owned INIT +starts a zero row. CLEAR follows the retained owned-erasure premise. The +replayed public endpoint is `X_i → X_i`, `Y_i → Y_i + X_i` and every helper +independent. This calculation concerns the necessary binary scalar rows. + +Summary 770 is initialized at event 26,857, descends at event 26,861, and is +first read at event 32,938, with zero-based indices. Preserve the other +summaries and scalar contacts. Grant replacing up to two existing public +ascents by carriers that bring their actual source rows to chart zero. For +an ascent on one owner, its source row is fixed between the previous and +following contacts, ignoring the chart change of that ascent. An eligible +source has a positive-dimensional chart and an open cut in this contact +window after the summary INIT and by the first read. Even while granting +independent clock choices, there are only 907 eligible positive-rank events. +Both additional eligible rank-zero source rows reduce to zero in the retained +quotient. + +Let B be the span of every original chart-zero row available in that window, +except summary 770 itself. There is no original read from 770 before the end +of the window, so no other retained row in the window includes its effect. +Giving access to the entire span overgrants timing, retention and copies. +Keeping the retained scalar prefix, any new chart-zero contribution from +one or two such carriers lies in the span of B and their literal source +rows. New scalar combinations of available rows stay in that span. Grant +free repair that restores the exact original public continuations without +supplying a new chart-zero row. This relaxes the transport and price tests. + +The replay computes dim B = 119 and a nonzero coset t of the target row. +For each eligible source row, compute its coset s in the same quotient. +Recovery requires s=t for one source, or s₁+s₂=t for two. Count the latter by +looking up t+s₁ in the full multiset. The lookup includes same-owner and +disjoint-clock pairs as a relaxation. Both counts are zero. Thus all 821,022 +ordered distinct-owner pairs are excluded by the necessary row test without +requiring any paid price or endpoint restrictions. The retained Boolean +calculation is not an all-width native lowering proof. + +The replay independently reconstructs the event pool and quotient with +low-pivot binary elimination. A second exact screen uses high-pivot +elimination, explicitly checks 4,096 ordered pairs before its case cap, and +independently indexes the entire source pool. Positive controls admit a +synthetic pair and a single-source match. Negative controls reject a changed +synthetic target and the target outside the retained basis. + +This result fixes the literal source rows and summary 770. A modified prefix +that produces a different row, a different summary, and more than two +carriers remain open. No complete supplier or κ improvement is claimed. diff --git a/research/bit-two-carrier-chronology/README.md b/research/bit-two-carrier-chronology/README.md new file mode 100644 index 0000000000..878ef122ab --- /dev/null +++ b/research/bit-two-carrier-chronology/README.md @@ -0,0 +1,41 @@ +# Two public carriers cannot recover selected BIT summary 770 + +**NO VERIFIED GAIN.** On the exact paired #7001 native word, one or two +existing public MOVE source rows cannot recover summary 770 before its first +consumer under the fixed scalar prefix. The exact screen grants all retained +chart-zero rows over the full read window and free public endpoint repair. +It checks 907 source events on 547 owners. No single or paired source reaches +the target row in the quotient, including every one of the 821,022 ordered +pairs of distinct owners. [Proof](PROOF.md) + +## Replay + +Use CPython 3.12 from a clean checkout at this package's commit. + +```sh +python3.12 -B scripts/research_package.py --package research/bit-two-carrier-chronology +``` + +The verifier authenticates the #7001 native word, replays all 659 public +endpoint rows and the owned clocks, reconstructs the exact source pool and +checks complementary cosets by binary elimination. The receipt records source +counts, exclusions and the immutable input hash. [Receipt](RECEIPT.json) + +## Scope and credit + +[#7149](https://github.com/CrocSwap/integer-mult-bounds/pull/7149) proves +support bounds for joint replacements under fixed monotone public flow. This +follow-up changes the proposed chronology by allowing two existing source +rows to descend to chart zero. It holds the source rows and retained +continuations fixed. Ali Romman's [#5421](https://github.com/CrocSwap/integer-mult-bounds/pull/5421) +supplied the owned relation mechanism. DreamingOfClouds, zxv, CubeJerry and +retained authors supplied the native and paired-controller lineage. Material +OpenAI Codex and subagent assistance. Apache-2.0. + +## Open next questions + +Can an earlier legal scalar edit produce a new live source row? First find a +small, exact source edit with a live cocharted donor before one of these +ascents. Preserve arbitrary public output rows and charge the full paid and +ordinary changes. The proof does not cover new producer rows, other summaries +or three or more carriers. diff --git a/research/bit-two-carrier-chronology/RECEIPT.json b/research/bit-two-carrier-chronology/RECEIPT.json new file mode 100644 index 0000000000..86df5dcf3c --- /dev/null +++ b/research/bit-two-carrier-chronology/RECEIPT.json @@ -0,0 +1,17 @@ +{ + "basis_rank": 119, + "dependencies": { + "research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz": "51203e7fc75ba10bd3ac3f8e675759f47e13d262bea66b6600d1e515095cad78" + }, + "first_read": 32938, + "one_source_matches": 0, + "ordered_distinct_owner_pairs": 821022, + "public_endpoint_rows": 659, + "rank_zero_sources_in_retained_basis": 2, + "source_events": 907, + "source_owners": 547, + "status": "PASS_TWO_CARRIER_BIT_ROW_EXCLUSION", + "summary": 770, + "summary_init": 26857, + "two_source_matches_including_same_owner": 0 +} diff --git a/research/bit-two-carrier-chronology/SOURCES.json b/research/bit-two-carrier-chronology/SOURCES.json new file mode 100644 index 0000000000..d7caabea2b --- /dev/null +++ b/research/bit-two-carrier-chronology/SOURCES.json @@ -0,0 +1,24 @@ +{ + "schema_version": 1, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "files": [ + { + "path": "certificates/selected-result.json", + "usage": "provenance", + "git_blob": "75d77b328ea02ded535e7f23aee5b1e55d0bb1a8", + "sha256": "154c3d30455d778fd3343b6b4851f0fa4665f0f7625b0adb3675e2bafbbf6bf1" + }, + { + "path": "docs/research/agent-task-catalog.json", + "usage": "provenance", + "git_blob": "3404fbdd5e7529a0674eef26114b5071e4586cec", + "sha256": "ead6cdc9d0af6d58e8a49744d8ec8c7c15e13d2ba93c276c434bcf9b51b93a81" + }, + { + "path": "research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz", + "usage": "input", + "git_blob": "b718d6b2848215ad785022106dfa9f871a3d1c0c", + "sha256": "51203e7fc75ba10bd3ac3f8e675759f47e13d262bea66b6600d1e515095cad78" + } + ] +} diff --git a/research/bit-two-carrier-chronology/TASK.json b/research/bit-two-carrier-chronology/TASK.json new file mode 100644 index 0000000000..0dd54a9e03 --- /dev/null +++ b/research/bit-two-carrier-chronology/TASK.json @@ -0,0 +1,77 @@ +{ + "actual_scope": "One or two existing public MOVE sources for summary 770 on the exact #7001 word. Preserve the literal scalar prefix and other summaries, grant all retained chart-zero rows over its read window and free endpoint repair.", + "ai_assistance": "Substantial OpenAI Codex and subagent assistance, including two exact implementations of the projection test.", + "author": "ToikY", + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "bottleneck_link": "The source chronology must supply a new arbitrary-input row before an owned rank-seven descent can be retired. This test excludes all one- and two-source recovery in the scoped fixed prefix independently of tariff.", + "budget_minutes": 20, + "evidence": "659 arbitrary-input endpoint rows checked. 907 eligible source events on 547 owners, quotient basis rank 119, zero one- or two-source matches. Explicit pair screen capped at 4096, whole pool excluded by exact indexing.", + "open_questions": [ + { + "blocked_by": "Producer/consumer timing, public endpoint restoration and a fully charged route remain open.", + "first_step": "Identify a live cocharted donor before one of the pinned ascents and test the exact changed row.", + "question": "Can an earlier legal scalar edit create a new live source row?", + "why_it_matters": "An altered prefix can supply a coset absent from the fixed carrier pool." + } + ], + "original_card": { + "acceptance_gate": "A full boundary contract and paid profile; unchanged scalar counts alone are insufficient. A scoped local result may be retained without a complete supplier. Expanding it into further construction rounds requires the family-level budget and obligation gate in research-family-status.md; an optimistic passing relaxation alone is not acceptance.", + "allowed_variations": [ + "One exact source head, helper/cut region or quantified proposition and changed hypothesis; check live handoffs first. Different seeds are not different scopes." + ], + "bottleneck_link": "Judge the actual current supplier contract and complete signed target/paid bill; frozen-profile ceilings require an applicability proof.", + "existing_checks": [ + { + "evidence": "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md", + "remaining": "The next experiment must identify uncovered source-specific work. Successor archive intake does not transfer this admission.", + "scope": "Selected PR5599: complete helper-subspace construction and independent caller replay; five framework assumptions remain.", + "selected_record_sha256": "2a0220e866417774606e0f991e41b9c1d26b1f43b97857238cf478dbc7d330b5", + "source_commit": "09dd0965711ca7eeb169057a420abab1c9052137", + "status": "reviewed" + } + ], + "first_experiment": "First read #5679/#5708 and their audits as pending component proposals. Choose one uncovered helper group/cut on an exact word; compare arbitrary-input native action, targets, owned storage, both orientations and full signed bill. Stop if the gain is only a scalar count or repaid by lost targets. Do not rerun the frozen #5609 common-frame domain without changing its hypothesis.", + "first_step": { + "command": [ + "python3", + "-B", + "scripts/research_selected_baseline.py" + ], + "expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY", + "inspect": "Read revision 8, the selected review and live exact-source handoffs. Then follow this card's bounded first_experiment.", + "scope": "Source-bound orientation only, not a supplier replay or theorem proof." + }, + "id": "bit-helper-contract", + "methods": [ + "Construct and independently check one source-bound instance of the stated first experiment.", + "Seek an exact counterexample or target-specific complete-budget obstruction to that same proposed change." + ], + "overlap_terms": [ + "G20", + "helper split", + "5679", + "5708", + "independent target" + ], + "question": "Can a changed G20 helper path or independent-target split improve the complete BIT moment without losing its physical endpoint?", + "scope_change_triggers": [ + "Changing source head, helper/cut domain, operation alphabet or caller boundary without recording the new scope.", + "Treating an archived proposal or local numerical pass as complete supplier admission." + ], + "starting_points": [ + "docs/research/current-priorities.md", + "docs/research/research-family-status.md", + "certificates/selected-result.json", + "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md", + "research/g20-helper-split/README.md", + "research/g20-conjugation-admission/README.md" + ] + }, + "outcome": "negative-result", + "priority_revision": 8, + "schema_version": 1, + "scope_change_reason": "Change the proposed public chronology after #7149 closed the fixed monotone support scope. Preserve actual source rows and test one summary.", + "scope_status": "refined", + "stop_rule": "Replay all literal source events. Check at most 4096 explicit ordered pairs. Use an exact quotient multiset to check the whole pool under weaker timing and owner constraints.", + "task_id": "bit-helper-contract" +} diff --git a/research/bit-two-carrier-chronology/VERIFY.json b/research/bit-two-carrier-chronology/VERIFY.json new file mode 100644 index 0000000000..8e71990e91 --- /dev/null +++ b/research/bit-two-carrier-chronology/VERIFY.json @@ -0,0 +1,14 @@ +{ + "commands": [ + { + "argv": ["{python}", "-I", "-B", "{package}/verify.py"], + "checks": "Authenticate the selected word, replay its 659 arbitrary-input endpoint rows, reconstruct the 907 source events and exhaust the one- and two-carrier quotient tests by exact indexing.", + "timeout_seconds": 30 + } + ], + "inputs": ["research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz"], + "python": "3.12", + "requirements": [], + "schema_version": 1, + "status": "ready" +} diff --git a/research/bit-two-carrier-chronology/verify.py b/research/bit-two-carrier-chronology/verify.py new file mode 100644 index 0000000000..0ce20e80c9 --- /dev/null +++ b/research/bit-two-carrier-chronology/verify.py @@ -0,0 +1,142 @@ +"""Exact source-row exclusion for BIT summary 770 and two public carriers.""" +from bisect import bisect_left +from collections import Counter, defaultdict +import gzip +from hashlib import sha256 +import json +from pathlib import Path + +HERE = Path(__file__).resolve().parent +SOURCE = 'research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz' +PIN = '51203e7fc75ba10bd3ac3f8e675759f47e13d262bea66b6600d1e515095cad78' +SUMMARY = 770 +INIT = 26857 +READ = 32938 + + +def basis(values): + pivots = {} + for value in values: + while value: + lead = value & -value + if lead not in pivots: + pivots[lead] = value + break + value ^= pivots[lead] + ordered = sorted(pivots.items()) + + def reduce(value): + for lead, pivot in ordered: + if value & lead: + value ^= pivot + return value + + return reduce, len(pivots) + + +def matches(signatures, target): + return signatures[target], sum(n * signatures[s ^ target] for s, n in signatures.items()) + + +def verify(path): + raw = path.read_bytes() + assert sha256(raw).hexdigest() == PIN + word = json.loads(gzip.decompress(raw)) + n = word['public'] + assert n == 659 + dims = {int(key): f['dim'] for key, f in word['frames'].items()} + frames = word['start'] + [None] * word['owned_fields'] + rows = [1 << i for i in range(n)] + [0] * word['owned_fields'] + touch = defaultdict(list) + ascents = [] + zero_rows = set() + target = None + first_read = None + erasures = 0 + for i, (op, a, *args) in enumerate(word['program']): + touch[a].append(i) + changed = [a] + if op == 'ADD': + b, f = args + assert a != b and frames[a] == frames[b] == f + touch[b].append(i) + if b == SUMMARY and first_read is None: + first_read = i + rows[a] ^= rows[b] + elif op == 'SWAP': + b = args[0] + assert a < n and b < n + touch[b].append(i) + changed.append(b) + frames[a], frames[b] = frames[b], frames[a] + rows[a], rows[b] = rows[b], rows[a] + elif op == 'MOVE': + f, g = args + assert frames[a] == f + frames[a] = g + if a < n: + assert dims[f] < dims[g] + ascents.append((i, a, f, rows[a])) + elif a == SUMMARY: + assert target is None and dims[f] == 7 and g == 0 + target = rows[a] + elif op == 'INIT': + assert a >= n and frames[a] is None + frames[a], rows[a] = args[0], 0 + if a == SUMMARY: + assert i == INIT + else: + assert op == 'CLEAR' and a >= n and frames[a] == args[0] + erasures += bool(rows[a]) + frames[a], rows[a] = None, 0 + if INIT <= i < READ: + owners = range(len(frames)) if i == INIT else changed + zero_rows.update(rows[j] for j in owners if j != SUMMARY and frames[j] == 0) + + assert first_read == READ and target is not None + assert frames == word['final'] + [None] * word['owned_fields'] + assert all(rows[i] == (1 << i) ^ ((1 << (i-111)) if 111 <= i < 222 else 0) for i in range(n)) + assert len(ascents) == 2862 and erasures == 237 + + pool = [] + zero_sources = [] + for i, role, frame, row in ascents: + contacts = touch[role] + j = bisect_left(contacts, i) + assert contacts[j] == i + previous = contacts[j-1] if j else -1 + following = contacts[j+1] if j+1 < len(contacts) else len(word['program']) + if previous < READ and following > INIT: + if dims[frame]: + pool.append((role, row)) + else: + zero_sources.append(row) + + reduce, rank = basis(sorted(zero_rows)) + goal = reduce(target) + assert rank == 119 and goal + assert len(zero_sources) == 2 and all(reduce(row) == 0 for row in zero_sources) + assert basis([*sorted(zero_rows), target])[0](target) == 0 + assert matches(Counter({1: 1, 2: 1}), 3) == (0, 2) + assert matches(Counter({1: 1, 2: 1}), 4) == (0, 0) + assert matches(Counter({1: 1, 2: 1}), 1) == (1, 0) + signatures = Counter(reduce(row) for _, row in pool) + one, two = matches(signatures, goal) + assert (one, two) == (0, 0) + owners = Counter(role for role, _ in pool) + ordered_pairs = len(pool)**2 - sum(v*v for v in owners.values()) + assert (len(pool), len(owners), ordered_pairs) == (907, 547, 821022) + return dict(status='PASS_TWO_CARRIER_BIT_ROW_EXCLUSION', summary=SUMMARY, + summary_init=INIT, first_read=READ, basis_rank=rank, public_endpoint_rows=n, + source_events=len(pool), source_owners=len(owners), ordered_distinct_owner_pairs=ordered_pairs, + rank_zero_sources_in_retained_basis=len(zero_sources), + one_source_matches=one, two_source_matches_including_same_owner=two, + dependencies={SOURCE: PIN}) + + +if __name__ == '__main__': + if not __debug__: + raise RuntimeError('Use assertions') + report = verify(HERE.parents[1] / SOURCE) + assert json.dumps(report, indent=2, sort_keys=True) + '\n' == (HERE / 'RECEIPT.json').read_text() + print(report['status']) diff --git a/research/historical-selected-replay-gap/README.md b/research/historical-selected-replay-gap/README.md index 55d8cc3b49..36d9a873ca 100644 --- a/research/historical-selected-replay-gap/README.md +++ b/research/historical-selected-replay-gap/README.md @@ -69,7 +69,11 @@ python3 -B scripts/research_package.py --package research/historical-selected-re The direct command prints `PASS_HISTORICAL_SELECTED_REPLAY_GAP`. A registered replay prints `PASS_REGISTERED_RESEARCH_PACKAGE`. Both require Git history -containing the two inspected commits. +containing the two inspected commits and the source and manifest objects at +`2485805a6d47f36ea83ddde6327d453ac82d44dc`. The verifier uses a temporary +sparse checkout of that commit, checks the declared source digests there, and +uses its planner and manifest inventory. The recorded rejections and selection +therefore remain reproducible after later changes to the live Makefile or CI guide. ## Open next questions diff --git a/research/historical-selected-replay-gap/SOURCES.json b/research/historical-selected-replay-gap/SOURCES.json index c1010eec95..62bb8b3950 100644 --- a/research/historical-selected-replay-gap/SOURCES.json +++ b/research/historical-selected-replay-gap/SOURCES.json @@ -4,13 +4,13 @@ "files": [ { "path": "Makefile", - "usage": "input", + "usage": "provenance", "git_blob": "0d683a06b9e7ee162496108ce9a7c5d2ee94fccf", "sha256": "4f2d4f2dcd15139ec82658a975f85ed300897385f85799218539f4c8d60567da" }, { "path": "certificates/partial-swap-network.json", - "usage": "input", + "usage": "provenance", "git_blob": "eccafa830c16170c36faf93045ddf1f638f7bcd4", "sha256": "4c0b9d37e1034b2076e30a70f8e514416298c462d9ee98bc87fe6556b14df786" }, @@ -22,7 +22,7 @@ }, { "path": "docs/ci-verification.md", - "usage": "input", + "usage": "provenance", "git_blob": "63ba3e9aa8bdc5e942b56e34244b92b16f854085", "sha256": "c7d3027e9ad8bcbff68f07aa9576b30fb2f3c76c44d876d40c7fdbf4a3e2228a" }, @@ -34,163 +34,163 @@ }, { "path": "research/clifford-state-performance/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "6f98a0061a5104dfab82c9e806f819b41811f684", "sha256": "396d0f08df24952248140d5c65c51b8c902ef1c580892ff7ea182890530f67ee" }, { "path": "research/community-batch1047-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "5e0f92af463ec12c5e1dcc3effd44081a88af647", "sha256": "07a9daeaf2bda308a92e9a4684f13d5fc766c7772d74801fceb7f4599fdab226" }, { "path": "research/community-batch1099-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "9e13266bf85e627f1b7dc225e9530ea69fd2c7f0", "sha256": "421e1211fb1897c45621dc6801c276e53f2e6f335583c9c9049e535f87c0a3b1" }, { "path": "research/community-batch932-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "cc4d03eb59b9ab3f952735f7e88ff18c2d15d7af", "sha256": "184629cac91a5cfaca50330a88596008b824221433867dcf8117539c913c284a" }, { "path": "research/community-batch970-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "8b9f4111badf7de5d97684799560b55110e9da79", "sha256": "23188ed920e38a54006cb883e181585620821c63bf7e8b5e05d32719417cc37e" }, { "path": "research/community-frontier741-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "a5300d4e7a5381a3f443fc54c768ca6f0f236d68", "sha256": "3c820fb30e1b4d9bcfc6a7ab524375e5b2abd66b940af2c509146104f0bcd79c" }, { "path": "research/community-frontier890-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "d7ff6d777b01d69b6ce84caf25d3b7e4a4d2f211", "sha256": "6b185a9902652f893f3ebd8ada92d2f11b6de6533a9a4d11718a8a4496101128" }, { "path": "research/community-hyperplane599-audit/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "546f37d326d10a99910ae8f908e71ef768524d98", "sha256": "65099d764bfcc39bda5e4d9966783611b094c3522dbdd1435cd498d657a8ef8e" }, { "path": "research/community-k492-audit/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "e538481e4cb16ed936d3195f2dfb5b5a9ca0a76b", "sha256": "2c0f4fa5bc150d05658af2e7c54c4d2c337dd52b7efd3d69530ae73bcbdf452a" }, { "path": "research/community-reconciliation92-audit/MANIFEST.json", - "usage": "input", + "usage": "provenance", "git_blob": "2a2e93685173d5f13cbb5abe740f5d90352e0228", "sha256": "5f501f3c118131e7d069f30ad77186eb2ad6961f9680a0ef105f4514ed41808a" }, { "path": "research/partial-swap-digest/baseline.py", - "usage": "input", + "usage": "provenance", "git_blob": "a2f0190704db83bd8ef48e46e723c49b925804fe", "sha256": "81e9af92cdf38243a540cdcff2062778e449467848d444da37a9553c12ca4c34" }, { "path": "research/r420-two-sided-basis/SOURCES.json", - "usage": "input", + "usage": "provenance", "git_blob": "5d718e11e62f4bcadecf1e02d6b61f87dbe190b0", "sha256": "d9810b0d139c5a1211fd2c1f0d142187cc1fca30026e1e7bc4f9ecfacf1596d1" }, { "path": "research/skip-clones/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "8d1bb3b9c8189e35e5d8bfdfa632d7473e8be0d5", "sha256": "0b68e63e35a97ce6b0cdb6e291b88ebaa8f2dd4afb70b2498f10ee89428258dc" }, { "path": "research/split-skip/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "2ab610b6ea2edd2865fda793ef2168b0c76afb4f", "sha256": "7c2b4646a3ecfef6f881da5c43e4bd0fa9a4d1b00548b8ab458d897e16735134" }, { "path": "scripts/historical-ci-inputs/Makefile", - "usage": "input", + "usage": "provenance", "git_blob": "aff68409021c9d401a6f8013b9dfd7dbcc30f2a8", "sha256": "ea8830dd79da493e2d75baf753d733ff7efbcf2b4794afe41fae0ac8f3055646" }, { "path": "scripts/historical-ci-inputs/ledger-batch932-run_isolated_tests.py", - "usage": "input", + "usage": "provenance", "git_blob": "65db599ab0b1dea0312c4ca048e0bd0f44c3736f", "sha256": "96ea543e6c707424afe247e77bd86c82152f90fc76a0773c4232145da5cdf8d1" }, { "path": "scripts/historical-ci-inputs/ledger-batch932-test_isolated_test_runner.py", - "usage": "input", + "usage": "provenance", "git_blob": "34820a8f24678f918f4d0e7a35380d8013fc3495", "sha256": "628391b6abfbc8674ceec1751867a4392f2cc0b5b66886243e139af86cf355ac" }, { "path": "scripts/historical-ci-inputs/ledger-batch970-verify_selected_result.py", - "usage": "input", + "usage": "provenance", "git_blob": "c755b76e0d44ba4917aa94440ebe54daefce5b2a", "sha256": "d7fd929726b326aeeaf0a3996475adec88eee9aac09ae0bebeeaa0bc1fc8f199" }, { "path": "scripts/historical-ci-inputs/ledger-frontier741-ci-verification.md", - "usage": "input", + "usage": "provenance", "git_blob": "7f3c012504187917a728b9fe87043f0fc8cd006a", "sha256": "a854022e0e1d5d4db4d60e586be3ea56005013ef14a1fc06d02bc06e8529c4b0" }, { "path": "scripts/historical-ci-inputs/partial-swap-context.json", - "usage": "input", + "usage": "provenance", "git_blob": "ad65114886bf34a4fd27e79f3be502389e689faa", "sha256": "833a9642f33aeab2ffea17ec9c6b82e0a953f90192b2c82e10bef21538dccba9" }, { "path": "scripts/historical-ci-inputs/partial-swap-network.json", - "usage": "input", + "usage": "provenance", "git_blob": "52075f2463f60af5e16571347f24274fce73a1ea", "sha256": "f3c4be597b2f2136da4ae2cc80c7454f63c90aa01f84e5b8131cee4dd55de815" }, { "path": "scripts/partial_swap/shared.py", - "usage": "input", + "usage": "provenance", "git_blob": "44a0e454c70f9c4b98e258b8443612e6a119904b", "sha256": "5a0646a50b9f3e8ea55168620a78e8853b0ab810517cefc8cfb8696aedee278a" }, { "path": "scripts/replay_historical_check.py", - "usage": "input", + "usage": "provenance", "git_blob": "1e92fff2782970ef71378f594f2350d245a4db26", "sha256": "5467619c78183d3adc82b0cb55af28e5c1a01fca2b0588677816244b53e2bafd" }, { "path": "scripts/research_package.py", - "usage": "input", + "usage": "provenance", "git_blob": "091b4c8f58bac9a9580d76025b887dc5c873d05f", "sha256": "e1256016e7f51827d04fa2179255989f639ae1d97afaa9c16265f85a0c6abd70" }, { "path": "scripts/run_isolated_tests.py", - "usage": "input", + "usage": "provenance", "git_blob": "a96ab35b315ce492e7fbbfd6c5ae211aa066b541", "sha256": "49eb56dd0fc0d8d8ffdb209970a7adf2176223580646f575d5c22e59543b381c" }, { "path": "scripts/verify_selected_result.py", - "usage": "input", + "usage": "provenance", "git_blob": "6882a4700e410dec569b51ae2eaf1a19cc019195", "sha256": "d6b305eac5b9bdb8172c469ad30a1655a60fa0aceac8b1bf610e1b73f51babd8" }, { "path": "tests/test_isolated_test_runner.py", - "usage": "input", + "usage": "provenance", "git_blob": "343b24abf6719b81805eba5a84c74e57634c8288", "sha256": "3a5470d0b139828b90e19bf9583ddeafcd69f8e34f2824664eb3a2958a52e34d" } diff --git a/research/historical-selected-replay-gap/VERIFY.json b/research/historical-selected-replay-gap/VERIFY.json index 98553e72ed..ab7efa3471 100644 --- a/research/historical-selected-replay-gap/VERIFY.json +++ b/research/historical-selected-replay-gap/VERIFY.json @@ -4,36 +4,7 @@ "python": "3.12", "requirements": [], "inputs": [ - "Makefile", - "certificates/partial-swap-network.json", - "docs/ci-verification.md", - "research/clifford-state-performance/SOURCE.json", - "research/community-batch1047-audit/CONTENT-COVERAGE.json", - "research/community-batch1099-audit/CONTENT-COVERAGE.json", - "research/community-batch932-audit/CONTENT-COVERAGE.json", - "research/community-batch970-audit/CONTENT-COVERAGE.json", - "research/community-frontier741-audit/CONTENT-COVERAGE.json", - "research/community-frontier890-audit/CONTENT-COVERAGE.json", - "research/community-hyperplane599-audit/SOURCE.json", - "research/community-k492-audit/SOURCE.json", - "research/community-reconciliation92-audit/MANIFEST.json", - "research/partial-swap-digest/baseline.py", - "research/r420-two-sided-basis/SOURCES.json", - "research/skip-clones/SOURCE.json", - "research/split-skip/SOURCE.json", - "scripts/historical-ci-inputs/Makefile", - "scripts/historical-ci-inputs/ledger-batch932-run_isolated_tests.py", - "scripts/historical-ci-inputs/ledger-batch932-test_isolated_test_runner.py", - "scripts/historical-ci-inputs/ledger-batch970-verify_selected_result.py", - "scripts/historical-ci-inputs/ledger-frontier741-ci-verification.md", - "scripts/historical-ci-inputs/partial-swap-context.json", - "scripts/historical-ci-inputs/partial-swap-network.json", - "scripts/partial_swap/shared.py", - "scripts/replay_historical_check.py", - "scripts/research_package.py", - "scripts/run_isolated_tests.py", - "scripts/verify_selected_result.py", - "tests/test_isolated_test_runner.py" + "scripts/research_package.py" ], "commands": [ { diff --git a/research/historical-selected-replay-gap/verify.py b/research/historical-selected-replay-gap/verify.py index 83b995941a..9d266c5a4e 100644 --- a/research/historical-selected-replay-gap/verify.py +++ b/research/historical-selected-replay-gap/verify.py @@ -6,8 +6,10 @@ """ import hashlib import importlib.util +import json import subprocess import sys +import tempfile from pathlib import Path ROOT = Path(__file__).resolve().parents[2] @@ -61,31 +63,47 @@ def require(ok, message): raise SystemExit(message) -def load_checker(): - path = ROOT / "scripts/replay_historical_check.py" - spec = importlib.util.spec_from_file_location("historical_selected_replay_gap_checker", path) +def load_module(path): + spec = importlib.util.spec_from_file_location(path.stem, path) module = importlib.util.module_from_spec(spec) spec.loader.exec_module(module) return module +def checkout_snapshot(snapshot, sources, runner, env): + paths = [runner.canonical_relative_path(row["path"]) for row in sources["files"]] + git = ["git", "-c", "maintenance.auto=false", "-c", "gc.auto=0", + "-c", "core.autocrlf=false"] + subprocess.run([*git, "clone", "--quiet", "--shared", "--no-tags", "--no-checkout", + "--", str(ROOT), str(snapshot)], cwd=ROOT, env=env, check=True) + subprocess.run([*git, "update-ref", "--no-deref", "HEAD", INSPECTED], + cwd=snapshot, env=env, check=True) + # The pinned planner reads omitted manifests from the sparse HEAD/index. + patterns = "".join(f"/{path.as_posix()}\n" for path in paths) + subprocess.run([*git, "sparse-checkout", "set", "--no-cone", "--stdin"], + cwd=snapshot, env=env, input=patterns.encode("utf-8"), check=True) + subprocess.run([*git, "read-tree", "-mu", "HEAD"], cwd=snapshot, env=env, check=True) + for path, row in zip(paths, sources["files"], strict=True): + require(hashlib.sha256((snapshot / path).read_bytes()).hexdigest() == row["sha256"], + "historical checkout source digest changed: " + path.as_posix()) + + def entries(checker): for name, config in checker.CONFIG.items(): for entry in [config, *config.get("additional_inputs", [])]: yield name, entry -def reject(checker, entry): +def reject(root, checker, entry): try: - checker.authenticated_input(ROOT, entry) + checker.authenticated_input(root, entry) except ValueError as exc: return str(exc) raise SystemExit("historical input was admitted: " + entry["path"]) -def main(): - require(not sys.flags.optimize, "assertions must stay enabled") - checker = load_checker() +def check_snapshot(root, env): + checker = load_module(root / "scripts/replay_historical_check.py") selected = [entry for name, entry in entries(checker) if name == "tooling-ledger" and entry["path"] == SELECTED_PATH] require(len(selected) == 1, "selected-result checker overlay is not unique") @@ -94,7 +112,7 @@ def main(): require(entry["accepted_live_sha256"] == [SELECTED_ACCEPTED], "accepted selected-checker successors changed") frozen = (checker.INPUTS / entry["input"]).read_bytes() - live = (ROOT / SELECTED_PATH).read_bytes() + live = (root / SELECTED_PATH).read_bytes() require(hashlib.sha256(frozen).hexdigest() == SELECTED_PIN, "frozen selected checker bytes changed") require(hashlib.sha256(live).hexdigest() == SELECTED_LIVE, "live selected checker digest changed") require(SELECTED_LIVE not in (SELECTED_PIN, SELECTED_ACCEPTED), "live checker was already admitted") @@ -102,7 +120,7 @@ def main(): # live successor, not a broken comparison. require(SELECTED_PIN in (SELECTED_PIN, *entry["accepted_live_sha256"]), "pin membership control failed") - require(reject(checker, entry) == REJECTIONS[SELECTED_PATH][1], + require(reject(root, checker, entry) == REJECTIONS[SELECTED_PATH][1], "selected checker rejection text changed") counts = {path: 0 for path in REJECTIONS} @@ -110,7 +128,7 @@ def main(): for _name, item in entries(checker): if item["path"] not in REJECTIONS: continue - message = reject(checker, item) + message = reject(root, checker, item) counts[item["path"]] += 1 messages.setdefault(item["path"], message) for path, (count, message) in REJECTIONS.items(): @@ -118,20 +136,31 @@ def main(): require(messages[path] == message, "rejection text changed for " + path) require(sum(counts.values()) == 19, "rejection total changed") ci = [item for _name, item in entries(checker) if item["path"] == CI_PATH] - require(len(ci) == 1 and hashlib.sha256((ROOT / CI_PATH).read_bytes()).hexdigest() == CI_LIVE, + require(len(ci) == 1 and hashlib.sha256((root / CI_PATH).read_bytes()).hexdigest() == CI_LIVE, "selected CI note digest changed") diff = subprocess.check_output( - ["git", "diff", "--name-only", PARENT, INSPECTED], cwd=ROOT, text=True) + ["git", "diff", "--name-only", PARENT, INSPECTED], cwd=root, env=env, text=True) changed = sorted(name for name in diff.splitlines() if name) require(changed == CHANGED, "inspected commit diff changed") - sys.path.insert(0, str(ROOT / "scripts")) - from research_package import plan_details - details = plan_details(ROOT, set(changed)) + planner = load_module(root / "scripts/research_package.py") + details = planner.plan_details(root, set(changed)) require([row["package"] for row in details] == PLAN_PACKAGES, "helper plan selection changed") matched = {name for row in details for names in row["causes"].values() for name in names} require(sorted(set(changed) - matched) == UNMATCHED, "unmatched plan paths changed") - require(plan_details(ROOT, set()) == [], "empty change set selected a package") + require(planner.plan_details(root, set()) == [], "empty change set selected a package") + + +def main(): + require(not sys.flags.optimize, "assertions must stay enabled") + sources = json.loads(Path(__file__).with_name("SOURCES.json").read_bytes()) + require(sources["base_commit"] == INSPECTED, "historical checkout base changed") + runner = load_module(ROOT / "scripts/research_package.py") + env = runner.git_source_env() + with tempfile.TemporaryDirectory(prefix="historical-selected-replay-") as temporary: + snapshot = Path(temporary) / "snapshot" + checkout_snapshot(snapshot, sources, runner, env) + check_snapshot(snapshot, env) print("PASS_HISTORICAL_SELECTED_REPLAY_GAP") print("selected_checker_live=" + SELECTED_LIVE) print("rejections=19 distinct_paths=7 plan_packages=9")