From 6fafd9f5983e9d6a573756e73f8b700fe90e4832 Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Wed, 11 Nov 2026 12:46:59 +0000 Subject: [PATCH 1/2] feat(research): prove exact rounded-image block minimum --- research/rounded-image-block-minimum/PROOF.md | 143 ++++++++++++ .../rounded-image-block-minimum/README.md | 140 +++++++++++ .../rounded-image-block-minimum/SOURCES.json | 36 +++ .../rounded-image-block-minimum/TASK.json | 80 +++++++ .../rounded-image-block-minimum/VERIFY.json | 38 +++ .../rounded-image-block-minimum/verify.py | 220 ++++++++++++++++++ 6 files changed, 657 insertions(+) create mode 100644 research/rounded-image-block-minimum/PROOF.md create mode 100644 research/rounded-image-block-minimum/README.md create mode 100644 research/rounded-image-block-minimum/SOURCES.json create mode 100644 research/rounded-image-block-minimum/TASK.json create mode 100644 research/rounded-image-block-minimum/VERIFY.json create mode 100644 research/rounded-image-block-minimum/verify.py diff --git a/research/rounded-image-block-minimum/PROOF.md b/research/rounded-image-block-minimum/PROOF.md new file mode 100644 index 0000000000..17d832b572 --- /dev/null +++ b/research/rounded-image-block-minimum/PROOF.md @@ -0,0 +1,143 @@ +# The sharp block count for the rounded tensor image + +This contribution was produced by Nick Petalas. Apache-2.0. +Claim type: scoped written proof with exact finite corroboration. + +## Contract and predecessors + +Use the original-coordinate layout of CubeJerry's +[PR6995](https://github.com/CrocSwap/integer-mult-bounds/pull/6995). +For an arbitrary positive number D of axes, let + +\[ + t_i=2^{\ell_i},\qquad s_i2t_i,\\0&3s_i<2t_i.\end{cases} +\] + +Equality cannot occur because t_i is a power of two. Empty products +below equal one. The sharp number of block copies is + +\[ + \boxed{R=\sum_{k=0}^{D-1}d_k + \left(\prod_{ik}s_i\right) + +\prod_{i=0}^{D-1}b_i.} \tag{1} +\] + +Equivalently, if S_i and R_i are the selected volume and run count for +axes i through D-1, then + +\[ + S_D=R_D=1,\qquad S_i=s_iS_{i+1},\qquad + R_i=d_iS_{i+1}+b_iR_{i+1}. \tag{2} +\] + +Thus D backward steps evaluate the answer without constructing T or S +individual records. This is an arithmetic-operation count for the formula, +not a constant-time bit-arithmetic or physical tape claim. + +## Proof + +First consider one axis and omit its subscript. The source indices +increase by one, and 12t and t-2 when 3s<2t. Therefore b is exactly the +indicator that the scalar image reaches its last target position t-1. +There are Q(s-1)-(s-1)=d-1+b internal gaps of size two. Every such gap +starts a new run, so the scalar image has d+b runs. + +Now treat the lowest remaining axis i as the fast axis and flatten all +higher axes into their own target field. Write S_h and R_h for the +selected volume and run count in that higher field. Each selected +higher address contributes one translated fast-axis image with d_i+b_i +runs. Two successive such images join exactly when their higher +addresses differ by one and the fast image ends at t_i-1. + +To see that no other join is possible, let delta be the positive +difference of those higher addresses. The next image's first address +minus the preceding image's last address is + +\[ + t_i\,\mathit{delta}-Q_i(s_i-1). +\] + +It equals one precisely when delta=1 and b_i=1. The higher image has +S_h-R_h adjacent selected pairs. Starting with the separate translated +images and subtracting exactly their joins therefore gives + +\[ + R_i=(d_i+b_i)S_h-b_i(S_h-R_h)=d_iS_h+b_iR_h. +\] + +This proves (2), with the empty higher field represented by one +selected point and one run. Expanding the finite recurrence proves (1). + +Finally, a contiguous interval that copies no hole lies entirely in one +maximal selected run. Every run contains a selected record that must be +copied, so every admitted readout needs at least R intervals. Copying the +R maximal runs in order attains the lower bound and preserves arbitrary +record values. This proves sharpness for every admitted packet. The +unbounded statement follows from this argument, not finite extrapolation. + +## Fixed-seam example and scope + +For \((t_i,s_i)=((4,3),(8,7),(8,5))\), axis zero fastest, +the endpoint flags are (1,1,0), and (1) gives + +\[ + R=1\cdot7\cdot5+1\cdot5+3=43. +\] + +The image has 105 records in a 256-record target field. This is a new +layout invariant for that packet, not a recount of predecessor operation +totals. In particular, multiplying scalar run counts is incorrect, and +using the scalar cyclic count silently changes the prescribed seam. +If the fast axis already has b_0=0, (2) becomes R=d_0 S_1; +no carry into a slower axis can merge two fast images. + +The theorem does not lower the cost of scanning the full input. It does +not implement a bulk-copy tape operation, change the producer's order, +prove that arbitrary axis permutations are free, or price native calls, +restoration, precision, storage or compiler work. It gives no new kappa, +supplier admission or complete multiplication theorem. All five selected +framework assumptions remain. diff --git a/research/rounded-image-block-minimum/README.md b/research/rounded-image-block-minimum/README.md new file mode 100644 index 0000000000..35d5606664 --- /dev/null +++ b/research/rounded-image-block-minimum/README.md @@ -0,0 +1,140 @@ +# Exact block minimum for the rounded tensor image + +This contribution was produced by Nick Petalas. Apache-2.0. +Claim type: scoped written proof with exact finite corroboration. +There is no new kappa or selected-frontier change. + +The original-coordinate rounded tensor image has an exact, sharp +contiguous block-copy count. This adds a layout invariant to CubeJerry's +[PR6995](https://github.com/CrocSwap/integer-mult-bounds/pull/6995), +whose physical extractor and reported invoices are cited predecessor work, +not replay targets. The question here is original local side work, not an +answer to its production-caller handoff. + +For integer dyadic target periods `t_i=2^ell_i` and integer source periods +`s_i 2*t_i, otherwise 0 +S_D = R_D = 1 +S_i = s_i*S_(i+1) +R_i = d_i*S_(i+1) + b_i*R_(i+1) +``` + +Axis zero is fastest and the linear field begins at address zero. The +minimum number of intervals that copy exactly the selected records in +order, copying each once and copying no hole, is `R_0`. Formula (1) in +[PROOF.md](PROOF.md) gives its closed finite sum. Each `b_i` states whether +the scalar image touches its right target endpoint. The proof counts all +and only the carry boundaries at which two blocks join. Copying maximal +selected runs attains the lower bound for arbitrary record contents. + +For target/source pairs `(4,3), (8,7), (8,5)` the sharp answer is +`1*7*5 + 1*5 + 3 = 43` blocks for 105 records in a 256-record target field. +This is a theorem about the layout and the stated interval-copy contract. +It is not a measured speedup or a native operation count. + +## Evidence and reproduction + +From the repository root, with standard-library CPython 3.12: + +```sh +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -W error -B research/rounded-image-block-minimum/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -O -W error -B research/rounded-image-block-minimum/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/research_package.py --package research/rounded-image-block-minimum +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/check_research_commit.py --package research/rounded-image-block-minimum --check-source-history --check-modes +``` + +Another host can substitute its CPython 3.12 path. Expected direct output +is `PASS_ROUNDED_IMAGE_BLOCK_MINIMUM` in a generated JSON receipt bound to +the six package files and three source texts. The verifier writes nothing +and imports no predecessor executable. The registered runner also checks +source Git blobs, pinned historical metadata and declared live inputs. +No receipt is hand-written or committed. + +The census enumerates every ordered dyadic packet with `sum(ell_i)<=10`, +including every admissible source period for each axis. That is 4,180 +packets, 3,270,652 target records, 1,831,047 selected records and 657,556 +maximal blocks. One engine literally rounds source coordinates. A second +scans target coordinates and tests inverse half-open integer intervals. +Their complete ordered images agree. Both the backward recurrence and +the finite sum equal the literal run count. Executing the run intervals +copies exactly the selected addresses and no hole in every packet. + +The named 256-record fixture additionally copies distinct nonzero record +values and preserves its source. Nine invalid packets reject. Five +boundary controls distinguish the fixed seam from a cyclic seam, a +trailing hole, the two axis orders of a mixed packet, and a larger +sixteen-axis formula evaluation. The last control does not enumerate its +large volume. The universal claim rests on the written proof. + +## Limits and implementation + +The exact count applies to interval copies with the stated seam and order. +It does not exclude a changed producer, paid reordering, copying holes +followed by filtering, noncontiguous native reads or a different service. +No bulk-copy tape operation or improved scan time is supplied. Source +delivery, movement, restoration, stock, precision, native cost and compiler +closure still require complete invoices. No selected cold replay, Lean, +Docker, full Gaussian transform or multiplier is run. All five selected +framework assumptions remain. Independent human and formal proof-kernel +review are unclaimed. + +The formula evaluator permits at most sixteen axes with exponents at most +64; these executable caps do not restrict the written theorem. The literal +oracle enforces target volume at most 1,024. Its worklist has capacity +5,000, checks full exhaustion, and checks its packet coverage by a separate +composition-count recurrence. All loops have finite bounds; there is no +recursion, subprocess, network access or dynamic module loading. Functions +fit within sixty physical lines. Explicit checks remain enabled under `-O`. + +Power of Ten rule 3 has a managed-runtime deviation in `verify.py`. +Python integers and collections allocate during computation. The sixteen +axis caps bound formula integers to at most 1,024 bits for the full volume; +the literal engines retain one packet of at most 1,024 addresses at a time. +The worklist retains fewer than 5,000 packets of at most five axes. Source +and package files are capped at 128 KiB each, and the manifest at eight +source rows. Hashing and JSON parsing use ordinary bounded Python +allocations; allocator internals are not instrumented. Warning-strict normal +and optimized executions plus AST/function-size inspection provide the +available diagnostics. Fixed-capacity storage would be a separate native +implementation if a real caller uses this formula. + +## Open next questions + +- What is the minimum over axis permutations that a real producer can + legally deliver? Start with an adjacent-axis exchange inequality from + recurrence (2), then price the complete physical permutation. The legal + producer layout and its movement cost are blockers. +- Can a native extractor exploit maximal blocks with a complete setup, + movement, copy and restoration invoice? Start with one literal producer + packet and an encoded block iterator. A bulk-copy service, source delivery + and ownership/precision/storage accounting remain blockers. + +The structured questions are in [TASK.json](TASK.json). Neither is reserved. + +## Sources and coordination + +Base main is `e54523517d0f03e58352e647c403a5af3e525a57`, priority revision 8, +selected #7000. The cheap source-binding orientation passed. The +complex-new-helper-inventory card is explicitly changed to this local +layout side result; no helper supplier or selected assumption is completed. +[SOURCES.json](SOURCES.json) pins the exact predecessor texts, task card +and selected record. Frozen files and predecessor credit are unchanged. + +The [advance CLAIM](https://github.com/CrocSwap/integer-mult-bounds/discussions/1166#discussioncomment-19541691) +followed live open/account PR, active Discussion, main and merged +general-form searches and local reservation checks. Those checks found +the credited scalar Beatty result, not the tensor carry formula. Their +coverage does not include every unpublished result or arbitrary unseen +diff. No global literature-priority claim is made. + +Credit CubeJerry for #6995 and its original-q extraction boundary; +Dugongue / David Ganz for #5566's scalar Beatty runs and fixed-seam warning; +the canonical Gaussian and #3851 selection authors, the retained +Tape/Count contributors, and the normalized-recovery predecessor for the +inherited image and carrier. Elementary interval counting and tensor +flattening are classical methods. Only the fixed-seam tensor count and +its stated block-readout consequence are claimed as the new step. diff --git a/research/rounded-image-block-minimum/SOURCES.json b/research/rounded-image-block-minimum/SOURCES.json new file mode 100644 index 0000000000..be51f1c213 --- /dev/null +++ b/research/rounded-image-block-minimum/SOURCES.json @@ -0,0 +1,36 @@ +{ + "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/beatty-run-gaussian-inverse/analysis.md", + "usage": "input", + "git_blob": "e5cc397cd0baacd686cb8a075d636b9e595bdfae", + "sha256": "5c015de52b1867b07296c666bbe917c89ce508f6ca45dec909aceea0518b111a" + }, + { + "path": "research/original-q-field-extraction/PROOF.md", + "usage": "input", + "git_blob": "fc340cc0ef832b4f75daf1ca8d04db60328e3654", + "sha256": "88343373c2dc09d0dd3f86b14ab8cd48834305e2cd36b9a91c57a831db1c0fd2" + }, + { + "path": "research/original-q-field-extraction/README.md", + "usage": "input", + "git_blob": "80d7910c1521abc4169e982c5ae5f62565dec00e", + "sha256": "c86faeef49046baefeaaa1ff2ed72ffa0a6b56554092dda520139ff7f0e2200d" + } + ] +} diff --git a/research/rounded-image-block-minimum/TASK.json b/research/rounded-image-block-minimum/TASK.json new file mode 100644 index 0000000000..0c323ff5c9 --- /dev/null +++ b/research/rounded-image-block-minimum/TASK.json @@ -0,0 +1,80 @@ +{ + "schema_version": 1, + "task_id": "complex-new-helper-inventory", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "complex-new-helper-inventory", + "question": "Can a changed helper inventory earn productive credit that survives completion, compilation and the actual caller?", + "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" + ], + "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." + ], + "acceptance_gate": "A source-bound arbitrary-input identity and legal producer/consumer boundary with the complete paid and productive target invoice, including restoration, ownership, native alignment and extra charges. Price under the actual current model; historical ceiling.py assumptions must be established before use. A favorable optimistic relaxation keeps a route open but is not a completed supplier. A scoped local result remains useful; expansion requires the family-level budget gate.", + "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." + }, + "first_experiment": "Specify all arbitrary inputs, owned fields, restored outputs and a physically legal consumer. Compare complete P and T, including target debits and precision/stock costs. #5599 is a positive control for target refinement, not permission to split every helper for free. #5614 is a hypothetical compiler budget, not an emitted 145-split word. Stop at the first unpaid boundary or a failing optimistic full bill.", + "bottleneck_link": "Judge the actual current supplier contract and complete signed target/paid bill; frozen-profile ceilings require an applicability proof.", + "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." + ], + "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." + ], + "overlap_terms": [ + "productive helper", + "target refinement", + "5599", + "5614" + ], + "existing_checks": [ + { + "scope": "Selected PR5599: complete helper-subspace construction and independent caller replay; five framework assumptions remain.", + "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.", + "status": "reviewed", + "source_commit": "09dd0965711ca7eeb169057a420abab1c9052137", + "selected_record_sha256": "2a0220e866417774606e0f991e41b9c1d26b1f43b97857238cf478dbc7d330b5" + } + ] + }, + "scope_status": "changed", + "actual_scope": "Exact fixed-seam contiguous block-copy minimum for the rounded original-coordinate tensor image, at arbitrary axis count.", + "scope_change_reason": "Original local layout question at the original-q extraction boundary; no helper construction, supplier admission or kappa improvement is claimed.", + "bottleneck_link": "Side result for the complete readout contract. Arbitrary hole contents forbid copying across holes without a separately paid filtering mechanism. The formula settles the exact block count before such a mechanism is priced.", + "budget_minutes": 60, + "stop_rule": "Stop at the first exact carry formula, sharp block-count proof and passing bounded independent enumeration; leave axis-order optimization and physical implementation open.", + "outcome": "completed", + "evidence": "PROOF.md and the generated stdout receipt of verify.py; registered normal and optimized commands.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "What is the minimum of the block-count formula over axis permutations that a real producer can legally deliver?", + "why_it_matters": "The fixed-seam count depends on axis order; a paid legal reorder may change the readout partition.", + "first_step": "Derive an adjacent-axis exchange inequality from recurrence (2), then compare it with the complete physical permutation cost.", + "blocked_by": "No free change to the source layout or native axis order is established." + }, + { + "question": "Can a native extractor exploit the maximal blocks with a complete setup, movement, copy and restoration invoice?", + "why_it_matters": "An exact record-block count is not an execution-time improvement.", + "first_step": "Bind one literal producer packet and implement its block iterator without an uncharged random-access coordinate list.", + "blocked_by": "Bulk-copy service, source delivery and complete ownership/precision/storage costs remain to be supplied." + } + ] +} diff --git a/research/rounded-image-block-minimum/VERIFY.json b/research/rounded-image-block-minimum/VERIFY.json new file mode 100644 index 0000000000..44e726af8d --- /dev/null +++ b/research/rounded-image-block-minimum/VERIFY.json @@ -0,0 +1,38 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [ + "research/beatty-run-gaussian-inverse/analysis.md", + "research/original-q-field-extraction/PROOF.md", + "research/original-q-field-extraction/README.md" + ], + "commands": [ + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Hash-authenticated source texts; exhaustive ordered dyadic packets with sum(ell)<=10; independent source rounding and target interval membership; exact block recurrence and finite sum; literal no-hole interval readout; invalid-input and fixed-seam/axis-order controls." + }, + { + "argv": [ + "{python}", + "-I", + "-O", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "The same complete domain and controls with assertions disabled; executable contracts use explicit ValueError checks." + } + ] +} diff --git a/research/rounded-image-block-minimum/verify.py b/research/rounded-image-block-minimum/verify.py new file mode 100644 index 0000000000..644938e659 --- /dev/null +++ b/research/rounded-image-block-minimum/verify.py @@ -0,0 +1,220 @@ +"""Exact rounded-image block counts. Produced by Nick Petalas; Apache-2.0.""" + +import hashlib +import itertools +import json +import math +from pathlib import Path + + +HERE = Path(__file__).resolve().parent +MAX_AXES = 16 +MAX_ELL = 64 +CENSUS_BITS = 10 +MAX_PACKETS = 5000 +MAX_FILE_BYTES = 131072 + + +def need(condition, message): + if not condition: + raise ValueError(message) + + +def checked_shape(shape): + need(isinstance(shape, tuple) and 1 <= len(shape) <= MAX_AXES, + "one through sixteen axes") + for axis in shape: + need(isinstance(axis, tuple) and len(axis) == 2, "axis pair") + ell, s = axis + need(type(ell) is int and 2 <= ell <= MAX_ELL, "bounded exponent") + need(type(s) is int and (1 << (ell - 1)) < s < (1 << ell), + "strict source-period guard") + return shape + + +def block_count(shape): + """Evaluate R_i = (t_i-s_i) S_{i+1} + b_i R_{i+1}.""" + shape = checked_shape(shape) + runs, size = 1, 1 + for ell, s in reversed(shape): + t = 1 << ell + touches_right = int(3 * s > 2 * t) + runs = (t - s) * size + touches_right * runs + size *= s + need(1 <= runs <= size, "nonempty run-count range") + return runs + + +def closed_sum(shape): + """Independent implementation of the displayed finite-sum formula.""" + shape = checked_shape(shape) + suffix = math.prod(s for _, s in shape) + prefix, result = 1, 0 + for ell, s in shape: + suffix //= s + result += prefix * ((1 << ell) - s) * suffix + prefix *= int(3 * s > 2 * (1 << ell)) + return result + prefix + + +def direct_addresses(shape): + """Literal rational nearest rounding of every source coordinate.""" + checked_shape(shape) + need(sum(ell for ell, _ in shape) <= CENSUS_BITS, "literal volume cap") + axes = tuple(range(s) for _, s in reversed(shape)) + addresses = [] + for reverse_j in itertools.product(*axes): + address, stride = 0, 1 + for (ell, s), j in zip(shape, reversed(reverse_j)): + address += ((2 * (1 << ell) * j + s) // (2 * s)) * stride + stride <<= ell + addresses.append(address) + need(len(addresses) == math.prod(s for _, s in shape), "source extent") + return tuple(addresses) + + +def target_mask(shape): + """Scan target digits; detect a source point by exact half-open bounds.""" + checked_shape(shape) + bits = sum(ell for ell, _ in shape) + need(bits <= CENSUS_BITS, "literal volume cap") + selected = [] + for address in range(1 << bits): + rest, occupied = address, True + for ell, s in shape: + t = 1 << ell + digit, rest = rest % t, rest // t + # At most one j lies in this interval because s/t < 1. + lower = -(-(s * (2 * digit - 1)) // (2 * t)) + upper = -(-(s * (2 * digit + 1)) // (2 * t)) + occupied = occupied and max(lower, 0) < min(upper, s) + selected.append(occupied) + return tuple(selected) + + +def maximal_blocks(addresses): + need(1 <= len(addresses) <= (1 << CENSUS_BITS), "bounded nonempty image") + blocks, start, previous = [], addresses[0], addresses[0] + for address in addresses[1:]: + need(previous < address, "strict source order") + if address != previous + 1: + blocks.append((start, previous + 1)) + start = address + previous = address + blocks.append((start, previous + 1)) + return tuple(blocks) + + +def all_packets(): + """Every ordered packet with sum(ell) <= 10, including all valid s.""" + queue = [((), 0)] + for index in range(MAX_PACKETS): + if index == len(queue): + break + shape, bits = queue[index] + for ell in range(2, CENSUS_BITS - bits + 1): + for s in range((1 << (ell - 1)) + 1, 1 << ell): + need(len(queue) < MAX_PACKETS, "packet capacity") + queue.append((shape + ((ell, s),), bits + ell)) + need(index == len(queue), "complete bounded worklist") + counts = [0] * (CENSUS_BITS + 1) + counts[0] = 1 + for bits in range(2, CENSUS_BITS + 1): + counts[bits] = sum(((1 << (ell - 1)) - 1) * counts[bits - ell] + for ell in range(2, bits + 1)) + need(sum(counts) == len(queue), "independent packet-coverage recurrence") + return tuple(shape for shape, _ in queue[1:]) + + +def census(): + totals = dict(packets=0, target_records=0, selected_records=0, blocks=0) + for shape in all_packets(): + addresses = direct_addresses(shape) + mask = target_mask(shape) + selected = tuple(i for i, occupied in enumerate(mask) if occupied) + need(addresses == selected, "independent source and target engines") + blocks = maximal_blocks(addresses) + need(len(blocks) == block_count(shape) == closed_sum(shape), + "exact recurrence, finite sum and literal run count") + copied = tuple(i for start, end in blocks for i in range(start, end)) + need(copied == addresses, "complete ordered copy with no holes") + totals["packets"] += 1 + totals["target_records"] += len(mask) + totals["selected_records"] += len(addresses) + totals["blocks"] += len(blocks) + return totals + + +def literal_fixture(): + shape = ((2, 3), (3, 7), (3, 5)) + addresses = direct_addresses(shape) + blocks = maximal_blocks(addresses) + # Every payload is distinct; hole values are arbitrary and nonzero. + source = tuple(("record", 7 * i + 1) for i in range(256)) + frozen = tuple(source) + result = tuple(value for start, end in blocks for value in source[start:end]) + need(source == frozen and result == tuple(source[i] for i in addresses), + "arbitrary-payload preservation and exact readout") + need(len(blocks) == block_count(shape) == 43, "named tensor fixture") + return dict(shape=shape, T=len(source), S=len(result), blocks=len(blocks)) + + +def controls(): + rejected = 0 + bad_shapes = ((), ((1, 1),), ((65, 3),), ((2, True),), ((2, 2),), + ((2, 4),), ((2,),), ((2, 3),) * 17, [(2, 3)]) + for shape in bad_shapes: + try: + block_count(shape) + except ValueError: + rejected += 1 + else: + raise ValueError("invalid shape accepted") + need(block_count(((2, 3),)) == 2, "fixed seam is not a cyclic seam") + need(block_count(((3, 5),)) == 3, "trailing hole blocks a carry join") + need(block_count(((2, 3), (3, 5))) == 8, "mixed carry fixture") + need(block_count(((3, 5), (2, 3))) == 9, "axis order is part of contract") + need(block_count(((2, 3),) * 16) == (3 ** 16 + 1) // 2, + "large tensor evaluation without volume enumeration") + return dict(rejected_inputs=rejected, boundary_controls=5) + + +def authenticated_files(): + manifest_path = HERE / "SOURCES.json" + need(manifest_path.stat().st_size <= MAX_FILE_BYTES, "manifest size cap") + source_manifest = json.loads(manifest_path.read_bytes()) + need(1 <= len(source_manifest["files"]) <= 8, "source-row cap") + root = HERE.parents[1] + bound_inputs = {} + for row in source_manifest["files"]: + if row["usage"] != "input": + continue + path = root / row["path"] + need(path.is_file() and not path.is_symlink(), "regular source text") + need(path.stat().st_size <= MAX_FILE_BYTES, "source size cap") + raw = path.read_bytes() + digest = hashlib.sha256(raw).hexdigest() + need(digest == row["sha256"], "source SHA256") + blob = hashlib.sha1(b"blob " + str(len(raw)).encode() + b"\0" + raw) + need(blob.hexdigest() == row["git_blob"], "source Git blob") + bound_inputs[row["path"]] = digest + package_hashes = {} + for name in ("README.md", "PROOF.md", "SOURCES.json", "TASK.json", + "VERIFY.json", "verify.py"): + path = HERE / name + need(path.is_file() and not path.is_symlink(), "regular package file") + need(path.stat().st_size <= MAX_FILE_BYTES, "package size cap") + package_hashes[name] = hashlib.sha256(path.read_bytes()).hexdigest() + return dict(inputs=bound_inputs, package=package_hashes) + + +def main(): + hashes = authenticated_files() + result = dict(status="PASS_ROUNDED_IMAGE_BLOCK_MINIMUM", census=census(), + fixture=literal_fixture(), controls=controls(), hashes=hashes, + scope="Scoped written proof with exact finite corroboration; no new kappa.") + print(json.dumps(result, sort_keys=True)) + + +if __name__ == "__main__": + main() From 1bf7fff709b9c04fdf58d288de366975bfbdd620 Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Tue, 17 Nov 2026 22:40:18 +0000 Subject: [PATCH 2/2] fix(ci): sync CI verification doc and historical replay-gap verifier --- docs/ci-verification.md | 19 +++++- .../historical-selected-replay-gap/README.md | 6 +- .../SOURCES.json | 60 +++++++++--------- .../VERIFY.json | 31 +-------- .../historical-selected-replay-gap/verify.py | 63 ++++++++++++++----- 5 files changed, 100 insertions(+), 79 deletions(-) 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/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")