From a965bcb5b88e2e3a9856e1cc53639b43a896b663 Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Fri, 13 Nov 2026 16:56:12 +0000 Subject: [PATCH] feat(research): prove the shared-hub query dimension is nine --- research/shared-hub-pentagon-query/PROOF.md | 109 +++++++ research/shared-hub-pentagon-query/README.md | 137 +++++++++ .../shared-hub-pentagon-query/SOURCES.json | 43 +++ research/shared-hub-pentagon-query/TASK.json | 81 ++++++ .../shared-hub-pentagon-query/VERIFY.json | 32 +++ research/shared-hub-pentagon-query/verify.py | 267 ++++++++++++++++++ 6 files changed, 669 insertions(+) create mode 100644 research/shared-hub-pentagon-query/PROOF.md create mode 100644 research/shared-hub-pentagon-query/README.md create mode 100644 research/shared-hub-pentagon-query/SOURCES.json create mode 100644 research/shared-hub-pentagon-query/TASK.json create mode 100644 research/shared-hub-pentagon-query/VERIFY.json create mode 100644 research/shared-hub-pentagon-query/verify.py diff --git a/research/shared-hub-pentagon-query/PROOF.md b/research/shared-hub-pentagon-query/PROOF.md new file mode 100644 index 0000000000..2bb5a1c8e0 --- /dev/null +++ b/research/shared-hub-pentagon-query/PROOF.md @@ -0,0 +1,109 @@ +# Two pentagons with a shared hub need nine two-coordinate queries + +This contribution was produced by Nick Petalas. Apache-2.0. + +## Statement + +Let G have vertices 0,...,8 and the two cycles + +```text +0--1--2--3--4--0 +0--5--6--7--8--0. +``` + +Over any field F, let M be an 18-by-18 matrix with 2-by-2 blocks indexed by +G. Require M_ii=I_2 and M_ij=0 for distinct nonadjacent i,j. Blocks at the +edges are unrestricted, including different matrices in the two directions. +Then the exact minimum of rank_F(M) is nine. + +Equivalently, nine is the smallest field-coordinate dimension of a linear +query factorization M=AB satisfying this complete ordered-block contract. +This is a statement about algebraic query dimension. It does not count native +calls, physical COPY operations, arbitrary-input restoration or recursive cost. + +## Lower bound + +The independent set S={1,3,5,7} has identity principal submatrix I_8. +Consequently rank(M)>=8. Suppose for a contradiction that rank(M)=8, and +write M=AB with A having eight columns and B eight rows. Write A_i for the +two-row block of A and B_i for the two-column block of B, and U_i=im(B_i). + +Since M[S,S]=I_8, the four U_s for s in S form a direct decomposition of the +eight-dimensional query space. The four A_s are its coordinate projections, +after identifying each U_s with F^2 using B_s. In these coordinates, the +ordered zeros M_sj=0 imply that B_j has no component in U_s whenever s,j +are distinct nonneighbors. In particular, + +```text +U_4 is contained in U_3, +U_2 is contained in U_1 + U_3, +U_8 is contained in U_7, +U_6 is contained in U_5 + U_7. +``` + +Every B_i has rank two because A_i B_i=I_2. It follows that U_4=U_3 and +U_8=U_7. Since 2 and 4 are nonadjacent, A_2 B_4=0, so A_2 kills U_3. +Its restriction to U_2 is invertible. Therefore the projection of U_2 onto +U_1 along U_3 is injective. Both spaces have dimension two, so that +projection is surjective. + +The hub decoder A_0 kills U_3 because 0 and 3 are nonadjacent, and kills +U_2 because 0 and 2 are nonadjacent. For every u in U_1, surjectivity gives +a v in U_2 with v=u+w for some w in U_3. Hence + +```text +A_0 u = A_0 v - A_0 w = 0. +``` + +Thus A_0 kills U_1. The same argument on 6,8 shows that A_0 kills U_5. +It already kills U_7, since 0 and 7 are nonadjacent. It therefore kills +U_1+U_3+U_5+U_7, which is the entire query space. This contradicts +A_0 B_0=I_2. Rank eight is impossible, proving rank(M)>=9. + +All steps use dimensions, invertibility and the specified ordered zeros. +They apply in every characteristic and do not assume symmetric, commuting +or invertible edge blocks. The independent-set argument alone gives only +eight; the two terminal saturation steps supply the extra dimension. + +## Attainment + +Write the two input coordinates at vertex i as x_(i,0),x_(i,1), and encode +coordinate (i,a) as the integer 2i+a. Form the following nine unordered pairs: + +```text +(0,2), (3,4), (5,6), (7,8), (9,1), +(10,12), (11,13), (14,16), (15,17). +``` + +Every integer 0,...,17 occurs exactly once. Each pair joins coordinates +belonging to adjacent vertices. Query the sum of the two coordinates of +each pair. To recover one coordinate, its receiver subtracts the paired +coordinate, which its read mask permits. + +More explicitly, let B have nine rows and eighteen columns, with one row +equal to the indicator of each pair, and set A=B^T. Then M=AB has I_2 in +every diagonal block and zero blocks at every nonedge. The columns of A +associated with different pairs have disjoint supports, so A has rank +nine. The same is true of the rows of B. Each pair contributes the rank-one +block [[1,1],[1,1]] on its two coordinates, including in characteristic two. +Thus rank(M)=9 over every field, as required. + +Independent invertible changes of the two coordinates at each vertex give +L M L^-1. They preserve identity diagonals, the complete zero mask and +rank nine. They need not preserve symmetry or make the allowed blocks +commute. These transformations give the noncommuting finite fixtures. + +## What this settles + +For this shared-hub two-coordinate mask, arbitrary directed block coding +cannot improve on the nine-coordinate edge-pairing construction. The graph +is triangle-free and has overlapping odd cycles. Sharing a hub therefore +does not by itself provide a block-coding saving beyond coordinate pairing +in this two-pentagon example. + +The lower argument is written here rather than inferred from a finite +matrix census. The verifier checks the supplied construction, literal +decoding and the local saturated-branch identities used in that argument. +It does not exhaust all fitting matrices and does not prove the universal +claim by enumeration. Larger payloads and other shared-cycle topologies +remain open within this package. diff --git a/research/shared-hub-pentagon-query/README.md b/research/shared-hub-pentagon-query/README.md new file mode 100644 index 0000000000..8025754cc1 --- /dev/null +++ b/research/shared-hub-pentagon-query/README.md @@ -0,0 +1,137 @@ +# A shared hub between two pentagons needs nine query coordinates + +This contribution was produced by Nick Petalas. Apache-2.0. +Independent human and formal proof-kernel review are unclaimed. + +Claim type: scoped written mathematical proof, with exact finite conformance. +For the graph with cycles `0-1-2-3-4-0` and `0-5-6-7-8-0`, give every vertex +exactly two field coordinates. Over every field, the exact minimum fitting +rank is **nine**. Diagonal blocks are `I_2`; both ordered blocks at every +nonedge are zero; all allowed edge blocks are arbitrary 2-by-2 matrices. +They may be asymmetric, singular and noncommuting. + +The independent-set bound gives eight. [PROOF.md](PROOF.md) excludes rank +eight by saturating that bound: terminal subspaces on both arms force the +hub decoder to annihilate the entire query space. Nine disjoint coordinate +pairs attain the bound. Thus this shared-hub mask gives no improvement over +optimal integral edge pairing, even with general directed block coding. +This is the original changed-mask result delivered here, not a claim of a +first result about overlapping cycles in general or of literature priority. + +The card `complex-rank-shape-decoder` changes scope from complete supplier +construction to this algebraic decoder side result. It tests one proposed +route around single-cycle pairing obstructions. No source-bound physical +caller, complete signed invoice, new kappa or multiplication theorem follows. +The selected #7000 record and all frozen evidence remain unchanged. + +## Exact evidence + +The standalone verifier imports no project code and runs no predecessor +executable. It checks: + +- 376 complete rank-nine factorizations over F2, F3, F5, F7, F101 and Q, + including asymmetric and noncommuting edge-block fixtures. Every one of + their 121,824 ordered entries satisfies the full diagonal/zero contract. +- All 262,144 binary input assignments to the nine-pair encoder and literal + side-information decoder, giving 4,718,592 coordinate recoveries. +- All 187,200 local normalized branch instances over F2 and F3 used by the + saturation proof. These enumerate invertible terminal/projection blocks + and arbitrary intermediate blocks. They are not all fitting matrices. +- Nine query omissions and three illegal diagonal/zero-mask edits reject. + A positive boundary control attains rank eight after adding only edge + `0-2`; the original zero-mask validator rejects that code. + +The universal exclusion rests on the written proof. These finite checks +corroborate the construction and local algebra, without pretending to +exhaust the unrestricted 18-by-18 fitting-matrix space. The generated JSON +on stdout binds the results to SHA256 of all six package files. No receipt +is hand-written or retained as frozen evidence, and normal execution writes +nothing into the checkout. + +## Reproduction + +From the repository root, use standard-library CPython 3.12: + +```sh +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -W error -B research/shared-hub-pentagon-query/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -W error -O -B research/shared-hub-pentagon-query/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/research_package.py --package research/shared-hub-pentagon-query +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/check_research_commit.py --package research/shared-hub-pentagon-query --check-source-history +``` + +Another CPython 3.12 executable may replace that path. Direct verification +prints `PASS_SHARED_HUB_PENTAGON_QUERY` in its JSON result, with minimum +query dimension nine. Both normal and optimized modes use explicit +exceptions. The registered runner executes both, each with a 120-second +limit. Hosted CI status belongs in the contribution PR body. + +## Credit and overlap + +JoyboyBrian's [#5023](https://github.com/CrocSwap/integer-mult-bounds/pull/5023) +supplies the unequal-payload odd-cycle query interface, with credit to +Tekalign #3362, Sagar Thakrar #2484, ywz65 #2471, Nick Petalas #4909, +Cinna Davis, Adam Gall, ctoth, Philippe Van Velzen and the retained +P112/native lineage. Its single-cycle theorem is credited background. +The proof here does not invoke its numerical results or construction. + +Yossi Berliner and Michael Langberg's classical +[*Index coding with outerplanar side information*, Theorem 1.1](https://www.openu.ac.il/home/mikel/papers/outer.pdf) +settles the scalar outerplanar minimum through clique covers. Section 7 +leaves vector-linear coding outside that paper's result. The contribution +here concerns two-coordinate blocks and a direct saturation proof. +Classical fitting-matrix rank factorization and coordinate-pair coding +retain their credit. No global first-discovery claim is made. + +Nick Petalas's older `clebsch-puncture-query-gap` package studies a different +mask and a specified classical binary matrix. It is related background, +not the source of this question or a construction used in the main step. +No predecessor package is audited or scientifically replayed. + +Canonical base is `e54523517d0f03e58352e647c403a5af3e525a57`, priority revision 8. +[SOURCES.json](SOURCES.json) pins the catalogue, selected record and odd-cycle +exposition as historical provenance. There are no live external inputs. +The [advance claim](https://github.com/CrocSwap/integer-mult-bounds/discussions/1166#discussioncomment-19595344) +records the same scope. Live open/recent-account PRs, Discussion claims, +local reservations, full-main distinctive README searches and merged-title +searches were checked. The cached scan covers remote pagination but omits +most sparse local notes; the full-main Git searches supplement that omission. +Arbitrary historical diffs and unpublished work remain outside coverage. + +## Limitations and implementation constraints + +This theorem is a linear dimension contract for this one graph and payload +width. Nonlinear coding, larger payloads and other topologies are unproved. +No physical source reads, query implementation, side-information acquisition, +owned or borrowed state, dirty restoration, frame conversions, coefficient +preparation, hosting, precision, tapes, stock, uniform compiler, complete +recursive invoice or supplier admission is provided. These unknown costs +are not treated as zero. There is no dependent implementation expansion. +No selected cold replay, Lean, Docker or formal proof-kernel build was run. + +The verifier has no recursion, subprocesses, network or output-file path. +Every matrix is at most 18-by-18, all finite domains are literal constants, +and all functions are below sixty physical lines. Inputs are streamed, +including the 262,144 assignments; no table of those assignments is retained. +Explicit exceptions enforce contracts under optimization. Warning-strict +normal/optimized execution and syntax inspection supply local diagnostics. +No separate external static analyzer is claimed. + +Power of Ten rule 3 has a bounded managed-runtime deviation. Python allocates +integer, Fraction and small collection objects during checking. The largest +matrix has 324 entries, GL2 lists contain at most 48 matrices, and one +branch/input/profile is processed at a time. There is no fixed-storage or +steady-service claim. Build the Lever led to the executable factorization +and repeatable checker; Prove It Works led to every-input literal decoding +and the original-mask rejection of the rank-eight boundary control. + +## Open next questions + +1. What is the exact minimum on this graph with three coordinates per vertex? + The same saturation argument excludes the independent-set bound twelve, + while the cycle-plus-path pairing recipe gives fourteen. Seek a rank-thirteen + factorization or exclude it. That case is not decided here. +2. Can an actual recursive caller expose this mask and benefit after complete + physical charges? Pin the producer, consumer and chronological read + permissions; then price source access, nine queries, side information, + restoration, frames and delivery. No such caller or native invoice is + supplied. A dimension optimum alone cannot establish profitability. diff --git a/research/shared-hub-pentagon-query/SOURCES.json b/research/shared-hub-pentagon-query/SOURCES.json new file mode 100644 index 0000000000..471e425253 --- /dev/null +++ b/research/shared-hub-pentagon-query/SOURCES.json @@ -0,0 +1,43 @@ +{ + "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/odd-cycle-query-capacity/README.md", + "usage": "provenance", + "git_blob": "55514f7ff0e239472ed2ca9c872c4cb2b8c53968", + "sha256": "7da79bbc83e6612e094fc040d6857343c97254ee10415a386b86406413350961" + }, + { + "path": "research/odd-cycle-query-capacity/PROOF.md", + "usage": "provenance", + "git_blob": "5130e487b8f4e7c3f49cd4a654fe3fc51ce900b5", + "sha256": "fc99f405abd5df1c3f88563826f02b53783bba464d1a1852b5093126bf42637a" + } + ], + "references": [ + { + "url": "https://github.com/CrocSwap/integer-mult-bounds/pull/5023", + "role": "Longer-cycle arbitrary-block model, credited background; no predecessor theorem or code is used in the new lower proof." + }, + { + "url": "https://www.openu.ac.il/home/mikel/papers/outer.pdf", + "authors": "Yossi Berliner and Michael Langberg", + "title": "Index coding with outerplanar side information", + "locators": "Theorem 1.1; Section 7", + "role": "Classical scalar outerplanar result; vector-linear case left outside that paper. Not the new two-coordinate theorem." + } + ] +} diff --git a/research/shared-hub-pentagon-query/TASK.json b/research/shared-hub-pentagon-query/TASK.json new file mode 100644 index 0000000000..1f78fcaa20 --- /dev/null +++ b/research/shared-hub-pentagon-query/TASK.json @@ -0,0 +1,81 @@ +{ + "schema_version": 1, + "task_id": "complex-rank-shape-decoder", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "complex-rank-shape-decoder", + "question": "Can a legal decoder or coframe change improve the full signed moment, including changed helper targets?", + "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", + "docs/research/recursive-invoice-preflight.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": "Price one complete changed itinerary with both paid and productive histograms. Check #5693/#5698 for overlap and their exact hypotheses before another coframe search. Use the signed invoice preflight where its boundary contract agrees; an inconclusive concave comparison is not a power crossing. Stop if an optimistic complete budget fails at the chosen target or native delivery remains unspecified.", + "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": [ + "coframe", + "signed moment", + "5693", + "5698" + ], + "existing_checks": [ + { + "scope": "Selected PR5599: complete helper-subspace construction and independent caller replay; five framework assumptions remain.", + "evidence": "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md", + "remaining": "The next experiment must identify uncovered source-specific work. Successor archive intake does not transfer this admission.", + "status": "reviewed", + "source_commit": "09dd0965711ca7eeb169057a420abab1c9052137", + "selected_record_sha256": "2a0220e866417774606e0f991e41b9c1d26b1f43b97857238cf478dbc7d330b5" + } + ] + }, + "scope_status": "changed", + "actual_scope": "Exact all-field two-coordinate query dimension nine for two pentagons sharing one hub", + "scope_change_reason": "Original changed-mask decoder side experiment, replacing complete supplier synthesis by a scoped arbitrary-block query-dimension obstruction.", + "bottleneck_link": "Tests whether overlapping odd cycles at a shared hub can reduce decoder acquisition below integral edge pairing. This is an algebraic side result; physical delivery and a complete signed supplier invoice remain absent.", + "budget_minutes": 60, + "stop_rule": "Stop at the first proved sharp dimension-nine result; do not extend payload sizes or physical construction.", + "outcome": "completed", + "evidence": "PROOF.md gives the universal rank-eight exclusion and nine-channel factorization; verify.py supplies exact construction, literal decoding and local algebra conformance.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "What is the exact fitting rank on this same graph with three coordinates at every vertex?", + "why_it_matters": "It tests the first payload size beyond the sharp two-coordinate obstruction.", + "first_step": "Compare the independent-set bound twelve and its saturation exclusion with an explicit fourteen-coordinate pairing construction; seek rank thirteen or exclude it.", + "blocked_by": "The present proof only excludes the saturated independent-set bound; it does not decide rank thirteen." + }, + { + "question": "Can an actual recursive caller expose this mask and benefit from its nine-channel code after all physical charges?", + "why_it_matters": "Query dimension alone does not price a complete supplier.", + "first_step": "Pin a chronological producer/consumer and its ordered read permissions, then charge source reads, nine queries, side information, restoration, frames and delivery.", + "blocked_by": "No physical caller, native maps or complete paid/productive invoice is supplied." + } + ] +} diff --git a/research/shared-hub-pentagon-query/VERIFY.json b/research/shared-hub-pentagon-query/VERIFY.json new file mode 100644 index 0000000000..557d8c2442 --- /dev/null +++ b/research/shared-hub-pentagon-query/VERIFY.json @@ -0,0 +1,32 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [], + "commands": [ + { + "argv": [ + "{python}", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "All-field proof conformance: explicit rank-nine factorizations, every binary input, finite saturated-branch identities and rejection controls." + }, + { + "argv": [ + "{python}", + "-W", + "error", + "-O", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Same exact corpus under optimized Python; scientific checks use explicit exceptions." + } + ] +} diff --git a/research/shared-hub-pentagon-query/verify.py b/research/shared-hub-pentagon-query/verify.py new file mode 100644 index 0000000000..5d94be2321 --- /dev/null +++ b/research/shared-hub-pentagon-query/verify.py @@ -0,0 +1,267 @@ +#!/usr/bin/env python3 +"""Exact conformance for the shared-hub two-coordinate query theorem. + +Produced by Nick Petalas. Apache-2.0. +The universal lower bound is a written proof, not a finite matrix search. +""" + +import hashlib +import itertools +import json +import platform +from fractions import Fraction +from pathlib import Path + + +def require(condition, message): + if not condition: + raise ValueError(message) + + +def edges(): + return ((0, 1), (1, 2), (2, 3), (3, 4), (4, 0), + (0, 5), (5, 6), (6, 7), (7, 8), (8, 0)) + + +def channels(): + # Coordinate (vertex, local-coordinate) is 2*vertex + local-coordinate. + return ((0, 2), (3, 4), (5, 6), (7, 8), (9, 1), + (10, 12), (11, 13), (14, 16), (15, 17)) + + +def allowed(i, j): + return any({i, j} == {u, v} for u, v in edges()) + + +def matmul(a, b, prime): + require(a and b and len(a[0]) == len(b), "matrix shape") + rows, inner, cols = len(a), len(b), len(b[0]) + require(max(rows, inner, cols) <= 18, "matrix capacity") + require(all(len(row) == inner for row in a), "ragged left matrix") + require(all(len(row) == cols for row in b), "ragged right matrix") + result = [[sum(a[i][k] * b[k][j] for k in range(inner)) + for j in range(cols)] for i in range(rows)] + return [[x % prime for x in row] for row in result] if prime else result + + +def rank(matrix, prime): + require(matrix and len(matrix) <= 18, "rank capacity") + cols = len(matrix[0]) + require(cols <= 18 and all(len(row) == cols for row in matrix), "rank shape") + work = [[x % prime if prime else Fraction(x) for x in row] for row in matrix] + pivot = 0 + for col in range(cols): + found = next((i for i in range(pivot, len(work)) if work[i][col]), None) + if found is None: + continue + work[pivot], work[found] = work[found], work[pivot] + inverse = pow(work[pivot][col], -1, prime) if prime else 1 / work[pivot][col] + work[pivot] = [x * inverse for x in work[pivot]] + if prime: + work[pivot] = [x % prime for x in work[pivot]] + for i in range(pivot + 1, len(work)): + scale = work[i][col] + work[i] = [x - scale * y for x, y in zip(work[i], work[pivot])] + if prime: + work[i] = [x % prime for x in work[i]] + pivot += 1 + if pivot == len(work): + break + return pivot + + +def check_fitting(matrix, prime): + require(len(matrix) == 18 and all(len(row) == 18 for row in matrix), "fit shape") + for i in range(18): + for j in range(18): + value = matrix[i][j] % prime if prime else matrix[i][j] + if i // 2 == j // 2: + require(value == int(i == j), "diagonal block") + elif not allowed(i // 2, j // 2): + require(value == 0, "forbidden block") + + +def base_factors(): + pairs = channels() + require(sorted(itertools.chain.from_iterable(pairs)) == list(range(18)), + "coordinate partition") + require(all(allowed(i // 2, j // 2) for i, j in pairs), "channel edge") + encoder = [[int(i in pair) for i in range(18)] for pair in pairs] + decoder = [list(row) for row in zip(*encoder)] + return decoder, encoder + + +def inverse2(a, prime): + determinant = a[0][0] * a[1][1] - a[0][1] * a[1][0] + require(determinant % prime != 0 if prime else determinant != 0, "singular basis") + scale = pow(determinant, -1, prime) if prime else Fraction(1, determinant) + result = [[a[1][1] * scale, -a[0][1] * scale], + [-a[1][0] * scale, a[0][0] * scale]] + return [[x % prime for x in row] for row in result] if prime else result + + +def all_gl2(prime): + result = [] + for values in itertools.product(range(prime), repeat=4): + a, b, c, d = values + if (a * d - b * c) % prime: + result.append([[a, b], [c, d]]) + require(len(result) == (prime * prime - 1) * (prime * prime - prime), "GL2 size") + return result + + +def basis_profile(index, prime, binary_bases): + result = [] + for vertex in range(9): + if prime == 2: + digit = index // (6 ** (vertex // 2)) % 6 if vertex in (0, 2, 4) else 0 + result.append(binary_bases[digit]) + else: + a = (index + 3 * vertex) % 7 - 3 + b = (2 * index + vertex) % 5 - 2 + result.append([[1, a], [b, 1 + a * b]]) + return result + + +def transformed_factors(profile, prime): + a, b = base_factors() + left = [[0] * 18 for _ in range(18)] + right = [[0] * 18 for _ in range(18)] + for vertex, basis in enumerate(profile): + inverse = inverse2(basis, prime) + for i in range(2): + for j in range(2): + left[2 * vertex + i][2 * vertex + j] = basis[i][j] + right[2 * vertex + i][2 * vertex + j] = inverse[i][j] + return matmul(left, a, prime), matmul(b, right, prime) + + +def check_constructions(): + binary_bases = all_gl2(2) + cases = entries = 0 + noncommuting = asymmetric = False + for prime in (2, 3, 5, 7, 101, 0): + for index in range(216 if prime == 2 else 32): + profile = basis_profile(index, prime, binary_bases) + a, b = transformed_factors(profile, prime) + matrix = matmul(a, b, prime) + check_fitting(matrix, prime) + require(rank(matrix, prime) == 9, "attaining rank") + require(rank(a, prime) == rank(b, prime) == 9, "factor rank") + asymmetric |= any(matrix[i][j] != matrix[j][i] + for i in range(18) for j in range(18)) + p = [row[2:4] for row in matrix[0:2]] + q = [row[8:10] for row in matrix[0:2]] + noncommuting |= matmul(p, q, prime) != matmul(q, p, prime) + cases += 1 + entries += 18 * 18 + require(asymmetric and noncommuting, "block generality fixture") + return {"factorizations": cases, "ordered_entries": entries, + "asymmetric_fixture": asymmetric, "noncommuting_fixture": noncommuting} + + +def check_local_lower_steps(): + # Exhaust the local saturated branch in the proof, not all fitting matrices. + total = 0 + for prime in (2, 3): + invertibles = all_gl2(prime) + identity = [[1, 0], [0, 1]] + zero = [[0, 0], [0, 0]] + for x in invertibles: + inverse = inverse2(x, prime) + for values in itertools.product(range(prime), repeat=4): + y = [list(values[:2]), list(values[2:])] + b2 = x + y + a2 = [inverse[i] + [0, 0] for i in range(2)] + require(matmul(a2, b2, prime) == identity, "branch left inverse") + for t in invertibles: + b4 = zero + t + require(matmul(a2, b4, prime) == zero, "branch nonedge") + require(rank(b4, prime) == 2, "saturated terminal") + total += 1 + p = y + require((matmul(p, x, prime) == zero) == (p == zero), + "hub coefficient forced to zero") + require(total == 187200, "local branch count") + return total + + +def check_literal_binary(): + partner = [0] * 18 + query_for = [0] * 18 + for query, (i, j) in enumerate(channels()): + partner[i], partner[j] = j, i + query_for[i] = query_for[j] = query + comparisons = 0 + for inputs in range(1 << 18): + responses = [((inputs >> i) ^ (inputs >> j)) & 1 for i, j in channels()] + for coordinate in range(18): + recovered = responses[query_for[coordinate]] ^ ((inputs >> partner[coordinate]) & 1) + require(recovered == ((inputs >> coordinate) & 1), "literal recovery") + comparisons += 1 + return {"inputs": 1 << 18, "coordinate_recoveries": comparisons} + + +def check_controls(): + a, b = base_factors() + rejected = 0 + for omitted in range(9): + smaller_a = [row[:omitted] + row[omitted + 1:] for row in a] + smaller_b = b[:omitted] + b[omitted + 1:] + try: + check_fitting(matmul(smaller_a, smaller_b, 2), 2) + except ValueError: + rejected += 1 + for row, col in ((0, 0), (0, 1), (0, 4)): + matrix = matmul(a, b, 2) + matrix[row][col] ^= 1 + try: + check_fitting(matrix, 2) + except ValueError: + rejected += 1 + require(rejected == 12, "rejection controls") + return {"rejected_mutants": rejected, "relaxed_mask_rank": check_relaxed_mask()} + + +def check_relaxed_mask(): + # Adding only the edge 0--2 permits two triangle channels and six edge channels. + groups = ((0, 2, 4), (1, 3, 5), (6, 8), (7, 9), + (10, 12), (11, 13), (14, 16), (15, 17)) + encoder = [[int(i in group) for i in range(18)] for group in groups] + matrix = matmul([list(row) for row in zip(*encoder)], encoder, 2) + for i in range(18): + for j in range(18): + if i // 2 == j // 2: + require(matrix[i][j] == int(i == j), "relaxed diagonal") + elif not allowed(i // 2, j // 2) and {i // 2, j // 2} != {0, 2}: + require(matrix[i][j] == 0, "relaxed zero mask") + require(rank(matrix, 2) == 8, "relaxed-mask rank") + try: + check_fitting(matrix, 2) + except ValueError: + return 8 + raise ValueError("relaxed mask accepted by original contract") + + +def main(): + result = {"status": "PASS_SHARED_HUB_PENTAGON_QUERY", "claim_type": "scoped-proof", + "minimum_query_dimension": 9, "payload_width": 2, + "construction": check_constructions(), + "local_saturated_branches": check_local_lower_steps(), + "literal_binary": check_literal_binary(), "controls": check_controls(), + "python": platform.python_version()} + package = Path(__file__).resolve().parent + names = {"README.md", "PROOF.md", "SOURCES.json", "TASK.json", "VERIFY.json", "verify.py"} + require({p.name for p in package.iterdir() if p.is_file()} == names, + "package inventory") + hashes = {} + for path in sorted(package.iterdir()): + if path.is_file(): + require(path.stat().st_size <= 1_048_576, "package file capacity") + hashes[path.name] = hashlib.sha256(path.read_bytes()).hexdigest() + result["sha256"] = hashes + print(json.dumps(result, sort_keys=True)) + + +if __name__ == "__main__": + main()