From b394fe7c569e41df65f1b0bd3eb3a7533ceea4fc Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Wed, 18 Nov 2026 21:15:36 +0000 Subject: [PATCH 1/2] feat(research): prove an integral quaternion channel gap --- research/lipschitz-channel-gap/README.md | 117 +++++++++++++++++++ research/lipschitz-channel-gap/SOURCES.json | 25 ++++ research/lipschitz-channel-gap/TASK.json | 90 +++++++++++++++ research/lipschitz-channel-gap/VERIFY.json | 34 ++++++ research/lipschitz-channel-gap/verify.py | 122 ++++++++++++++++++++ 5 files changed, 388 insertions(+) create mode 100644 research/lipschitz-channel-gap/README.md create mode 100644 research/lipschitz-channel-gap/SOURCES.json create mode 100644 research/lipschitz-channel-gap/TASK.json create mode 100644 research/lipschitz-channel-gap/VERIFY.json create mode 100644 research/lipschitz-channel-gap/verify.py diff --git a/research/lipschitz-channel-gap/README.md b/research/lipschitz-channel-gap/README.md new file mode 100644 index 0000000000..7c11da3381 --- /dev/null +++ b/research/lipschitz-channel-gap/README.md @@ -0,0 +1,117 @@ +# An integral quaternion channel gap + +A $2\times 2$ response matrix needs **two factorization channels over the +Lipschitz order** and **one over the dyadic quaternion order**. Its rank over +the rational quaternion division ring is one. This scoped proof answers +the integral-versus-dyadic part of RQ10 for one coefficient dictionary. +[Dugongue's RQ10, PR #5803](https://github.com/CrocSwap/integer-mult-bounds/pull/5803) + +## Exact channel counts + +Let $H=\mathbb Q+\mathbb Q i+\mathbb Q j+\mathbb Q k$, with $i^2=j^2=-1$ +and $ij=-ji=k$. Write $L$ for the order with four integer coordinates and +$L[1/2]$ for its dyadic extension. The inner rank of $B$ over a ring $R$ +is the least $q$ for which $B=P T$ with $P$ having $q$ columns and $T$ +having $q$ rows over $R$. The order of multiplication matters. + +Set $h=(1+i+j+k)/2$. Direct expansion gives + +$$ +B=\begin{pmatrix} +1+i & i+k \\ +1+j & i+j +\end{pmatrix} +=\begin{pmatrix}1+i\\1+j\end{pmatrix}\begin{pmatrix}1 & h\end{pmatrix}. +$$ + +Since $B$ is nonzero, the outer product gives both dyadic inner rank one +and $\operatorname{rank}_H B=1$. The integral factorization $B=B I_2$ +uses two channels. + +To rule out one integral channel, assume $B=(p_0,p_1)^{\mathsf T}(d,e)$ +over $L$. The first column forces $p_0$ and $d$ to be nonzero. The second +column gives $p_0(e-dh)=0$, so $e=dh$ by cancellation in $H$. +If $s=1+i+j+k$, then $is=js=ks=s$ modulo $2L$. Thus all four coordinates +of $2dh=ds$ have the parity of the coordinate sum of $d$. Since $dh$ is +integral, that sum is even. The squared norm $N(d)$, the sum of the four +coordinate squares, has the same parity and is even as well. + +The norm is positive on nonzero quaternions and multiplicative because +$u\bar u$ is central. Both $p_0d=1+i$ and $p_1d=1+j$ have norm two. +Hence $N(d)=2$ and $N(p_0)=N(p_1)=1$. Conjugation gives an integral inverse +for $p_0$. This would put +$p_1p_0^{-1}=(1+j)(1+i)^{-1}=(1-i+j+k)/2$ in $L$, which is impossible. +The integral inner rank is exactly two. A nonzero matrix with one row +or one column always factors through one channel, so two rows and two +columns are the smallest dimensions for this gap. + +## Ordinary coefficient operations + +Use four rational lanes in the basis $1,i,j,k$. Left multiplication by $i$ +maps $(a,b,c,d)$ to $(-b,a,-d,c)$, and left multiplication by $j$ maps it +to $(-c,d,a,-b)$. Applying $j$ and then $i$ gives left multiplication by +$k=ij$. The input to the one-channel response is + +$$ +z=x_0+\tfrac12(x_1+ix_1+jx_1+kx_1). +$$ + +For a query $Q$ that commutes with these ordinary coefficients, write +$w=Qz$. The two contributions are $w+iw$ and $w+jw$. The coefficient +dictionary uses signed permutations, additions, and one exact halving of +a four-lane field. For a faithful formal example, act identically on two +copies of the four lanes and let $Q$ exchange the copies. The ordinary +operators preserve the copies and their products with $Q$ exchange them, +so the odd response is determined separately. + +The integral obstruction applies under the atlas's R03 hypotheses with +ordinary coefficients in $L$. Its odd-row argument forces +the coefficient matrix to factor through as many rows as the word uses +queries, including with feedback. The dyadic operations above specify the +response and channel factors. A physical query, exact halving on its +reached inputs, restoration, tape movement, and a complete caller invoice +remain open. The result establishes no multiplication exponent saving. + +## Reproduction + +Run from the repository root using CPython 3.12 and the standard library. +The local checks used CPython 3.12.15 on macOS arm64. + +```sh +python3.12 -I -W error -B research/lipschitz-channel-gap/verify.py +python3.12 -I -O -W error -B research/lipschitz-channel-gap/verify.py +python3.12 -B scripts/research_package.py --package research/lipschitz-channel-gap +python3.12 -B scripts/check_research_commit.py --package research/lipschitz-channel-gap --check-source-history +``` + +The checker compares the signed-permutation formula with the literal +matrix on all eight rational basis inputs. It checks the 16 parity classes +and exhausts all 24 integral norm-two right divisors. Eight divide each +first-column entry individually, and zero divide both. The checker also +confirms the two-channel identity and detects the response change when +$ij$ is reversed. The written proof establishes the channel bounds. The +finite checks corroborate its witness and obstruction. + +## Open next questions + +- Determine when dyadic localization preserves rational quaternion rank + for a general rectangular response. Start with column reduction over the + Hurwitz order and track each denominator in the coefficient dictionary. +- Find a live boundary with the signed permutations and a commuting query. + Start by naming the caller's input grid and pricing the four-lane half, + source preservation and final scratch restoration together. + +## Credit + +This scoped proof and checker were produced by Nick Petalas. Dugongue's atlas +supplies the question, the odd-row lower bound and the split dyadic comparison. +The source is pinned at PR #5803 head `0acda5ab421d28b98fdf916968696c8f9453376f`. +[Atlas and predecessor credits](https://github.com/CrocSwap/integer-mult-bounds/blob/0acda5ab421d28b98fdf916968696c8f9453376f/research/frontier-mathematical-atlas/volume-algebra.md) + +The Lipschitz and Hurwitz orders and their norm arithmetic are classical. +Machiavelo and Roçadas give the same nonassociate norm-two pair in the +remarks after Theorem 3.2. The contribution here is the response matrix, +its channel obstruction and its dyadic coefficient construction. +[Some connections between the arithmetic and the geometry of Lipschitz integers](https://www.cmup.pt/sites/default/files/2024-09/1201.5817v2.pdf) + +Independent human and formal proof-kernel review are unclaimed. Apache-2.0. diff --git a/research/lipschitz-channel-gap/SOURCES.json b/research/lipschitz-channel-gap/SOURCES.json new file mode 100644 index 0000000000..07d3771ad1 --- /dev/null +++ b/research/lipschitz-channel-gap/SOURCES.json @@ -0,0 +1,25 @@ +{ + "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/frontier-mathematical-atlas/volume-algebra.md", + "usage": "provenance", + "git_blob": "d59eb69c8ae48d38372143b941041f855138eb64", + "sha256": "54dfbecebf2986ad677295976ff951e6b600ef586cbb6a0f56b5653d85f9d243", + "pin": "head:0acda5ab421d28b98fdf916968696c8f9453376f:research/frontier-mathematical-atlas/volume-algebra.md" + } + ] +} diff --git a/research/lipschitz-channel-gap/TASK.json b/research/lipschitz-channel-gap/TASK.json new file mode 100644 index 0000000000..25ce8c05ed --- /dev/null +++ b/research/lipschitz-channel-gap/TASK.json @@ -0,0 +1,90 @@ +{ + "schema_version": 1, + "task_id": "joint-query-controller", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "joint-query-controller", + "question": "Can a changed query demand or caller remove real work while satisfying native chronology and restoration?", + "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": "Choose an exact caller and a new demand/interface hypothesis. Read the scoped #5617/#5631/#5649/#5747 and #5720/#5745 objections before rebuilding an excluded schedule. Compare the complete matched source/consumer protocols including all retained helper outputs. For an active-mode injection, first check #5745: its canonical delivery claim repays the eight removed centre jobs. Audit that exact claim or change its channel/feedback hypothesis; do not repeat the same free-injection search. Stop if the full favorable budget fails or the required restored output is unobservable.", + "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": [ + "query demand", + "active mode", + "5720", + "5745", + "5747", + "caller" + ], + "existing_checks": [ + { + "scope": "PR #4166: author-checked installed producer/service/return/bridge connection; native-component comparison loses.", + "evidence": "research/qq16-caller-install/README.md", + "remaining": "Complete matched physical protocol bill, or changed source-compatible demand/circuit; no affordable supplier yet.", + "status": "author-checked", + "source_commit": "0b082d22a0e9a442d264ab0633e35ef26c790630", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "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 channel counts for one integral quaternion response with an optional dyadic half.", + "scope_change_reason": "RQ10 in Dugongue PR #5803 asks for integral and dyadic restrictions in a nonsplit coefficient algebra. This proof precedes binding any existing caller.", + "bottleneck_link": "The ordinary coefficient alphabet can change the minimum number of channels even when the division-ring rank is fixed. The result gives a scoped obstruction to pricing query compression by division-ring rank alone.", + "budget_minutes": 60, + "stop_rule": "Deliver the first exact channel gap with a matching construction and finite exact checks.", + "outcome": "completed", + "evidence": "Written norm obstruction, attaining integral and dyadic factorizations, eight rational basis inputs, sixteen parity classes, and all twenty-four norm-two common right-divisor candidates.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "When does dyadic localization preserve rational quaternion rank for every rectangular response?", + "why_it_matters": "A general theorem would give a usable dyadic channel count without relying on an integral proxy.", + "first_step": "Try column reduction in the Hurwitz order and track the denominators of its factors.", + "blocked_by": "The current proof resolves one response only." + }, + { + "question": "Does a live caller offer both signed-permutation coefficients and a commuting query?", + "why_it_matters": "That would make it possible to price the channel saving at a reached boundary.", + "first_step": "Identify the precise input grid and price exact halving, preservation and final restoration.", + "blocked_by": "There is no named caller binding or physical work bill here." + } + ] +} diff --git a/research/lipschitz-channel-gap/VERIFY.json b/research/lipschitz-channel-gap/VERIFY.json new file mode 100644 index 0000000000..413416f0e3 --- /dev/null +++ b/research/lipschitz-channel-gap/VERIFY.json @@ -0,0 +1,34 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [], + "commands": [ + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Exact lane identities, parity classes, norm-two divisor exclusion and order controls." + }, + { + "argv": [ + "{python}", + "-I", + "-O", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Exact lane identities, parity classes, norm-two divisor exclusion and order controls." + } + ] +} diff --git a/research/lipschitz-channel-gap/verify.py b/research/lipschitz-channel-gap/verify.py new file mode 100644 index 0000000000..ff2002170a --- /dev/null +++ b/research/lipschitz-channel-gap/verify.py @@ -0,0 +1,122 @@ +#!/usr/bin/env python3 +"""Check the Lipschitz-order gap with exact four-lane arithmetic.""" + +from fractions import Fraction +from itertools import product + + +ZERO = (0, 0, 0, 0) +HALF_SUM = (Fraction(1, 2),) * 4 +RESPONSE = ( + ((1, 1, 0, 0), (0, 1, 0, 1)), + ((1, 0, 1, 0), (0, 1, 1, 0)), +) + + +def require(condition, message): + if not condition: + raise ValueError(message) + + +def add(*vectors): + return tuple(sum(lane) for lane in zip(*vectors, strict=True)) + + +def multiply(left, right): + a, b, c, d = left + matrix = ( + (a, -b, -c, -d), + (b, a, -d, c), + (c, d, a, -b), + (d, -c, b, a), + ) + return tuple( + sum(coefficient * lane for coefficient, lane in zip(row, right, strict=True)) + for row in matrix + ) + + +def left_i(x): + a, b, c, d = x + return -b, a, -d, c + + +def left_j(x): + a, b, c, d = x + return -c, d, a, -b + + +def one_channel(x, y, k_sign): + iy = left_i(y) + jy = left_j(y) + ky = left_i(jy) + total = add(y, iy, jy, tuple(k_sign * lane for lane in ky)) + z = add(x, tuple(Fraction(lane, 2) for lane in total)) + return add(z, left_i(z)), add(z, left_j(z)) + + +def two_channels(x, y): + iy = left_i(y) + jy = left_j(y) + return add(x, left_i(x), iy, left_i(jy)), add(x, left_j(x), iy, jy) + + +def check_responses(): + basis = tuple(tuple(int(i == j) for j in range(4)) for i in range(4)) + inputs = tuple((x, ZERO) for x in basis) + tuple((ZERO, y) for y in basis) + reversed_failures = 0 + for x, y in inputs: + expected = tuple( + add(multiply(a, x), multiply(b, y)) for a, b in RESPONSE + ) + require(one_channel(x, y, 1) == expected, "wrong dyadic response") + require(two_channels(x, y) == expected, "wrong integral response") + reversed_failures += one_channel(x, y, -1) != expected + require(reversed_failures == 4, "reversed ij control did not discriminate") + return len(inputs), reversed_failures + + +def check_parity(): + residues = tuple(product(range(2), repeat=4)) + for residue in residues: + half_product = multiply(residue, HALF_SUM) + integral = all(lane.denominator == 1 for lane in half_product) + require(integral == (sum(residue) % 2 == 0), "wrong parity criterion") + return len(residues) + + +def divides_on_right(value, divisor): + a, b, c, d = divisor + numerator = multiply(value, (a, -b, -c, -d)) + return all(lane % 2 == 0 for lane in numerator) + + +def check_right_divisors(): + candidates = tuple( + divisor + for divisor in product((-1, 0, 1), repeat=4) + if sum(lane * lane for lane in divisor) == 2 + ) + first, second = (row[0] for row in RESPONSE) + first_divisors = {d for d in candidates if divides_on_right(first, d)} + second_divisors = {d for d in candidates if divides_on_right(second, d)} + common = first_divisors & second_divisors + require(len(candidates) == 24, "incomplete norm-two domain") + require(len(first_divisors) == len(second_divisors) == 8, "wrong divisor counts") + require(not common, "found an integral one-channel factor") + return len(candidates), len(first_divisors), len(second_divisors), len(common) + + +def main(): + basis, wrong_order = check_responses() + parity = check_parity() + candidates, first, second, common = check_right_divisors() + print( + f"PASS_LIPSCHITZ_CHANNEL_GAP basis={basis} parity={parity} " + f"norm_two={candidates} individual={first},{second} common={common} " + f"reversed_order_failures={wrong_order}" + ) + + +if __name__ == "__main__": + main() From b92ecb5f9579215dda5832fe604f4124b0198cde Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Wed, 18 Nov 2026 21:18:26 +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")