From 85b30769641d7a4b3ca27be5d2f35c4ad3ce3c8f Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Tue, 17 Nov 2026 23:27:35 +0000 Subject: [PATCH 1/2] docs(research): classify rectangular Gaussian monomial symmetries --- .../rectangular-gaussian-monomial/PROOF.md | 123 +++++++++++ .../rectangular-gaussian-monomial/README.md | 82 +++++++ .../SOURCES.json | 18 ++ .../rectangular-gaussian-monomial/TASK.json | 101 +++++++++ .../rectangular-gaussian-monomial/VERIFY.json | 19 ++ .../rectangular-gaussian-monomial/verify.py | 207 ++++++++++++++++++ 6 files changed, 550 insertions(+) create mode 100644 research/rectangular-gaussian-monomial/PROOF.md create mode 100644 research/rectangular-gaussian-monomial/README.md create mode 100644 research/rectangular-gaussian-monomial/SOURCES.json create mode 100644 research/rectangular-gaussian-monomial/TASK.json create mode 100644 research/rectangular-gaussian-monomial/VERIFY.json create mode 100644 research/rectangular-gaussian-monomial/verify.py diff --git a/research/rectangular-gaussian-monomial/PROOF.md b/research/rectangular-gaussian-monomial/PROOF.md new file mode 100644 index 0000000000..a7cff8ca6f --- /dev/null +++ b/research/rectangular-gaussian-monomial/PROOF.md @@ -0,0 +1,123 @@ +# Monomial symmetries of a rectangular Gaussian block + +Let $X=\prod_{i=1}^d\{0,\dots,m_i-1\}$ and +$Y=\prod_{i=1}^d\{0,\dots,n_i-1\}$, where $d\ge1$ and each $m_i,n_i\ge2$. +Fix real origins $\alpha_i,\beta_i$, positive spacings $s_i,t_i$ and +positive weights $\gamma_i$. The matrix $G$ has rows indexed by $X$ +and columns by $Y$, with entries +$$ +G_{xy}=a_x b_y\exp\!\left(-\sum_{i=1}^d + \gamma_i(\alpha_i+s_i x_i-\beta_i-t_i y_i)^2\right), +\qquad a_x,b_y\in\mathbb C^\times. +$$ +Write $\lambda_i=\gamma_i s_i t_i$, $W=\operatorname{diag}(\lambda_i)$, +$\bar x_i=x_i-(m_i-1)/2$ and $\bar y_i=y_i-(n_i-1)/2$. +The centered matrix $K_{xy}=\exp(2\bar x^{\mathsf T}W\bar y)$ +satisfies $G=AKB$ for invertible diagonal matrices $A,B$. +Expanding the quadratic gives the centered mixed term +$2\bar x^{\mathsf T}W\bar y$ plus one term in $x$ and one in $y$. +These separate terms, with $a_x$ and $b_y$, give $A$ and $B$. +Alternatively one can obtain them from +$A_{xx}=G_{x0}/K_{x0}$ and $B_{yy}=G_{0y}/(A_{00}K_{0y})$. + +## Classification + +An invertible monomial matrix has one nonzero coefficient in each row and +column. Let $P e_x=e_{p(x)}$ and $Qe_y=e_{q(y)}$ be the permutation +parts of monomial maps $U$ and $V$ on the row and column spaces. +Then $UG=GV$ holds exactly for +$$ +U=c A P A^{-1},\qquad V=c B^{-1}Q B,\qquad c\in\mathbb C^\times, +$$ +where $p,q$ act by the same signed coordinate permutation on the two +index grids. In detail, there is a permutation $\sigma$ of the axes with +$$ +(m_{\sigma(i)},n_{\sigma(i)},\lambda_{\sigma(i)}) + =(m_i,n_i,\lambda_i) +$$ +and a sign $\epsilon_i\in\{1,-1\}$ for each axis. The maps are +$$ +p(x)_{\sigma(i)}=\epsilon_i x_i+\tfrac{1-\epsilon_i}{2}(m_i-1), +\qquad +q(y)_{\sigma(i)}=\epsilon_i y_i+\tfrac{1-\epsilon_i}{2}(n_i-1). +$$ +In particular, the number of possible permutation pairs is +$2^d\prod_C |C|!$, with $C$ ranging over the classes of equal +$(m_i,n_i,\lambda_i)$. + +### Necessity of the coordinate maps + +Write $Ue_x=u_xe_{p(x)}$ and $Ve_y=v_ye_{q(y)}$. At row $p(x)$ +and column $y$, the equation $UG=GV$ says +$u_xG_{xy}=G_{p(x),q(y)}v_y$. The change of entries under $p,q$ is +therefore a product of a row factor and a column factor. Such factors +cancel from the four-entry ratio +$$ +\frac{G_{xy}G_{x' y'}}{G_{xy'}G_{x' y}} + =\exp\!\left(2 (x-x')^{\mathsf T}W(y-y')\right). +$$ +The ratio is positive real even with complex gauges. Its invariance and +the injectivity of the real exponential, with $x'=y'=0$, give +$$ +(p(x)-p(0))^{\mathsf T}W(q(y)-q(0))=x^{\mathsf T}Wy. \tag{1} +$$ + +Let $S$ have columns $p(e_i)-p(0)$, and $T$ have columns +$q(e_i)-q(0)$. Both index grids contain all unit vectors, so applying +(1) to those vectors gives $S^{\mathsf T}WT=W$. Since $W$ is +invertible, both $S$ and $T$ are invertible. Taking $y=e_j$ for every +$j$ in (1) then gives +$(p(x)-p(0)-Sx)^{\mathsf T}WT=0$, so $p(x)=p(0)+Sx$. +Taking $x=e_i$ for every $i$ gives $q(y)=q(0)+Ty$. + +The affine map $p(0)+Sx$ carries the convex hull of $X$ onto itself. +At the zero corner the $d$ incident edges have the coordinate +directions. Their images are the $d$ incident edges at $p(0)$, in +some permutation of those directions. The edge in direction $i$ has +$m_i$ points of $X$, so its image has the same number of points. +Hence its image direction $\sigma(i)$ satisfies $m_{\sigma(i)}=m_i$. +The endpoints now force $Se_i=\epsilon_i e_{\sigma(i)}$, with no +change of scale between integer indices. The same argument on the column +box gives $Te_i=\eta_i e_{\tau(i)}$ and $n_{\tau(i)}=n_i$. + +The $i$-th diagonal entry of $S^{\mathsf T}WT$ is zero unless +$\sigma(i)=\tau(i)$. In that case it is +$\epsilon_i\eta_i\lambda_{\sigma(i)}$. Its required value +$\lambda_i>0$ forces a common permutation, common signs and equal +effective weights on exchanged axes. The corner translations must put +each positive direction at coordinate zero and each negative direction +at the opposite end of the corresponding box. + +### Attainment and uniqueness of the weights + +The coordinate maps above send $\bar x,\bar y$ through the same signed +matrix $S$ with $S^{\mathsf T}WS=W$. Thus $K_{p(x),q(y)}=K_{xy}$. +Using $G=AKB$, entrywise equality for $UG=GV$ simplifies to +$$ +u_x\frac{A_{xx}}{A_{p(x),p(x)}}= +v_y\frac{B_{q(y),q(y)}}{B_{yy}} +\quad\text{for every }x,y. +$$ +Since every entry of $K$ is nonzero, this holds exactly when both sides +are one common nonzero scalar $c$. This gives the two stated monomial +lifts and proves their uniqueness up to that scalar. Each allowed +coordinate permutation and sign choice yields a distinct pair because +the values at the zero corner and all unit vectors determine those choices. + +## Consequence and scope + +If all triples $(m_i,n_i,\lambda_i)$ are distinct, the only permutation +parts are paired coordinate reflections. Every vertex cycle on either +grid has length at most two. Absolute matrix order can still depend on +the common scalar. The rectangle itself can admit axis exchanges when +some triples coincide. In the exact $8\times12$ verifier fixture, the +first two axes have different Gaussian weights and row spacings but +equal products $\gamma_i s_i t_i$. They can exchange, for 16 pairs +including all sign choices. + +This theorem applies to full Cartesian grids with positive paired +weights and exact unrounded entries. The ratio proof addresses rectangular +row and column relabeling without requiring a common vertex set. +Periodization, support holes and nonseparable phase or rounding error can +alter the ratio. Charging the monomial maps and installing them in a +physical caller require separate arguments. diff --git a/research/rectangular-gaussian-monomial/README.md b/research/rectangular-gaussian-monomial/README.md new file mode 100644 index 0000000000..18f699dea1 --- /dev/null +++ b/research/rectangular-gaussian-monomial/README.md @@ -0,0 +1,82 @@ +# Exact two-sided monomial symmetries of rectangular Gaussian blocks + +For a diagonal-weight Gaussian matrix between two Cartesian index grids, +each pair of monomial maps satisfying $UG=GV$ uses the same signed +coordinate permutation on the row and column grids. An axis can exchange +with another exactly when both grid lengths and the effective weight +$\gamma_i s_i t_i$ agree. Here $\gamma_i$ is the Gaussian weight and +$s_i,t_i$ are the row and column spacings. Every allowed pair lifts to +monomial maps, and the weights of the lift are unique up to one common +scalar. The number of permutation pairs is $2^d\prod_C |C|!$, where +each $C$ is a class of identical triples. + +[PROOF.md](PROOF.md) gives a scoped written proof with finite exact +corroboration. A four-entry ratio cancels arbitrary invertible complex +diagonal gauges, and its mixed term determines both affine maps. +Consequently a rectangular Gaussian symmetry proposal must preserve the +axis triples. If all triples are distinct, both permutation parts have +only one- and two-vertex cycles. + +Jerry Chen's [PR #7597](https://github.com/CrocSwap/integer-mult-bounds/pull/7597) +classifies the monomial centralizer of matching square Gaussian blocks. +Its [proof at the exact submitted head](https://github.com/CubeJerry/integer-mult-bounds/blob/85c29864062620f16e428c12f291f63632dd5a66/research/gauged-physical-gaussian-symmetries/PROOF.md) +asks about rectangular or independently indexed blocks. The new result +uses a mixed row/column invariant and derives the paired action even +when the grids have different sizes, origins and spacings. The proof and +verifier are self-contained. + +## Evidence and reproduction + +The verifier tries all 18,444 permutation pairs across four small rational +fixtures. It solves for monomial weights from one row and one column and +checks the complete endpoint for each candidate. It also verifies the +centered factorization and the explicit monomial lifts in five fixtures. +These yield 34 predicted pairs and 1,836 lifted endpoint entry checks. +The largest fixture is an $8\times12$ rectangle with a legal axis +exchange. Four controls check a row-only reflection, missing gauges, a +single changed monomial coefficient and the zero-weight degeneration. + +From the repository root with CPython 3.12 and its standard library: + +~~~sh +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -W error -B research/rectangular-gaussian-monomial/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -O -W error -B research/rectangular-gaussian-monomial/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/research_package.py --package research/rectangular-gaussian-monomial +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/check_research_commit.py --package research/rectangular-gaussian-monomial --check-source-history +~~~ + +Any CPython 3.12 executable can replace the absolute path. Expected pass +markers are PASS_RECTANGULAR_GAUSSIAN_MONOMIAL, +PASS_REGISTERED_RESEARCH_PACKAGE and PASS_RESEARCH_COMMIT_BYTES. +The verifier only reads its fixed in-source fixtures and prints results. + +## Scope + +The proof covers unrounded Gaussian blocks with nondegenerate Cartesian +row and column grids. Physical source matching, perturbation and rounding, +native implementation, and the cost of applying the two gauges are open. +The repository's five framework assumptions remain in force. This is a +local result for Gaussian coefficient structure. It supplies no new kappa +or complete multiplication theorem. Independent human and formal +proof-kernel review are unclaimed. + +## Open next questions + +- Which actual rectangular blocks in the fine-prime source admit this + factorization? Start with one pair of unrounded same-cell row and column + intervals and derive its four-entry ratios. Periodic aliases and + nonseparable phases must be accounted for before using the classification. +- When a source block matches, do the two permutation orbits reduce the + complete generator bill? Start by pricing one row and column layout and + the two diagonal adapters. Precision, routing and access costs are open. + +## Credit + +This contribution was produced by Nick Petalas. Credit Jerry Chen for the +question, the square Gaussian invariant and the symmetry-orbit work in +[#7591](https://github.com/CrocSwap/integer-mult-bounds/pull/7591), +[#7594](https://github.com/CrocSwap/integer-mult-bounds/pull/7594) and +[#7597](https://github.com/CrocSwap/integer-mult-bounds/pull/7597). Credit +Sebastian Egner and Markus Püschel for the established paired monomial +symmetry framework. [Automatic Generation of Fast Discrete Signal Transforms](https://people.inf.ethz.ch/markusp/papers/autgen.pdf). +Apache-2.0. diff --git a/research/rectangular-gaussian-monomial/SOURCES.json b/research/rectangular-gaussian-monomial/SOURCES.json new file mode 100644 index 0000000000..5335fa97d9 --- /dev/null +++ b/research/rectangular-gaussian-monomial/SOURCES.json @@ -0,0 +1,18 @@ +{ + "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" + } + ] +} diff --git a/research/rectangular-gaussian-monomial/TASK.json b/research/rectangular-gaussian-monomial/TASK.json new file mode 100644 index 0000000000..ff2517de34 --- /dev/null +++ b/research/rectangular-gaussian-monomial/TASK.json @@ -0,0 +1,101 @@ +{ + "schema_version": 1, + "task_id": "formal-interface-lemma", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "formal-interface-lemma", + "question": "Can one uncovered interface implication be formalized with exact caller and certificate bindings?", + "starting_points": [ + "docs/research/research-family-status.md", + "certificates/selected-result.json", + "research/gate-operand-parity-lean/README.md", + "research/staged544-certified-endpoint/README.md", + "research/unconditional-batched-crt/README.md" + ], + "methods": [ + "Formalize a missing boundary lemma identified by the selected review.", + "Audit a formal theorem-to-certificate binding independently." + ], + "acceptance_gate": "State the exact formalized proposition and remaining assumptions; avoid duplicate arithmetic formalizations already present.", + "first_step": { + "command": [ + "python3", + "-B", + "scripts/research_selected_baseline.py" + ], + "expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY", + "inspect": "Resolve the current selected review, separate complex/ordinary BIT/admitted BIT/outer budgets, and compare the card against live handoffs before starting. Historical ceilings require exact source/model equivalence.", + "scope": "Source-binding orientation only; not a scientific replay or all-size proof. Materialize selected inputs if this checkout is sparse." + }, + "first_experiment": "Write one missing statement with quantified hypotheses, actual caller and existing coverage. A compact-switch lemma is a candidate only after its mathematical contract is reviewed. Establish a bounded proof plan before a separately budgeted proof-assistant build; do not rerun large Lean jobs as orientation.", + "bottleneck_link": "A missing interface proof can reduce the conditional gap even if it does not change kappa.", + "allowed_variations": [ + "Narrow to one formal lemma or one theorem-to-certificate binding." + ], + "scope_change_triggers": [ + "Formalizing already-covered arithmetic and claiming the full multiplication theorem." + ], + "overlap_terms": [ + "hyperplane end", + "formal interface", + "Lean binding", + "3807", + "3857", + "4100", + "gate-operand-parity-lean", + "staged544-certified-endpoint", + "unconditional-batched-crt" + ], + "existing_checks": [ + { + "scope": "PR #3807: scoped gate-operand parity formalization.", + "evidence": "research/gate-operand-parity-lean/README.md", + "remaining": "Exact theorem-to-caller binding and genuinely uncovered interface lemmas.", + "status": "author-checked", + "source_commit": "4c3530f42a6abcc48e7a6bcffd6c901911dc8269", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #3857: certified real-power moment/endpoint arithmetic.", + "evidence": "research/staged544-certified-endpoint/README.md", + "remaining": "Uniform algorithmic implications, not another endpoint digit.", + "status": "author-checked", + "source_commit": "ef4315b8caa605e47a2515004845eb2d2ed71a86", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #4100: compact-switch formalization proposed as future validation.", + "evidence": "research/unconditional-batched-crt/README.md", + "remaining": "Audit the statement and assumptions before a formal proof campaign.", + "status": "author-checked", + "source_commit": "337d04939571a637aeab54a0f58f54fde811663a", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + } + ] + }, + "scope_status": "changed", + "actual_scope": "Classify exact paired monomial maps for an unrounded Gaussian block between two full Cartesian grids, allowing independent side lengths, spacings, origins and complex diagonal gauges.", + "scope_change_reason": "PR #7597 leaves the rectangular or independently indexed case open. The package proves this algebraic extension without claiming a bound to a selected physical caller.", + "bottleneck_link": "The classification constrains which paired row and column orbit layouts a rectangular Gaussian generator can use. Physical costs and supplier admission require separate evidence.", + "budget_minutes": 60, + "stop_rule": "Deliver the first verified classification with exact small endpoint checks and leave physical matching and perturbation as follow-up questions.", + "outcome": "completed", + "evidence": "Scoped written proof, 18444 exhaustive permutation-pair candidates across four fixtures, 34 exact monomial lifts across five fixtures, and four controls. Standard-library CPython 3.12.15, macOS arm64.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "Which actual rectangular blocks in the fine-prime source have this exact factorization?", + "why_it_matters": "Source binding would determine which candidate cycle layouts the theorem controls.", + "first_step": "Take two same-cell row and column intervals and derive their four-entry ratios from the unrounded source.", + "blocked_by": "Periodic aliases, nonseparable phases and rounding require separate coverage." + }, + { + "question": "Can paired symmetry orbits reduce the complete generator bill of a matching source block?", + "why_it_matters": "An exact symmetry alone supplies no reduction in recursive cost.", + "first_step": "Specify one row and column orbit layout and charge both monomial adapters.", + "blocked_by": "Source matching, precision, routing and access costs are open." + } + ] +} diff --git a/research/rectangular-gaussian-monomial/VERIFY.json b/research/rectangular-gaussian-monomial/VERIFY.json new file mode 100644 index 0000000000..968a1630cf --- /dev/null +++ b/research/rectangular-gaussian-monomial/VERIFY.json @@ -0,0 +1,19 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [], + "commands": [ + { + "argv": ["{python}", "-I", "-W", "error", "-B", "{package}/verify.py"], + "timeout_seconds": 60, + "checks": "Exhaustive small endpoint search, centered factorization, explicit lifts and scope controls." + }, + { + "argv": ["{python}", "-I", "-O", "-W", "error", "-B", "{package}/verify.py"], + "timeout_seconds": 60, + "checks": "The same exact checks with Python optimization enabled." + } + ] +} diff --git a/research/rectangular-gaussian-monomial/verify.py b/research/rectangular-gaussian-monomial/verify.py new file mode 100644 index 0000000000..9620341b9e --- /dev/null +++ b/research/rectangular-gaussian-monomial/verify.py @@ -0,0 +1,207 @@ +#!/usr/bin/env python3 +"""Check the rectangular Gaussian classification on small exact rational blocks.""" + +from fractions import Fraction +from itertools import permutations, product +from math import prod +from typing import NamedTuple + +Point = tuple[int, ...] +Order = tuple[int, ...] +Weights = tuple[Fraction, ...] +Table = tuple[Weights, ...] + + +class Axis(NamedTuple): + base: int + row_step: int + column_step: int + row_origin: int + column_origin: int + + +class Fixture(NamedTuple): + name: str + row_shape: Point + column_shape: Point + axes: tuple[Axis, ...] + expected_pairs: int + exhaustive: bool = True + + +def require(condition: bool, message: str) -> None: + if not condition: + raise ValueError(message) + + +def gaussian(fixture: Fixture, rows: tuple[Point, ...], columns: tuple[Point, ...]) -> Table: + def entry(x: Point, y: Point) -> Fraction: + value = Fraction(1) + for a, b, axis in zip(x, y, fixture.axes, strict=True): + row_coordinate = axis.row_origin + axis.row_step * a + column_coordinate = axis.column_origin + axis.column_step * b + value *= Fraction(1, axis.base**2) ** (row_coordinate - column_coordinate)**2 + return value + + return tuple( + tuple(Fraction((-1)**(i + j) * (i + 2), j + 3) * entry(x, y) + for j, y in enumerate(columns)) + for i, x in enumerate(rows) + ) + + +def centered_core( + fixture: Fixture, rows: tuple[Point, ...], columns: tuple[Point, ...], +) -> Table: + return tuple( + tuple(prod( + Fraction(axis.base) ** ( + axis.row_step * axis.column_step * + (2 * a - m + 1) * (2 * b - n + 1) + ) + for a, b, m, n, axis in zip( + x, y, fixture.row_shape, fixture.column_shape, fixture.axes, strict=True, + ) + ) for y in columns) + for x in rows + ) + + +def coordinate_order( + points: tuple[Point, ...], shape: Point, directions: Order, signs: Point, +) -> Order: + indices = {point: index for index, point in enumerate(points)} + result = [] + for point in points: + image = [0] * len(shape) + for source, target in enumerate(directions): + value = point[source] + image[target] = value if signs[source] == 1 else shape[target] - 1 - value + result.append(indices[tuple(image)]) + return tuple(result) + + +def predicted_pairs( + fixture: Fixture, rows: tuple[Point, ...], columns: tuple[Point, ...], +) -> set[tuple[Order, Order]]: + weights = tuple(axis.base ** (axis.row_step * axis.column_step) for axis in fixture.axes) + signatures = tuple(zip(fixture.row_shape, fixture.column_shape, weights, strict=True)) + dimension = len(signatures) + return { + (coordinate_order(rows, fixture.row_shape, directions, signs), + coordinate_order(columns, fixture.column_shape, directions, signs)) + for directions in permutations(range(dimension)) + if all(signatures[i] == signatures[j] for i, j in enumerate(directions)) + for signs in product((-1, 1), repeat=dimension) + } + + +def endpoint_holds( + table: Table, p: Order, q: Order, u: Weights, v: Weights, +) -> bool: + return all( + u[i] * row[j] == table[p[i]][q[j]] * v[j] + for i, row in enumerate(table) + for j in range(len(q)) + ) + + +def pivot_weights(table: Table, p: Order, q: Order) -> tuple[Weights, Weights]: + # Solve UG=GV at column zero and at row p(0), normalizing v[0] to one. + u = tuple(table[k][q[0]] / table[i][0] for i, k in enumerate(p)) + v = tuple(u[0] * table[0][j] / table[p[0]][k] for j, k in enumerate(q)) + return u, v + + +def exhaustive_pairs(table: Table) -> tuple[set[tuple[Order, Order]], int]: + require(len(table) <= 4 and len(table[0]) <= 6, "exhaustive fixture exceeds 4 by 6") + matches = set() + checked = 0 + for p, q in product(permutations(range(len(table))), permutations(range(len(table[0])))): + checked += 1 + if endpoint_holds(table, p, q, *pivot_weights(table, p, q)): + matches.add((p, q)) + return matches, checked + + +def check_fixture(fixture: Fixture) -> tuple[int, int, int]: + rows = tuple(product(*(range(m) for m in fixture.row_shape))) + columns = tuple(product(*(range(n) for n in fixture.column_shape))) + table = gaussian(fixture, rows, columns) + core = centered_core(fixture, rows, columns) + row_gauge = tuple(row[0] / central[0] for row, central in zip(table, core, strict=True)) + col_gauge = tuple(value / (row_gauge[0] * middle) + for value, middle in zip(table[0], core[0], strict=True)) + require(all( + table[i][j] == row_gauge[i] * core[i][j] * col_gauge[j] + for i in range(len(rows)) for j in range(len(columns)) + ), f"{fixture.name}: centered factorization") + + pairs = predicted_pairs(fixture, rows, columns) + require(len(pairs) == fixture.expected_pairs, f"{fixture.name}: number of predicted pairs") + checked = 0 + if fixture.exhaustive: + found, checked = exhaustive_pairs(table) + require(found == pairs, f"{fixture.name}: exhaustive endpoint search disagrees") + + scalar = Fraction(-7, 3) + for p, q in pairs: + u = tuple(scalar * row_gauge[k] / row_gauge[i] for i, k in enumerate(p)) + v = tuple(scalar * col_gauge[j] / col_gauge[k] for j, k in enumerate(q)) + require(endpoint_holds(table, p, q, u, v), f"{fixture.name}: gauge lift") + pivot_u, pivot_v = pivot_weights(table, p, q) + require( + u == tuple(v[0] * value for value in pivot_u) + and v == tuple(v[0] * value for value in pivot_v), + f"{fixture.name}: scalar-normalized lift", + ) + print(f"{fixture.name}: pairs={len(pairs)} exhaustive_candidates={checked}") + return len(pairs), checked, len(pairs) * len(rows) * len(columns) + + +def check_controls() -> None: + fixture = Fixture("controls", (2,), (3,), (Axis(2, 2, 1, -1, 2),), 2) + table = gaussian(fixture, ((0,), (1,)), ((0,), (1,), (2,))) + p, q = (1, 0), (2, 1, 0) + identity_columns = (0, 1, 2) + require( + not endpoint_holds(table, p, identity_columns, *pivot_weights(table, p, identity_columns)), + "a row-only reflection must fail", + ) + require( + not endpoint_holds(table, p, q, (Fraction(1),) * 2, (Fraction(1),) * 3), + "the ungauged permutation lifts must fail", + ) + u, v = pivot_weights(table, p, q) + require( + not endpoint_holds(table, p, q, (2 * u[0], u[1]), v), + "a change to just one monomial weight must fail", + ) + + constant = ((Fraction(1),) * 3,) * 2 + require( + endpoint_holds(constant, p, identity_columns, *pivot_weights(constant, p, identity_columns)), + "a zero effective weight permits independent reflections", + ) + + +def main() -> None: + axis = Axis(2, 1, 1, 0, 0) + fixtures = ( + Fixture("one_axis", (2,), (3,), (Axis(2, 2, 1, -1, 2),), 2), + Fixture("unequal_column_lengths", (2, 2), (2, 3), (axis, axis), 4), + Fixture("distinct_effective_weights", (2, 2), (2, 2), (axis, Axis(3, 1, 1, 1, 0)), 4), + Fixture("equal_effective_weights", (2, 2), (2, 2), + (Axis(2, 2, 1, 0, 1), Axis(4, 1, 1, 2, -1)), 8), + Fixture("rectangular_with_axis_exchange", (2, 2, 2), (2, 2, 3), + (Axis(2, 2, 1, 0, 1), Axis(4, 1, 1, 2, -1), Axis(3, 1, 1, 0, 0)), 16, False), + ) + counts = tuple(check_fixture(fixture) for fixture in fixtures) + pairs, candidates, entries = (sum(values) for values in zip(*counts, strict=True)) + check_controls() + print(f"pairs={pairs} exhaustive_candidates={candidates} lifted_entries={entries} controls=4") + print("PASS_RECTANGULAR_GAUSSIAN_MONOMIAL") + + +if __name__ == "__main__": + main() From 82f6d6ac7cb248a4996452ca23cc0695ae5682e2 Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Tue, 17 Nov 2026 23:30:40 +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")