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
133 changes: 133 additions & 0 deletions research/bit-causal-multi-delivery/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,133 @@
# A two-delivery price floor for the selected BIT word

Every original paid arrival of the selected PR7001 BIT word costs at least
its original rank tariff if replaced by at most two direct nested deliveries
from fixed, strictly earlier chart libraries. This holds in both orientations
for prices `s^t` with `0 < t <= 1`, even with free retention and free scalar
XOR at the destination. The original single transfer attains the floor.
The claim is a scoped proof backed by exhaustive finite replay. No new κ follows.

## Boundary and proof

Keep all 659 public inputs independent. For each original paid MOVE, write
`d` for its destination chart, `c` for its zero-based event index in the
chosen orientation, `r` for its rank, and `f` for its required normalized
binary row. For each chart `b`, let `V_b` span its public entrance rows
and its original paid arrivals at event indices strictly less than `c`.
The library permits these rows to be retained for free. Each direct delivery
to `d` contributes one row in `V_b` and pays rank
`s_b = |dim(b) - dim(d)|`. Its chart pair must be nested as rational
subspaces. The destination can add any row of `V_d` for free.

The row semantics and fixed libraries are those of Ali Romman's single-delivery
result. An entrance contributes its independent basis row. INIT provides zero,
cocharted ADD adds rows over F₂, SWAP preserves the chart attached to each row,
and CLEAR retires a row. A MOVE carries the normalized row to its destination.
The transpose reverses the event order and the MOVE direction, exchanges INIT
with CLEAR, and transposes the ADD. Thus the entrance rows and strictly earlier
arrivals suffice for the library at every tested event. [PR #7723](https://github.com/CrocSwap/integer-mult-bounds/pull/7723)

A bundle with donor set `S` can supply `f` exactly when
`f ∈ V_d + Σ_{b∈S} V_b`. The forward implication follows by adding the
received rows. For the reverse implication, take one component per chart
from a span decomposition and include its destination component. Two
contributions from one chart combine into one row. A donor with zero
library contributes zero.

For a bundle with positive ranks `s_i` and total rank `R > 0`,
`Σ s_i^t = R^t Σ (s_i/R)^t ≥ R^t` for `0 < t <= 1`.
A strictly cheaper bundle must therefore have `R < r`. In particular, it
can use only individually lower-rank donors. If the row is outside the sum
of **all** these donor libraries and the destination library, every
strictly cheaper direct bundle is excluded, regardless of its size.

For the cases where that sum contains the row, the verifier works in the
quotient by `V_d`. It tests every nonempty eligible singleton and every
distinct eligible pair with rank sum below `r`. The free destination
by itself is also checked. Empty libraries and repeated donors reduce to
these cases. In each test the projected row is outside the projected
donor span. Any bundle with rank sum at least `r` is already covered by the
price inequality. The original source row at the same deadline attains the
old price by the cited single-delivery result.

## Finite evidence

| Orientation | Arrivals | Excluded by the sum of all lower-rank donors | Exceptional singletons checked | Exceptional pairs checked |
| --- | ---: | ---: | ---: | ---: |
| Forward | 2,871 | 2,862 | 4,626 | 478,764 |
| Transpose | 2,871 | 2,871 | 0 | 0 |

The nine exceptions are forward rank-seven arrivals into chart 0 from
charts 510 through 518, at every eighth event from 26861 through 26925.
Their full lower-rank donor sums contain the required rows. Each sum grants every eligible donor
simultaneously, with no total-rank constraint. The quotient check
enforces the rank-sum constraint for one or two paid donors.

The replay authenticates the compressed native word, reconstructs the
chronological scalar rows, and computes rational nesting from the
chart bases and their orthogonal complements. For each arrival it
tests the donor span before adding that arrival to its destination
library. Its small control gives two donors that can reconstruct a
row together even though neither can do so alone. It also checks that
an equal-rank-sum pair is omitted from the strict budget test.

## Scope

The result covers fixed causal stocks and direct transfers of scalar XOR
forms into one original destination by its old deadline. The nine remaining
arrivals can still be tested with three or more positive-rank donors.
New charts, intermediate relays, changed helper relations, altered values
and deadlines, and adaptive changes to the libraries are outside the
contract. Storage and ordinary formation are granted, so the price floor
also holds for subclasses that charge nonnegative costs for them.

Productive targets and the remaining caller terms are kept fixed. Replacing
a paid term within this contract cannot improve its signed margin. The
selected frontier and its five assumptions remain as recorded. Physical
compiler delivery, storage and restoration, tape movement, analytic recovery,
the selected cold replay, Lean and Docker were outside this proof.

This changes the scope of `bit-helper-contract` to a paid-path relaxation of
the selected BIT supplier. [Task](TASK.json) · [Source pins](SOURCES.json)

## Reproduce

Use CPython 3.12.15 and its standard library from the repository root.

```sh
python3.12 -B -W error -X dev research/bit-causal-multi-delivery/verify.py
python3.12 -B -W error -X dev -O research/bit-causal-multi-delivery/verify.py
python3.12 -B scripts/research_package.py --package research/bit-causal-multi-delivery
python3.12 -B scripts/check_research_commit.py --package research/bit-causal-multi-delivery --check-source-history
```

Both direct modes produce this marker.

```text
PASS_BIT_CAUSAL_MULTI_DELIVERY arrivals=5742 union_excluded=5733 exceptional_singles=4626 exceptional_pairs=478764
```

In a sparse checkout, materialize this package and `research/paired-query-only-bit`.
The direct checker needs the one [pinned native word](SOURCES.json), with no
Git or network calls. The publication preflight requires full Git history.

## Open next questions

- For the nine exceptions, can three or more direct deliveries beat the rank-seven
tariff? Start with the quotient at forward event 26861 and seek a donor subset
with total rank at most six. The full donor sum gives no such subset or price.
- Could a relay create a lower-cost arrival under a changed causal library?
Start with one exact intermediate chart and give its entry, delivery and
restoration costs. The fixed-library proof grants no relay information.

## Credit

This contribution was produced by Nick Petalas. Ali Romman supplied the
fixed-library model, its single-delivery floor and the multi-delivery
question in [PR #7723](https://github.com/aliromman/integer-mult-bounds/blob/a4fd22c08058c0fef830306b2d46e4a51f091939/research/bit-causal-delivery-rank-obstruction/README.md).
Jerry Chen / CubeJerry supplied the selected [PR #7001](https://github.com/CrocSwap/integer-mult-bounds/pull/7001)
caller. Credit zxv and the retained native authors for the exact word,
DreamingOfClouds for the chain-root caller, and ToikY for the related
fixed-destination and retag bounds. The original source notices remain
with the pinned input. New material is Apache-2.0. Independent human
and formal proof-kernel review are unclaimed.
24 changes: 24 additions & 0 deletions research/bit-causal-multi-delivery/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/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz",
"usage": "input",
"git_blob": "b718d6b2848215ad785022106dfa9f871a3d1c0c",
"sha256": "51203e7fc75ba10bd3ac3f8e675759f47e13d262bea66b6600d1e515095cad78"
}
]
}
83 changes: 83 additions & 0 deletions research/bit-causal-multi-delivery/TASK.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,83 @@
{
"schema_version": 1,
"task_id": "bit-helper-contract",
"priority_revision": 8,
"base_commit": "e54523517d0f03e58352e647c403a5af3e525a57",
"original_card": {
"id": "bit-helper-contract",
"question": "Can a changed G20 helper path or independent-target split improve the complete BIT moment without losing its physical endpoint?",
"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",
"research/g20-helper-split/README.md",
"research/g20-conjugation-admission/README.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 full boundary contract and paid profile; unchanged scalar counts alone are insufficient. A scoped local result may be retained without a complete supplier. Expanding it into further construction rounds requires the family-level budget and obligation gate in research-family-status.md; an optimistic passing relaxation alone is not acceptance.",
"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": "First read #5679/#5708 and their audits as pending component proposals. Choose one uncovered helper group/cut on an exact word; compare arbitrary-input native action, targets, owned storage, both orientations and full signed bill. Stop if the gain is only a scalar count or repaid by lost targets. Do not rerun the frozen #5609 common-frame domain without changing its hypothesis.",
"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": [
"G20",
"helper split",
"5679",
"5708",
"independent target"
],
"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": "Direct nested reconstruction of one original PR7001 BIT arrival using fixed strictly earlier scalar chart libraries, in both orientations.",
"scope_change_reason": "PR #7723 leaves multiple direct deliveries open. The relaxation fixes the word and all helper promises and permits destination XOR.",
"bottleneck_link": "Tests whether an original BIT paid term can be lowered by replacing one arrival with two direct transfers while preserving its value, chart, deadline and all independent inputs.",
"budget_minutes": 60,
"stop_rule": "Publish the first exact multi-delivery obstruction or a cheaper witness. Leave higher-arity exceptional bundles and physical realization to follow-up.",
"outcome": "negative-result",
"evidence": "5,733 of 5,742 arrivals are outside the span of all individually cheaper donor libraries plus the destination library. Among the other nine, all 4,626 rank-affordable single donors and 478,764 rank-affordable distinct pairs fail.",
"author": "Nick Petalas",
"ai_assistance": "Independent human and formal proof-kernel review are unclaimed.",
"open_questions": [
{
"question": "Can at least three direct deliveries beat rank seven at any of the nine exceptions?",
"why_it_matters": "The union span contains the arrival, but the donor combination could exceed the old price.",
"first_step": "At forward event 26861, search the quotient by the destination library for a donor subset with total rank at most six.",
"blocked_by": "The exact replay only enumerates singletons and pairs in the exceptional quotient."
},
{
"question": "Can an intermediate relay lower the price with a changed causal library?",
"why_it_matters": "A relay could introduce information absent from the fixed direct donor libraries.",
"first_step": "Specify one intermediate chart and price its entry, delivery and restoration.",
"blocked_by": "No source-compatible physical relay and complete bill have been supplied."
}
]
}
38 changes: 38 additions & 0 deletions research/bit-causal-multi-delivery/VERIFY.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,38 @@
{
"schema_version": 1,
"status": "ready",
"python": "3.12",
"requirements": [],
"inputs": [
"research/paired-query-only-bit/retained/inputs/BIT-NATIVE-WORD.json.gz"
],
"commands": [
{
"argv": [
"{python}",
"-B",
"-W",
"error",
"-X",
"dev",
"{package}/verify.py"
],
"timeout_seconds": 60,
"checks": "Authenticate the BIT word and exhaust the direct-delivery spans in both orientations, including every affordable exceptional singleton and pair and the span and tariff controls."
},
{
"argv": [
"{python}",
"-B",
"-W",
"error",
"-X",
"dev",
"-O",
"{package}/verify.py"
],
"timeout_seconds": 60,
"checks": "Authenticate the BIT word and exhaust the direct-delivery spans in both orientations, including every affordable exceptional singleton and pair and the span and tariff controls."
}
]
}
Loading