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
125 changes: 125 additions & 0 deletions research/gaussian-exact-sum-forward-slack/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,125 @@
# Forward radial slack for exact-sum Gaussian rounding

Any injective rounding of the ideal Gaussian pair that preserves the sum
and has Euclidean error at most one must have forward outward norm slack at
least $\sqrt5-\sqrt3$. Eight inputs in the sum-one fiber suffice. Below
that threshold they have six distinct legal outputs. At equality they have
an explicit matching, so the bound is sharp on these eight inputs.

This is a scoped proof with an exact finite witness. It gives a necessary
bound on the whole Gaussian-integer domain for the exact-sum contract.
Global attainment remains open. The proof uses injectivity, exact sum and
the error cap. It applies to maps with arbitrary behavior outside the eight
inputs and makes no assumption about the inverse or powers of the map.

## Proof

Let $x,y\in\mathbb Z[i]$, $s=x+y$, and $d=x-y$. The ideal positive
Gaussian pair is
$$
C_+(x,y)=((s+id)/2,(s-id)/2).
$$
The norm on a pair is $\|(x,y)\|=\sqrt{|x|^2+|y|^2}$. Its forward
outward slack under a map $F$ is
$\sup_z\max(0,\|F(z)\|-\|z\|)$.

Restrict to $s=1$. Write $x=a+ib$, so $y=1-x$, and let
$$
N(a,b)=a^2+(1-a)^2+2b^2.
$$
This is the squared pair norm. The first ideal output has coordinates
$(1/2-b,a-1/2)$. An exact-sum output is determined by its first
coordinate $c+ie$. Its squared pair error is twice the squared
distance from $c+ie$ to the first ideal output. Each real coordinate
of that ideal output is a half-integer. Thus error at most one holds
exactly at the four candidates
$$
(c,e)\in\{-b,1-b\}\times\{a-1,a\}.
$$
Every candidate has error exactly one.

The following table exhausts $N(a,b)\le5$. The output column lists the
possible squared norms before imposing a radial bound.

| Input squared norm | First input coordinates | Inputs | Output squared norms |
| ---: | --- | ---: | --- |
| 1 | $a\in\{0,1\}, b=0$ | 2 | $1,3$ |
| 3 | $a\in\{0,1\}, b\in\{-1,1\}$ | 4 | $1,3,5,7$ |
| 5 | $a\in\{-1,2\}, b=0$ | 2 | $3,9$ |

Set $\alpha=\sqrt5-\sqrt3$. Below $\alpha$, a norm-one input
cannot reach squared norm 3 because $\sqrt3-1>\alpha$.
An input of squared norm 3 cannot reach 5 or 7, and an input of squared
norm 5 cannot reach 9 because $3-\sqrt5>\alpha$. To see the two strict
inequalities, square the equivalent positive comparisons
$2\sqrt3>1+\sqrt5$ and $3+\sqrt3>2\sqrt5$. They reduce to
$3>\sqrt5$ and $3\sqrt3>4$, respectively.

The union of all allowed outputs is contained in $N(c,e)\le3$. This set
has six points by the first two rows of the table. Eight inputs cannot
map injectively into six outputs. The matching below attains the threshold
on this finite domain. It lists the first input and first output
coordinates. In both cases the second Gaussian integer is one minus
the first.

| $(a,b)$ | $(c,e)$ |
| --- | --- |
| $(-1,0)$ | $(0,-1)$ |
| $(0,-1)$ | $(1,-1)$ |
| $(0,0)$ | $(0,0)$ |
| $(0,1)$ | $(-1,0)$ |
| $(1,-1)$ | $(2,0)$ |
| $(1,0)$ | $(1,0)$ |
| $(1,1)$ | $(0,1)$ |
| $(2,0)$ | $(1,1)$ |

The eight outputs are distinct and obey the candidate formula, with two
edges from squared norm 3 to 5 and the rest weakly inward. Hence
$\alpha$ is also the exact optimum on this part of the sum-one fiber.

## Reproduce

Run from the repository root with CPython 3.12 and its standard library.

~~~sh
python3.12 -B scripts/research_package.py --package research/gaussian-exact-sum-forward-slack
python3.12 -B scripts/check_research_commit.py --package research/gaussian-exact-sum-forward-slack --check-source-history
python3.12 -W error -B research/gaussian-exact-sum-forward-slack/verify.py
python3.12 -W error -O -B research/gaussian-exact-sum-forward-slack/verify.py
~~~

The verifier enumerates all eight inputs and checks the scaled error
directly in Gaussian-integer coordinates. The input scan covers
$-2\le a,b\le2$, which contains $N\le5$. Each possible first output
coordinate is within one of its half-integer center, so the output scan
over $[-3,3]^2$ includes every error-one candidate. All 32 edges have
error one. The verifier finds 16 strict edges to six distinct outputs and
four threshold ties. It checks every edge of the displayed matching and
uses integer comparisons to isolate the strict and tied cases. The
expected status is PASS_GAUSSIAN_EXACT_SUM_FORWARD_SLACK.

## Open next questions

Can an all-size exact-sum matching attain $\alpha$, or does a different
finite set in the sum-one fiber force more? First test complete
neighborhoods beyond squared norm five at the exact threshold. A finite
matching is only a local positive control. The existing square-to-swap
construction gives a global upper bound $\sqrt{19}-\sqrt{13}$. A
physical caller contract would also need to specify the inverse,
ordered stages and implementation cost.
[#7570 proof](https://github.com/CubeJerry/integer-mult-bounds/blob/053c42c68165cf24fd4e8bc33c2b20d6ac3d399b/research/sharp-order-four-gaussian-rounding/proof/PROOF.md)

## Credit

This contribution was produced by Nick Petalas. Ali Romman's #6509 supplies
the ideal pair and exact-sum rounding contract. Jerry Chen's #7570 uses
fixed-sum fibers in the square-to-swap class and leaves the forward bound
without that identity open. His #7571 gives finite Hall bounds for the
larger class of maps with no sum constraint. His #7572 treats affine
periods and the bounded-center family. The argument here uses the sum-one
fiber and the displayed finite table. Independent human and formal
proof-kernel review are unclaimed. Apache-2.0.
[#6509](https://github.com/CrocSwap/integer-mult-bounds/pull/6509),
[#7570](https://github.com/CrocSwap/integer-mult-bounds/pull/7570),
[#7571](https://github.com/CrocSwap/integer-mult-bounds/pull/7571),
[#7572](https://github.com/CrocSwap/integer-mult-bounds/pull/7572)
24 changes: 24 additions & 0 deletions research/gaussian-exact-sum-forward-slack/SOURCES.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,24 @@
{
"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/conservative-gaussian-rounding/PROOF.md",
"usage": "input",
"git_blob": "b7047476aaa5e2bb149c92a8a40a9b2ab444ef73",
"sha256": "122eff335674d8de1bcba47d28feb0c420be62b2b6d4e84f91c4292383753380"
}
]
}
95 changes: 95 additions & 0 deletions research/gaussian-exact-sum-forward-slack/TASK.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,95 @@
{
"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": "Forward outward norm slack for injective exact-sum Gaussian-pair rounding with error at most one.",
"scope_change_reason": "PR #7570 leaves the exact-sum forward bound without the square identity open. This is a standalone precision lemma, outside actual-caller formalization.",
"bottleneck_link": "Exact-sum precision is one candidate contract for a native Gaussian pair. This result prices a necessary outward norm allowance at that boundary. Caller use and the selected supplier budget are outside its scope.",
"budget_minutes": 60,
"stop_rule": "Stop at the first exact finite witness that supplies a new necessary bound.",
"outcome": "completed",
"evidence": "README.md proves the obstruction. The normal and optimized verifiers check all 32 error-one edges, six distinct strict neighbors, four exact threshold ties and the eight-edge attaining finite matching.",
"author": "Nick Petalas",
"ai_assistance": "Independent human and formal proof-kernel review are unclaimed.",
"open_questions": [
{
"question": "Is sqrt(5)-sqrt(3) attainable by a global exact-sum map?",
"why_it_matters": "Attainment would identify the smallest forward norm allowance for this precision contract.",
"first_step": "Check complete neighborhoods in the sum-one fiber at the exact threshold beyond squared norm five.",
"blocked_by": "The finite matching gives only a local construction. The available global upper bound has a stronger square identity."
}
]
}
34 changes: 34 additions & 0 deletions research/gaussian-exact-sum-forward-slack/VERIFY.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,34 @@
{
"schema_version": 1,
"status": "ready",
"python": "3.12",
"requirements": [],
"inputs": [
"research/conservative-gaussian-rounding/PROOF.md"
],
"commands": [
{
"argv": [
"{python}",
"-W",
"error",
"-B",
"{package}/verify.py"
],
"timeout_seconds": 30,
"checks": "Complete sum-one error edges, strict Hall deficit and exact-threshold matching."
},
{
"argv": [
"{python}",
"-W",
"error",
"-O",
"-B",
"{package}/verify.py"
],
"timeout_seconds": 30,
"checks": "Complete sum-one error edges, strict Hall deficit and exact-threshold matching."
}
]
}
82 changes: 82 additions & 0 deletions research/gaussian-exact-sum-forward-slack/verify.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,82 @@
#!/usr/bin/env python3
"""Check the complete sum-one witness using integer error and norm arithmetic."""

from collections import Counter
from itertools import product
import json


def require(condition: bool, message: str) -> None:
if not condition:
raise ValueError(message)


def norm_squared(first: tuple[int, int]) -> int:
real, imag = first
return real**2 + (1 - real)**2 + 2 * imag**2


def twice_error_squared(first: tuple[int, int], output: tuple[int, int]) -> int:
real, imag = first
out_real, out_imag = output
return (2 * out_real - (1 - 2 * imag))**2 + (2 * out_imag - (2 * real - 1))**2


def jump_at_most(before: int, after: int, numerator: int, denominator: int) -> bool:
"""Compare sqrt(after) - sqrt(before) to numerator/denominator."""
remainder = (after - before) * denominator**2 - numerator**2
return remainder <= 0 or remainder**2 <= 4 * numerator**2 * denominator**2 * before


def verify() -> dict[str, int | str]:
require(not jump_at_most(3, 5, 1, 2), "threshold must exceed 1/2")
require(jump_at_most(3, 5, 51, 100), "threshold must be at most 51/100")

expected_shells = {1: {1: 2, 3: 2}, 3: {1: 1, 3: 1, 5: 1, 7: 1}, 5: {3: 2, 9: 2}}
inputs = [first for first in product(range(-2, 3), repeat=2) if norm_squared(first) <= 5]
require(Counter(map(norm_squared, inputs)) == {1: 2, 3: 4, 5: 2}, "input shells")
strict_edges = set()
tied_edges = set()
total_edges = 0
output_box = tuple(product(range(-3, 4), repeat=2))
for first in inputs:
before = norm_squared(first)
outputs = Counter()
for output in output_box:
error = twice_error_squared(first, output)
if error > 2:
continue
require(error == 2, f"unexpected sub-unit error for {first}, {output}")
after = norm_squared(output)
outputs[after] += 1
if after <= before:
strict_edges.add((first, output))
elif (before, after) == (3, 5):
tied_edges.add((first, output))
else:
require(not jump_at_most(before, after, 51, 100), f"unclassified edge {first}, {output}")
require(outputs == expected_shells[before], f"output shells for {first}")
total_edges += outputs.total()

strict_neighbors = {output for _, output in strict_edges}
require(len(strict_neighbors) == 6 < len(inputs), "strict Hall deficit")
require((total_edges, len(strict_edges), len(tied_edges)) == (32, 16, 4), "edge counts")

matching = ((0, -1), (1, -1), (0, 0), (-1, 0), (2, 0), (1, 0), (0, 1), (1, 1))
require(len(set(matching)) == len(inputs), "matching must be injective")
matching_edges = set(zip(inputs, matching, strict=True))
require(matching_edges <= strict_edges | tied_edges, "matching contains a forbidden edge")
require(len(matching_edges & tied_edges) == 2, "two exact threshold edges")
return {
"status": "PASS_GAUSSIAN_EXACT_SUM_FORWARD_SLACK",
"inputs": len(inputs),
"error_one_edges": total_edges,
"strict_edges": len(strict_edges),
"strict_neighbors": len(strict_neighbors),
"threshold_edges": len(tied_edges),
"matching_edges": len(matching_edges),
}


if __name__ == "__main__":
print(json.dumps(verify(), sort_keys=True))
Loading