Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
19 changes: 18 additions & 1 deletion docs/ci-verification.md
Original file line number Diff line number Diff line change
@@ -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).
Expand Down
113 changes: 113 additions & 0 deletions research/c3-weight3-plus-plus-charpoly/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,113 @@
# Characteristic polynomial of the 44-dimensional centre block

This finite exact certificate answers Open next question 2 of
[PR #7062](https://github.com/CrocSwap/integer-mult-bounds/pull/7062),
at `d2d59844d7a1f3f739d7add8eeec0d740a3aeca8`. On sign character 7 of
sector `c=3`, the `(u,v)=(+1,+1)` space has characteristic polynomial

```text
x^10 (x^2 - 36) (x^2 - 4)^5
(x^3 - 12x + 8)^2 (x^3 - 12x - 8)^2 P_+(x) P_-(x)

P_±(x) = x^5 ± 4x^4 - 60x^3 ∓ 176x^2 + 640x ± 768.
```

This is the monic polynomial of `A_3` on the specified block. The two
cubic factors and two quintic factors are given as a product identity.
The multiplicities of 0, 2, −2, 6 and −6 are 10, 5, 5, 1 and 1.

## Certificate

Use the historical eight-by-112 query in [SOURCES.json](SOURCES.json).
Write `r_q` for its column at the nine-bit address label `q`. On a basis
vector with query coordinate `i` and address `a`, the term of `4 A_3` at
`q` multiplies by `r_q r_q^T` on the query coordinate. On the address
it applies `a → a XOR q` if the binary dot product `q·3` is one,
and multiplies by `(-1)^(q·a)` otherwise. The operator definition and
Bell identity come from the retained centre-query work.

Use the four sign flips at odd coordinates 1, 3, 5 and 7. The prescribed
eigenvalues for character 7 are `−1, −1, −1, +1`. The other generators
are `u = (0 2)(4 6)` with minus signs on 0 and 2, and
`v = (0 4)(2 6)` with minus signs on 0 and 4. Both have prescribed
eigenvalue `+1`. Each signed coordinate action induces an address action
by its action on the projective query columns. The verifier derives the
unique linear extension from the spanning port labels, checks it at all
112 labels, and checks that it is orthogonal and fixes sector 3.
It checks that the six signed actions commute and square to the identity.

Multiplying each generator by its prescribed sign turns the equations into
fixed-vector equations. For every address-coordinate orbit, start at the
least index and give it coefficient +1. The 64 subset products of the six
generators force every other coefficient in the orbit. If two products
force opposite coefficients at one index, the whole orbit is zero over
`Q`. Otherwise the signed orbit vector spans the solutions on that orbit.
Disjoint supports make these vectors independent. This accounts for all
4,096 ambient indices. The checker finds 44 surviving orbits, each of
support eight, and 508 discarded orbits.

Apply the Bell formula to each surviving vector and read the resulting
coordinates at the 44 least indices. Reconstruct each image from these
coordinates and compare all 4,096 entries. The 180,224 exact coefficient
comparisons establish the restriction, including its vanishing outside the
basis supports. The compressed integer matrix `M` represents `4 A_3`.
Faddeev–LeVerrier computes its characteristic coefficients by repeated exact
matrix multiplication and trace division. The verifier compares every
coefficient with the displayed product after scaling coefficient number
`j` by `4^j`. It also checks the zero Cayley–Hamilton residual and
rejects a sector-1 substitution for the same basis.

The verifier emits the coefficients in descending order and a generated
hash-bound receipt. SHA256 of the compact JSON matrix is
`b8996e800aec3655bc44e962f8271e33c8188c4b5e99c7fe6167a4376cfc2617`.
The scientific replay uses the Python standard library and writes nothing.

## Reproduce

Run from the repository root. Substitute a local CPython 3.12 executable
for the absolute path on another machine.

```sh
/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -W error -B research/c3-weight3-plus-plus-charpoly/verify.py
/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -O -W error -B research/c3-weight3-plus-plus-charpoly/verify.py
/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/research_package.py --package research/c3-weight3-plus-plus-charpoly
/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/check_research_commit.py --package research/c3-weight3-plus-plus-charpoly --check-source-history
```

Expected scientific marker is `PASS_C3_WEIGHT3_PLUS_PLUS_CHARPOLY`.
The metadata and committed-byte commands need Git history. The direct
verifier needs the pinned query at its declared relative path.

## Scope and credit

This contribution was produced by Nick Petalas. Credit unpaidmoon for
[PR #7062](https://github.com/CrocSwap/integer-mult-bounds/pull/7062)'s
explicit question and its adjacent 12-dimensional result, and
[PR #6965](https://github.com/CrocSwap/integer-mult-bounds/pull/6965)'s
choice of sign character and joint involutions. JoyboyBrian supplied the
sign-character handoff. Ali Romman's PRs #4958 and #4720 supply the query
and Bell action. Krzysztof Wojt's one-slot annihilator and the doubled
representation from #1719 retain their original credit. Signed-orbit
bases and the trace recurrence are standard. New work is Apache-2.0.

The formal-interface-lemma card is scoped here to one historical finite
spectral calculation. The selected source-binding orientation passed at
`e54523517d0f03e58352e647c403a5af3e525a57`. The result has no new κ or
supplier admission. The other sectors, larger tensor widths, native caller
costs and the full multiplication theorem remain outside this calculation.
No predecessor scientific verifier, selected cold replay, Lean or Docker
was run. Independent human and formal proof-kernel review are unclaimed.

The verifier's finite sizes are fixed by the authenticated query, 64 subset
products per orbit, the 4,096-index ambient action and the 44-dimensional
restriction. It is iterative and uses explicit checks under optimized
Python. Managed Python allocates containers and exact integers during
replay. The fixed dimensions bound the number of live entries.

## Open next questions

Does one signed coordinate symmetry transport this 44-dimensional block to
each of the three other weight-3 `(+1,+1)` blocks? First test the induced
action of the sector stabilizer on the character and the two involutions.
The present certificate imposes character 7 only, and the dimensions alone
do not imply equal polynomials.
30 changes: 30 additions & 0 deletions research/c3-weight3-plus-plus-charpoly/SOURCES.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,30 @@
{
"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/centre-polynomial-cache-limits/frozen/work/centre-encoding-campaign-20261014/lanes/circuit-interface/INTERFACE.json",
"usage": "input",
"git_blob": "4201e9a04c12273b919e2cae60a6b6482c8150f3",
"sha256": "5c6c51fbffc07a683e922f17532fd90262ae9e23cc3560a696002073dd234ef3"
},
{
"path": "research/c3-centre-sign-split/PROOF.md",
"usage": "provenance",
"git_blob": "8da44a79e0e3f7d3cfcd7ebb8c46cc46146a9869",
"sha256": "6d9446760eb90201b96a73c78a04fdc0320c0c3973dc9d96f05a7fd135a45558"
}
]
}
107 changes: 107 additions & 0 deletions research/c3-weight3-plus-plus-charpoly/TASK.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,107 @@
{
"schema_version": 1,
"task_id": "formal-interface-lemma",
"priority_revision": 8,
"base_commit": "e54523517d0f03e58352e647c403a5af3e525a57",
"original_card": {
"id": "formal-interface-lemma",
"question": "Can one uncovered interface implication be formalized with exact caller and certificate bindings?",
"starting_points": [
"docs/research/research-family-status.md",
"certificates/selected-result.json",
"research/gate-operand-parity-lean/README.md",
"research/staged544-certified-endpoint/README.md",
"research/unconditional-batched-crt/README.md"
],
"methods": [
"Formalize a missing boundary lemma identified by the selected review.",
"Audit a formal theorem-to-certificate binding independently."
],
"acceptance_gate": "State the exact formalized proposition and remaining assumptions; avoid duplicate arithmetic formalizations already present.",
"first_step": {
"command": [
"python3",
"-B",
"scripts/research_selected_baseline.py"
],
"expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY",
"inspect": "Resolve the current selected review, separate complex/ordinary BIT/admitted BIT/outer budgets, and compare the card against live handoffs before starting. Historical ceilings require exact source/model equivalence.",
"scope": "Source-binding orientation only; not a scientific replay or all-size proof. Materialize selected inputs if this checkout is sparse."
},
"first_experiment": "Write one missing statement with quantified hypotheses, actual caller and existing coverage. A compact-switch lemma is a candidate only after its mathematical contract is reviewed. Establish a bounded proof plan before a separately budgeted proof-assistant build; do not rerun large Lean jobs as orientation.",
"bottleneck_link": "A missing interface proof can reduce the conditional gap even if it does not change kappa.",
"allowed_variations": [
"Narrow to one formal lemma or one theorem-to-certificate binding."
],
"scope_change_triggers": [
"Formalizing already-covered arithmetic and claiming the full multiplication theorem."
],
"overlap_terms": [
"hyperplane end",
"formal interface",
"Lean binding",
"3807",
"3857",
"4100",
"gate-operand-parity-lean",
"staged544-certified-endpoint",
"unconditional-batched-crt"
],
"existing_checks": [
{
"scope": "PR #3807: scoped gate-operand parity formalization.",
"evidence": "research/gate-operand-parity-lean/README.md",
"remaining": "Exact theorem-to-caller binding and genuinely uncovered interface lemmas.",
"status": "author-checked",
"source_commit": "4c3530f42a6abcc48e7a6bcffd6c901911dc8269",
"selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129"
},
{
"scope": "PR #3857: certified real-power moment/endpoint arithmetic.",
"evidence": "research/staged544-certified-endpoint/README.md",
"remaining": "Uniform algorithmic implications, not another endpoint digit.",
"status": "author-checked",
"source_commit": "ef4315b8caa605e47a2515004845eb2d2ed71a86",
"selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129"
},
{
"scope": "PR #4100: compact-switch formalization proposed as future validation.",
"evidence": "research/unconditional-batched-crt/README.md",
"remaining": "Audit the statement and assumptions before a formal proof campaign.",
"status": "author-checked",
"source_commit": "337d04939571a637aeab54a0f58f54fde811663a",
"selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129"
}
]
},
"scope_status": "changed",
"actual_scope": "Exact characteristic polynomial of A_3 on the 44-dimensional (+1,+1) joint space in weight-3 character 7.",
"scope_change_reason": "Open next question 2 of PR7062 specifies a finite polynomial on a historical doubled centre block.",
"bottleneck_link": "Algebraic side result about the historical centre decoder. There is no new caller or recursive invoice.",
"budget_minutes": 60,
"stop_rule": "Stop after verifying the polynomial on the named joint space.",
"outcome": "completed",
"evidence": "44 signed orbit vectors with support 8 each, 180224 exact ambient coefficient comparisons, the monic degree-44 polynomial, and a rejecting sector-1 substitution.",
"author": "Nick Petalas",
"ai_assistance": "Independent human and formal proof-kernel review are unclaimed.",
"open_questions": [
{
"question": "Does a signed coordinate symmetry transport the 44-dimensional block to each other weight-3 (+1,+1) block?",
"why_it_matters": "An intertwiner would transfer the polynomial without a new determinant.",
"first_step": "Test the stabilizer action on character 7 and on the two joint involutions.",
"blocked_by": "The current certificate imposes only character 7."
}
],
"predecessors": [
{
"pr": 7062,
"head": "d2d59844d7a1f3f739d7add8eeec0d740a3aeca8",
"role": "Open next question 2 and the adjacent 12-dimensional computation."
},
{
"pr": 6965,
"head": "8647094c8c6a65bc6d0211e4a16f1a1c69ce0b07",
"role": "Sign-character and joint-space definitions."
}
]
}
36 changes: 36 additions & 0 deletions research/c3-weight3-plus-plus-charpoly/VERIFY.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
{
"schema_version": 1,
"status": "ready",
"python": "3.12",
"requirements": [],
"inputs": [
"research/centre-polynomial-cache-limits/frozen/work/centre-encoding-campaign-20261014/lanes/circuit-interface/INTERFACE.json"
],
"commands": [
{
"argv": [
"{python}",
"-I",
"-W",
"error",
"-B",
"{package}/verify.py"
],
"timeout_seconds": 60,
"checks": "Rebuild the 44-dimensional block and exact characteristic polynomial, then reject substitution of sector 1."
},
{
"argv": [
"{python}",
"-I",
"-O",
"-W",
"error",
"-B",
"{package}/verify.py"
],
"timeout_seconds": 60,
"checks": "Rebuild the 44-dimensional block and exact characteristic polynomial, then reject substitution of sector 1."
}
]
}
Loading