From d0777ae8e8b5ded706d0fa6d4ec6dc0fa7d8b13d Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Fri, 13 Nov 2026 16:57:18 +0000 Subject: [PATCH 1/2] feat(research): prove orthogonal Schur dilation rigidity --- research/orthogonal-schur-rigidity/PROOF.md | 170 +++++++++++ research/orthogonal-schur-rigidity/README.md | 152 ++++++++++ .../orthogonal-schur-rigidity/SOURCES.json | 42 +++ research/orthogonal-schur-rigidity/TASK.json | 108 +++++++ .../orthogonal-schur-rigidity/VERIFY.json | 34 +++ research/orthogonal-schur-rigidity/matrix.py | 136 +++++++++ research/orthogonal-schur-rigidity/verify.py | 267 ++++++++++++++++++ 7 files changed, 909 insertions(+) create mode 100644 research/orthogonal-schur-rigidity/PROOF.md create mode 100644 research/orthogonal-schur-rigidity/README.md create mode 100644 research/orthogonal-schur-rigidity/SOURCES.json create mode 100644 research/orthogonal-schur-rigidity/TASK.json create mode 100644 research/orthogonal-schur-rigidity/VERIFY.json create mode 100644 research/orthogonal-schur-rigidity/matrix.py create mode 100644 research/orthogonal-schur-rigidity/verify.py diff --git a/research/orthogonal-schur-rigidity/PROOF.md b/research/orthogonal-schur-rigidity/PROOF.md new file mode 100644 index 0000000000..2afd2e0053 --- /dev/null +++ b/research/orthogonal-schur-rigidity/PROOF.md @@ -0,0 +1,170 @@ +# Orthogonal Schur dilation rigidity + +This contribution was produced by Nick Petalas. Apache-2.0. + +The claim is a scoped finite-dimensional theorem over R or C. The positive +Gram-isometry argument is the classical uniqueness argument for a minimal +positive-operator dilation. The contribution is its explicit application to +the prescribed-pivot Schur interface, including the entire residual pair. +No literature-wide priority claim is made. + +## Statement + +Fix d >= 1 and Hermitian d-by-d matrices A,B,H, with A and B invertible. +Define + +```text +T00 = I-A-B+H, T10 = A-H, T01 = B-H, T11 = H. +n0 = sum_j rank(Tj). +``` + +There exist commuting orthogonal projections P,Q on K^n with +P11=A, Q11=B and (PQ)11=H if and only if all four Tj are positive +semidefinite and n >= n0. Here K is R or C and the first d coordinates +carry the usual positive definite inner product. In particular A and B +are positive definite whenever these conditions hold. + +For every such realization form the usual Schur complements + +```text +S = P22-P21 A^-1 P12, Z = Q22-Q21 B^-1 Q12. +``` + +There is an ordered pair (S0,Z0) on dimension n0-d, determined up to +simultaneous unitary equivalence by A,B,H alone, such that + +```text +(S,Z) is unitarily equivalent to +(S0,Z0) plus k00 copies of (0,0), k10 copies of (1,0), + k01 copies of (0,1), k11 copies of (1,1), +kj = rank(Ej) - rank(Tj). +``` + +The Ej are the projections onto the four original joint sectors. Consequently the +commutator [S,Z], its rank, every nonzero singular value, and every +nonzero eigenvalue are independent of all four padding dimensions. +At each n >= n0 there is exactly one possible commutator rank for these +fixed compressed matrices in the orthogonal class. This is a restriction +of the oblique problem, not a competing formula for its rank frontier. + +## Proof + +Let i:K^d -> K^n be the coordinate isometry. For commuting orthogonal +projections the four mutually orthogonal projections are + +```text +E00=(I-P)(I-Q), E10=P(I-Q), E01=(I-P)Q, E11=PQ. +Yj=Ej i, Yj*Yj=Tj. +``` + +This gives positivity and rank(Ej) >= rank(Tj). Their sum gives n >= n0. +For sufficiency use the Hilbert space Vj=range(Tj), and regard Tj^(1/2) +as a map from K^d into Vj. Stack these four maps into i0. Since sum Tj=I, +i0*i0=I. On the direct sum of the Vj define the diagonal projections + +```text +P0=diag(0,I,0,I), Q0=diag(0,0,I,I). +``` + +Their three compressions are A,B,H. Complete i0 to an orthonormal basis +to put it in the first d coordinate positions. This realizes n0. Add +00-sector dimensions to realize every larger n. Square roots and this +basis completion are existence operations over R or C; a rational +orthonormal realization at n0 is not asserted. + +For any realization set Cj=range(Yj) and C=orthogonal direct sum Cj. +Then dim C=n0 and i(K^d) is contained in C, because i=sum Yj. Each +original sector splits orthogonally as Cj plus an inactive subspace Kj. +Both C and its orthogonal complement reduce P and Q. On Kj the ordered +pair is the corresponding scalar pair j. + +If Yj and Yj' come from two realizations with the same Tj, the rule + +```text +Uj(Yj x)=Yj' x +``` + +is well-defined: both squared norms equal x*Tj x, so their kernels +agree. Polarization shows that Uj preserves the inner product. It is +onto Cj' by definition. Their orthogonal direct sum U:C -> C' is unitary, +intertwines both P and Q, and satisfies Ui=i'. This proves uniqueness +of the core as a dilation fixing the observed coordinates pointwise. + +It remains to show that the same decomposition survives Schur deletion. +On the whole ambient space put + +```text +Phat=P-Pi A^-1 i*P, Qhat=Q-Qi B^-1 i*Q. +``` + +Pi A^-1 i*P is the orthogonal projection onto range(Pi): it is +self-adjoint, its square equals itself using i*Pi=A, and it is the +identity on range(Pi). This range lies inside range(P). Thus Phat is +also an orthogonal projection, and it kills i(K^d). The same holds for +Qhat. In the original coordinates they are diag(0,S), diag(0,Z). + +Both correction terms have range in C and vanish on C-perp. Therefore +on C-perp the lifted pair remains the original commuting scalar pair. +On C, U intertwines the correction terms because it intertwines P,Q +and fixes i. Restricting to C intersect i(K^d)-perp gives the unique +pair (S0,Z0). Each Kj already lies in i(K^d)-perp. These orthogonal +subspaces exhaust the residual space and prove the displayed decomposition. +Its commutator is [S0,Z0] plus a zero matrix, proving all consequences. + +## Scalar specialization + +For d=1 write A=a>0, B=b>0, H=h. Feasibility says + +```text +max(0,a+b-1) <= h <= min(a,b). +c = (a-h)(b-h)/(ab). +``` + +The forced Schur-commutator norm is sqrt(c(1-c)). Its rank is two when +0= n0 = rank(T00)+rank(T10)+rank(T01)+rank(T11). +(S,Z) = one fixed core pair plus copies of (0,0), (1,0), (0,1), (1,1), + up to a simultaneous unitary change of residual coordinates. +``` + +In particular the commutator rank and every nonzero commutator singular +value are independent of padding. There is a single feasible rank at +every admitted dimension in this orthogonal class. This closes off +ambient padding as a way to change the rank while retaining these +compressed effects and self-adjointness. [PROOF.md](PROOF.md) gives the +existence construction, core isometry and Schur decomposition. + +The minimum positive-operator dilation and its Gram-isometry argument +are classical. The contribution is the explicit Schur-interface +restriction and its consequences. No literature-wide priority is claimed. + +## Scalar consequence + +For d=1, A=a>0, B=b>0, H=h, set c=(a-h)(b-h)/(ab). The exact +Schur-commutator norm is sqrt(c(1-c)); its rank is two if +0 None: + if not condition: + raise ValueError(message) + + +def matrix(rows) -> Matrix: + out = tuple(tuple(F(x) for x in row) for row in rows) + require(0 < len(out) <= LIMIT, "matrix row capacity") + require(len(out[0]) <= LIMIT, "matrix column capacity") + require(all(len(row) == len(out[0]) for row in out), "ragged matrix") + return out + + +def zero(n: int, m: int) -> Matrix: + return matrix([[0] * m for _ in range(n)]) + + +def eye(n: int) -> Matrix: + return matrix([[int(i == j) for j in range(n)] for i in range(n)]) + + +def tr(a: Matrix) -> Matrix: + require(bool(a[0]), "cannot transpose a zero-column matrix") + return matrix(zip(*a, strict=True)) + + +def add(a: Matrix, b: Matrix, factor=1) -> Matrix: + require(len(a) == len(b) and len(a[0]) == len(b[0]), "sum shape") + return matrix([[x + factor * y for x, y in zip(r, s, strict=True)] + for r, s in zip(a, b, strict=True)]) + + +def mul(a: Matrix, b: Matrix) -> Matrix: + require(len(a[0]) == len(b), "product shape") + return matrix([[sum(x * y for x, y in zip(row, col, strict=True)) + for col in zip(*b, strict=True)] for row in a]) + + +def rref(a: Matrix): + rows = [list(row) for row in a] + pivots = [] + for j in range(len(a[0])): + candidates = [i for i in range(len(pivots), len(a)) if rows[i][j]] + if not candidates: + continue + k = len(pivots) + rows[k], rows[candidates[0]] = rows[candidates[0]], rows[k] + v = rows[k][j] + rows[k] = [x / v for x in rows[k]] + for i in range(len(a)): + if i != k: + v = rows[i][j] + rows[i] = [x - v * y for x, y in zip(rows[i], rows[k], strict=True)] + pivots.append(j) + return matrix(rows), tuple(pivots) + + +def rank(a: Matrix) -> int: + return len(rref(a)[1]) + + +def inv(a: Matrix) -> Matrix: + n = len(a) + require(n == len(a[0]) and 2 * n <= LIMIT, "inverse capacity or shape") + rr, pivots = rref(matrix([row + unit for row, unit in zip(a, eye(n), strict=True)])) + require(pivots[:n] == tuple(range(n)), "singular matrix") + return matrix([row[n:] for row in rr]) + + +def basis(a: Matrix) -> Matrix: + pivots = rref(a)[1] + return matrix([[row[j] for j in pivots] for row in a]) + + +def orthoproject(a: Matrix) -> Matrix: + b = basis(a) + if not b[0]: + return zero(len(a), len(a)) + return mul(mul(b, inv(mul(tr(b), b))), tr(b)) + + +def block(a: Matrix, rows: range, cols: range) -> Matrix: + return matrix([[a[i][j] for j in cols] for i in rows]) + + +def diag(values) -> Matrix: + values = tuple(values) + return matrix([[v if i == j else 0 for j in range(len(values))] + for i, v in enumerate(values)]) + + +def householder(vector) -> Matrix: + v = tuple(F(x) for x in vector) + norm = sum(x * x for x in v) + require(bool(norm), "zero reflection vector") + return matrix([[int(i == j) - 2 * x * y / norm + for j, y in enumerate(v)] for i, x in enumerate(v)]) + + +def schur(p: Matrix, d: int) -> Matrix: + n = len(p) + require(1 <= d < n, "pivot size") + first, tail = range(d), range(d, n) + a = block(p, first, first) + correction = mul(mul(block(p, tail, first), inv(a)), block(p, first, tail)) + return add(block(p, tail, tail), correction, -1) + + +def psd(a: Matrix) -> bool: + if a != tr(a): + return False + rows = [list(row) for row in a] + for k in range(len(a)): + if any(rows[i][i] < 0 for i in range(k, len(a))): + return False + positive = [i for i in range(k, len(a)) if rows[i][i] > 0] + if not positive: + return all(rows[i][j] == 0 for i in range(k, len(a)) + for j in range(k, len(a))) + p = positive[0] + rows[k], rows[p] = rows[p], rows[k] + for row in rows: + row[k], row[p] = row[p], row[k] + pivot = rows[k][k] + for i in range(k + 1, len(a)): + for j in range(k + 1, len(a)): + rows[i][j] -= rows[i][k] * rows[k][j] / pivot + return True diff --git a/research/orthogonal-schur-rigidity/verify.py b/research/orthogonal-schur-rigidity/verify.py new file mode 100644 index 0000000000..25fe796825 --- /dev/null +++ b/research/orthogonal-schur-rigidity/verify.py @@ -0,0 +1,267 @@ +"""Exact finite corroboration of orthogonal Schur dilation rigidity.""" + +import hashlib +import itertools +import json +import sys +from fractions import Fraction as F +from pathlib import Path + +sys.path.insert(0, str(Path(__file__).resolve().parent)) +from matrix import ( + add, basis, block, diag, eye, householder, inv, matrix, mul, + orthoproject, psd, rank, require, rref, schur, tr, zero, +) + +SECTORS = ((0, 0), (1, 0), (0, 1), (1, 1)) + + +def sectors(p, q): + ident = eye(len(p)) + pq = mul(p, q) + return (add(add(add(ident, p, -1), q, -1), pq), + add(p, pq, -1), add(q, pq, -1), pq) + + +def premises(p, q, d): + n = len(p) + require(1 <= d < n <= 14, "fixture dimensions") + require(len(p[0]) == n and len(q) == len(q[0]) == n, "square shape") + for a in (p, q): + require(a == tr(a), "self-adjointness") + require(mul(a, a) == a, "idempotence") + require(rank(block(a, range(d), range(d))) == d, "invertible pivot") + require(mul(p, q) == mul(q, p), "commutation") + + +def data(p, q, d): + premises(p, q, d) + es = sectors(p, q) + ys = tuple(block(e, range(len(p)), range(d)) for e in es) + ts = tuple(block(e, range(d), range(d)) for e in es) + cs = tuple(orthoproject(y) for y in ys) + for y, t, c in zip(ys, ts, cs, strict=True): + require(mul(tr(y), y) == t and psd(t), "positive Gram effect") + require(rank(c) == rank(t), "core sector dimension") + return es, ys, ts, cs + + +def concatenate(parts): + return matrix([sum((part[i] for part in parts), ()) + for i in range(len(parts[0]))]) + + +def lifted_schur(p, d): + n = len(p) + first = range(d) + correction = mul(mul(block(p, range(n), first), + inv(block(p, first, first))), block(p, first, range(n))) + return add(p, correction, -1) + + +def verify_decomposition(p, q, d): + es, _, ts, cs = data(p, q, d) + n = len(p) + core = zero(n, n) + for c in cs: + core = add(core, c) + observed = diag([int(i < d) for i in range(n)]) + require(mul(core, observed) == observed, "core contains observed space") + require(mul(core, core) == core, "orthogonal core projection") + require(rank(core) == sum(rank(t) for t in ts), "minimum core dimension") + w = basis(add(core, observed, -1)) + ks = tuple(basis(add(e, c, -1)) for e, c in zip(es, cs, strict=True)) + change = block(concatenate((w,) + ks), range(d, n), range(n - d)) + change_inv = inv(change) + core_size = len(w[0]) + iota = block(eye(n), range(n), range(d)) + core_basis = concatenate((iota, w)) + left = mul(inv(mul(tr(core_basis), core_basis)), tr(core_basis)) + for index, original in enumerate((p, q)): + require(mul(original, core) == mul(core, original), "reducing core") + residual = schur(original, d) + lift = lifted_schur(original, d) + require(lift == tr(lift) and mul(lift, lift) == lift, "Schur projection") + expected = [list(row) for row in zero(n - d, n - d)] + if core_size: + small = schur(mul(mul(left, original), core_basis), d) + for r in range(core_size): + for c in range(core_size): + expected[r][c] = small[r][c] + offset = core_size + for label, k in zip(SECTORS, ks, strict=True): + for r in range(len(k[0])): + expected[offset + r][offset + r] = label[index] + offset += len(k[0]) + require(offset == n - d, "complete residual decomposition") + require(mul(mul(change_inv, residual), change) == matrix(expected), + "literal ordered residual decomposition") + comm = add(mul(schur(p, d), schur(q, d)), mul(schur(q, d), schur(p, d)), -1) + require(rank(comm) % 2 == 0, "orthogonal commutator even rank") + return ts, rank(comm) + + +def generated_pair(profile, seed): + n = sum(profile) + v = [i + 1 for i in range(n)] + rotation = householder(v) + if seed: + w = [((3 * i + seed) % 7) - 3 for i in range(n)] + rotation = mul(rotation, householder(w)) + labels = tuple(label for label, count in zip(SECTORS, profile, strict=True) + for _ in range(count)) + return tuple(mul(mul(tr(rotation), diag([label[j] for label in labels])), rotation) + for j in range(2)) + + +def padded_pair(p, q, d, label): + n = len(p) + tail = householder([i + 1 for i in range(n + 1 - d)]) + rotation = [list(row) for row in eye(n + 1)] + for i in range(n + 1 - d): + for j in range(n + 1 - d): + rotation[d + i][d + j] = tail[i][j] + rotation = matrix(rotation) + result = [] + for index, a in enumerate((p, q)): + extended = matrix([list(row) + [0] for row in a] + [[0] * n + [label[index]]]) + result.append(mul(mul(tr(rotation), extended), rotation)) + return tuple(result) + + +def verify_core_isometry(p, q, p2, q2, d): + _, ys, ts, cs = data(p, q, d) + _, zs, us, ds = data(p2, q2, d) + require(ts == us, "same prescribed effects") + mapping = zero(len(p2), len(p)) + core, core2 = zero(len(p), len(p)), zero(len(p2), len(p2)) + for y, z, c, e in zip(ys, zs, cs, ds, strict=True): + pivots = rref(y)[1] + if pivots: + b = matrix([[row[j] for j in pivots] for row in y]) + b2 = matrix([[row[j] for j in pivots] for row in z]) + local = mul(mul(b2, inv(mul(tr(b), b))), tr(b)) + require(mul(local, y) == z, "Gram isometry maps all observed columns") + mapping = add(mapping, local) + core, core2 = add(core, c), add(core2, e) + require(mul(tr(mapping), mapping) == core, "initial core isometry") + require(mul(mapping, tr(mapping)) == core2, "final core isometry") + iota = block(eye(len(p)), range(len(p)), range(d)) + iota2 = block(eye(len(p2)), range(len(p2)), range(d)) + require(mul(mapping, iota) == iota2, "isometry fixes retained coordinates") + for a, b in ((p, p2), (q, q2)): + require(mul(mapping, a) == mul(b, mapping), "original pair intertwining") + require(mul(mapping, lifted_schur(a, d)) == mul(lifted_schur(b, d), mapping), + "Schur pair intertwining") + + +def scalar_check(p, q, ts): + a = ts[1][0][0] + ts[3][0][0] + b = ts[2][0][0] + ts[3][0][0] + h = ts[3][0][0] + c = (a - h) * (b - h) / (a * b) + s, z = schur(p, 1), schur(q, 1) + k = add(mul(s, z), mul(z, s), -1) + norm_squared = -sum(mul(k, k)[i][i] for i in range(len(k))) / 2 + require(norm_squared == c * (1 - c), "scalar norm formula") + require(rank(k) == (2 if 0 < h < min(a, b) else 0), "scalar rank formula") + return norm_squared + + +def fixtures(): + for n in range(2, 5): + for profile in itertools.product(range(n + 1), repeat=4): + if sum(profile) == n: + for seed in range(2): + for d in range(1, min(2, n - 1) + 1): + yield profile, seed, d + for n in (5, 6, 7): + for profile in ((0, 2, 2, n - 4), (1, 1, 2, n - 4), (n - 3, 1, 1, 1)): + for d in (1, 2, 3): + yield profile, 2, d + + +def rejection_controls(p, q): + rejected = 0 + for mode in range(6): + a, b, d = p, q, 1 + if mode == 0: + a = add(a, eye(len(a))) + elif mode == 1: + rows = [list(row) for row in a] + rows[0][1] += 1 + a = matrix(rows) + elif mode == 2: + b = diag([1] + [0] * (len(a) - 1)) + elif mode == 3: + a = zero(len(a), len(a)) + elif mode == 4: + d = 0 + else: + d = len(a) + try: + premises(a, b, d) + except ValueError: + rejected += 1 + require(rejected == 6, "hypothesis controls") + require(not psd(matrix([[0, 1], [1, 0]])), "indefinite zero-diagonal control") + require(not psd(matrix([[-1, 0], [0, 1]])), "negative-effect control") + return rejected + 2 + + +def run(): + counts = dict(candidates=0, admitted=0, singular_pivots=0, scalar=0, padded=0) + histogram = {} + padding_seeds = [] + by_size = {1: 0, 2: 0, 3: 0} + for profile, seed, d in fixtures(): + counts['candidates'] += 1 + p, q = generated_pair(profile, seed) + if any(rank(block(a, range(d), range(d))) < d for a in (p, q)): + counts['singular_pivots'] += 1 + continue + ts, r = verify_decomposition(p, q, d) + counts['admitted'] += 1 + histogram[str(r)] = histogram.get(str(r), 0) + 1 + if d == 1: + scalar_check(p, q, ts) + counts['scalar'] += 1 + if by_size[d] < 3 and r: + padding_seeds.append((p, q, d)) + by_size[d] += 1 + for p, q, d in padding_seeds: + for label in SECTORS: + p2, q2 = padded_pair(p, q, d, label) + verify_decomposition(p2, q2, d) + verify_core_isometry(p, q, p2, q2, d) + counts['padded'] += 1 + v = [F(1, 3)] * 3 + [F(1, 2)] * 2 + [F(1, 3), F(1, 6), F(1, 6)] + rotation = householder([int(i == 0) - x for i, x in enumerate(v)]) + labels = [(1, 0)] * 3 + [(0, 1)] * 2 + [(1, 1)] * 3 + p, q = tuple(mul(mul(tr(rotation), diag([x[j] for x in labels])), rotation) + for j in range(2)) + ts, r = verify_decomposition(p, q, 1) + require(tuple(t[0][0] for t in ts) == (0, F(1, 3), F(1, 2), F(1, 6)), + "half-norm fixture effects") + require(r == 2 and scalar_check(p, q, ts) == F(1, 4), "attained half norm") + counts['controls'] = rejection_controls(p, q) + counts['rank_histogram'] = histogram + counts['padding_seed_pivot_sizes'] = by_size + counts['half_norm_fixture_core_dimension'] = sum(rank(t) for t in ts) + require(tuple(counts[k] for k in ('candidates', 'admitted', 'singular_pivots', + 'scalar', 'padded')) == (267, 137, 130, 93, 32), + "fixture coverage") + require(histogram == {'0': 110, '2': 25, '4': 2}, "rank coverage") + return counts + + +if __name__ == '__main__': + result = run() + root = Path(__file__).resolve().parent + names = ('README.md', 'PROOF.md', 'matrix.py', 'verify.py', + 'TASK.json', 'SOURCES.json', 'VERIFY.json') + result['source_sha256'] = { + name: hashlib.sha256((root / name).read_bytes()).hexdigest() for name in names + } + result['status'] = 'PASS_ORTHOGONAL_SCHUR_RIGIDITY' + print(json.dumps(result, sort_keys=True)) From 9f82d3e7dc096f8c0b69f0523d36e44950493f9a Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Tue, 17 Nov 2026 22:51:03 +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")