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
45 changes: 45 additions & 0 deletions research/p104-receiver-relay/PROOF.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,45 @@
# Ten minimal-grade cooperative repairs

## Frozen communication model

Use the 1,289-coordinate rational word from #7786. Delete paid slots 95914 and 88, the original route from chart 278 to chart 288 to chart 127. Keep every other paid rule, its schedule, the 1,103 chart assignments, the initial atoms and the exterior terminal operators fixed. Slot 95914 has only one reader, slot 88. The only readers of 88 are terminals 155442 and 155490 at 127. Thus every surviving paid deposit is the same function of the public input as before. Receiver 127 has no public atom or paid egress and retains 901 arrivals. We grant arbitrary local arithmetic and require exact terminal outputs. The only permitted senders and intermediate nodes are original chart labels. The inputs, coefficients, destinations and values of surviving paid rows stay fixed; new information can leave a chart only over a replacement message or the granted equal-span sharing. The paid comparison freezes the productive ledger and charges only the replacement communication. [Incumbent word](https://github.com/CrocSwap/integer-mult-bounds/tree/89a67c404226d51028e135de2b9169e9020d57af/research/p104-iterated-returns/continuation) · [Predecessor cut](https://github.com/CrocSwap/integer-mult-bounds/blob/864d15105ceb2f7a5cdbc6bedc72a9bc273d5e8e/research/p104-receiver-single-send/PROOF.md)

A chart's frame spans a binary subspace of the nine-dimensional ambient space. Each new paid send joins nested spans in either direction and has integer grade equal to the absolute difference of their dimensions. We even allow unrestricted sharing between labels with the same span. A fixed chronological protocol may add any finite number of sends, with arbitrary deterministic payloads depending on local stock and earlier arrivals. The lower bound gives each chart every surviving deposit it ever receives in the frozen word; the improved access can only help the protocol. Local choices cannot signal to other charts without communication. The constructive programs use only chronological rational-linear forms. [Predecessor chart-comparability and pricing check](https://github.com/CrocSwap/integer-mult-bounds/blob/0893abefcc894991b67b2315f7e85e0dc4d58c5e/research/p104-paid88-stock-cones/cones/portable.py)

## Information must travel seven grades

For a public input, call a chart live when its frozen local stock differs from its stock at zero. Quotient all equal-span labels into free communication classes. There is only one nonsingleton class, labels 1091 and 1092, and neither label is live on any of the four tests. The original terminal 155442 is one on every test and zero at the origin. Here are the only nonzero public coordinates of each test.

| Test | Input | Live charts | Use |
|---|---|---:|---|
| A | $x_{674}=x_{722}=1$ | 3 | Exactly 11, 58 and 278, of ranks 1, 1 and 2 |
| B | $x_{722}=1, x_{780}=-1$ | 293 | Chart 11 is silent |
| C | $x_{674}=1, x_{825}=-1$ | 295 | Chart 58 is silent |
| D | $x_{674}=x_{722}=1, x_{1288}=-1/845660160$ | 26 | Only 288 is live between the spans of 278 and 127, inclusive |

The underlying test inputs appeared in #7807; test D originates in #7795. We recompute their observations on the immutable word and independently intersect the live set with the span interval. All 901 receiver deposits vanish on each test. [Four-column and interval check](check_paths.py) · [Origin of D](https://github.com/CrocSwap/integer-mult-bounds/blob/0893abefcc894991b67b2315f7e85e0dc4d58c5e/research/p104-paid88-stock-cones/STOCK.md)

On each test there must be a chronological path from some live class to 127. Otherwise, induction over the transmissions shows that every datum reaching the receiver agrees with its value on zero. Even one paid send is impossible: its sending class must be live on all four tests, and their intersection is empty. Let $G$ be the sum of the grades of all new sends. The path forced by A starts at rank at most two and ends at rank nine. The triangle inequality for the rank differences gives $G\ge7$.

If $G=7$, its source must be chart 278. Every positive send belongs to this path, every rank step increases and every participating span lies in the closed interval from 278 to 127. In particular, other incoming branches, duplications and reverse sends each force a larger total grade. On D the path must pick up information in the same interval. The computed intersection forces chart 288. Below 288 the only possible strict intermediate chart above 278 is 561, of rank three. Above 288 and below 127 the only possibilities are 239, 267, 477 and 1100, all of rank eight, with distinct spans. Thus a minimal-grade path uses 561 optionally before 288 and at most one of the four upper charts afterwards. There are exactly ten paths.

For a receiver that directs successive sends using only its own transcript, the same lower bound applies to the zero-input branch and hence to the worst case. Until the receiver first distinguishes a test, it makes the same requests and broadcasts the same transcript as on zero. A differing arrival must therefore have a chronological paid path from a live class in this common prefix. Apply that observation to each test on the zero-input branch. The ten-path classification refers to a fixed successful topology or to such a branch when its total grade equals seven.

## Realizing every path

Take either original send $a\to b$. To insert chart $m$, transmit the exact original payload from $a$ to $m$ immediately before its old slot, and forward that one scalar from $m$ to $b$ at the old slot. The strict containments above give legal nested routes. Every original rule sees its original inputs at its original position. The substitutions on the two original legs can be chosen independently. Each path therefore determines a chronological word with the full original operator. The replay builds all ten words, checks source ownership and chronology at every instruction, contracts inserted copies and compares every original rule, then independently expands the two affected terminal rows in the 1,289 coordinates. A sign error on the lower subdivision changes the protected output. [Constructive operator check](check_operators.py)

## Target price and separation

Write $p(d)=d^{1-\kappa}$ with the enrolled $\kappa=0.00387981257853$. Any nonnegative increasing concave tariff with $p(0)=0$ orders the four grade-seven classes weakly in the table's order. The two optional subdivisions add $2p(1)-p(2)$ and $p(4)+p(1)-p(5)$ respectively. Concavity makes the former nonnegative and at most the latter. At the enrolled exponent both inequalities are strict. Across 48 rational calls, each printed decimal below is a strict lower endpoint with enclosure width $10^{-24}$, except for the exact zero.

| Grade sequence | Distinct routes | Additional paid cost against incumbent |
|---|---:|---:|
| 2, 5 | 1 | 0 |
| 1, 1, 5 | 1 | 0.257824154185337662623932 |
| 2, 4, 1 | 4 | 0.464055177013712144726725 |
| 1, 1, 4, 1 | 4 | 0.721879331199049807350658 |

All other successful positive-send topologies have $G\ge8$ and at least two positive grades. Their cost is at least $p(7)+p(1)$. If a grade is already seven or larger, a second positive grade proves this. Otherwise trim the integer grades to a sum of eight, then transfer units from smaller to larger entries until they reach seven and one. Increasingness allows trimming and concavity makes each concentration nonincreasing in cost. At the target, $48[p(7)+p(1)-p(2)-p(5)]$ lies in $47.224621260611063462113308+(0,10^{-24})$. We use this as a lower bound on the outside class, without claiming attainment. It strictly separates every other topology from all ten. [Rational tariff enclosure](check_prices.py) · [Enrolled target](https://github.com/CrocSwap/integer-mult-bounds/blob/0893abefcc894991b67b2315f7e85e0dc4d58c5e/research/p104-paid88-stock-cones/cones/SOURCE.json)

More generally the same strict separation holds whenever $p(7)+p(1)>p(4)+3p(1)$. At the enrolled tariff the incumbent is the unique optimal positive topology after free sharing is contracted. The four-return invoice needs a positive saving even before any local costs of a recoding are charged. This complete frozen-cut comparison yields zero best saving and leaves repairs that alter the surviving paid operators, frames or productive terms open.
31 changes: 31 additions & 0 deletions research/p104-receiver-relay/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
# All minimum-grade cooperative repairs of P104 receiver 127

On the rational word of #7786, delete transfers 95914 and 88 and let the 1,103 original charts exchange any finite number of new nested-span messages to restore receiver 127. Keep the surviving paid rules, chart assignments and exterior terminals fixed. **Every successful repair spends at least seven total grades. Exactly ten positive-transfer topologies attain seven, and the incumbent is the unique cheapest at the enrolled target.** The result allows arbitrary deterministic local encodings. All ten attaining paths also work as exact chronological rational-linear programs. [Proof, scope and tariff table](PROOF.md)

Every seven-grade path must run from 278 through 288 to 127. It may pass through 561 before 288 and through one of 239, 267, 477 or 1100 after 288. The unique runner-up, through 561 alone, adds **0.257824154185337662623932…** signed units across the 48 rational calls. Even the most expensive of the ten adds less than 0.722. Every other positive-transfer topology adds more than **47.224621260611063462113308** units. The best saving from rerouting this frozen cut is exactly zero. The selected multiplication bound is unchanged. [Exact price verification](check_prices.py)

The direct-send optimization in #7807 allowed communication only into the receiver. Here relay charts may pool old stock, exchange new messages and forward the result. The proof contracts equal-span labels, traces a necessary information path, identifies a second independently necessary waypoint, and exhausts its two intervals in the actual atlas. Equality constructions preserve the complete 1,289-coordinate operator. [Earlier direct-only result](https://github.com/CrocSwap/integer-mult-bounds/pull/7807) · [Coordination thread](https://github.com/CrocSwap/integer-mult-bounds/discussions/7111#discussioncomment-19755743) · [Source pins](SOURCE-PINS.json)

## Reproduce

From the repository root, run the registered package with standard-library CPython 3.12.

~~~sh
python3.12 -B scripts/research_package.py --package research/p104-receiver-relay
~~~

The three standalone checks below also work from a read-only export without Git or network access.

~~~sh
python3.12 -IB check_paths.py
python3.12 -IB check_operators.py
python3.12 -IB check_prices.py
~~~

## Open next questions

Can an edit to an existing ingress at chart 278 or 288 eliminate the mandatory waypoint? A concrete first test is to identify a surviving ingress whose recoded payload is nonzero on witness D at chart 278 while preserving the 901 old receiver deposits and all exterior terminals. Such a modification changes the frozen-stock hypothesis. Its altered bill, propagation to later readers, restoration costs and productive credits would all need to be checked against the signed target. [Earlier six-pair constraints](https://github.com/CrocSwap/integer-mult-bounds/pull/7795)

## Credit

Clear1nsight supplied the four-return word in #7786 and the first three-coordinate separating input in #7795, building on the signed P104 framework from Ali Romman and predecessors credited in the original notices. The other inputs, source reader and frozen direct-cut calculation come from apoursh's #7807. The cooperative path classification, constructive subdivisions and signed separation were prepared by apoursh with substantial OpenAI Codex assistance under Apache-2.0. [Retained original notice](retained/PR7786-NOTICE) · [Predecessor notice](retained/PR7795-NOTICE) · [License](retained/LICENSE)
58 changes: 58 additions & 0 deletions research/p104-receiver-relay/SOURCE-PINS.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,58 @@
{
"artifacts": [
{
"local": "retained/WORD.json.gz",
"source": 7786,
"head": "89a67c404226d51028e135de2b9169e9020d57af",
"original_path": "research/p104-iterated-returns/continuation/WORD.json.gz",
"bytes": 614180,
"git_blob": "337a9d4f8b36f3bd4acc5651810e4e846e287435",
"sha256": "fde0f7eaa3749d0934a9fc0d6320074f021cd722ed6753f3a59a62fb5b221949",
"uncompressed_sha256": "c447b6d5ba956fbe40834fe3c1bc69af2f225736f1b97ecd84b57bab9dd283cb"
},
{
"local": "retained/PR7795-NOTICE",
"source": 7795,
"head": "0893abefcc894991b67b2315f7e85e0dc4d58c5e",
"original_path": "research/p104-paid88-stock-cones/NOTICE",
"bytes": 1432,
"git_blob": "6cbfdc843fd7cd3227c7bd7925c891499d93098d",
"sha256": "8df09db925c14a4ec17e578455dd68b72714e15990cee40936212ce7408132cc"
},
{
"local": "word.py",
"source": 7807,
"head": "864d15105ceb2f7a5cdbc6bedc72a9bc273d5e8e",
"original_path": "research/p104-receiver-single-send/word.py",
"bytes": 1769,
"git_blob": "c42aa2db122c612f08e7f559ff02cc5b6d4f0844",
"sha256": "6d0af9a2699a34d6df36b20cd24d441b1c6cc0645483bbc0affec8aacc6b0e28"
},
{
"local": "retained/PR7786-NOTICE",
"source": 7807,
"head": "864d15105ceb2f7a5cdbc6bedc72a9bc273d5e8e",
"original_path": "research/p104-receiver-single-send/retained/PR7786-NOTICE",
"bytes": 1048,
"git_blob": "3b083891bf59f449b49df024ab7df3feaf6054b8",
"sha256": "4f7d16a4dcaae02de7e7583f7fbb14d5edd19dc4c10b4f47571c145204505844"
},
{
"local": "retained/LICENSE",
"source": 7807,
"head": "864d15105ceb2f7a5cdbc6bedc72a9bc273d5e8e",
"original_path": "research/p104-receiver-single-send/retained/LICENSE",
"bytes": 11357,
"git_blob": "261eeb9e9f8b2b4b0d119366dda99c6fd7d35c64",
"sha256": "c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4"
}
],
"tariff": {
"pr": 7795,
"head": "0893abefcc894991b67b2315f7e85e0dc4d58c5e",
"path": "research/p104-paid88-stock-cones/cones/SOURCE.json",
"git_blob": "c0da8ca07dc256f47a980e5ad1a969f7616ab08a",
"sha256": "f5087c4d8aa394049eb0ab08adace0d295009306900f29e9db1a07706a10fba2",
"use": "Tariff and incumbent price context. The replay computes its own rational intervals."
}
}
41 changes: 41 additions & 0 deletions research/p104-receiver-relay/SOURCES.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,41 @@
{
"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"
}
],
"cited_research": [
{
"pr": 7786,
"head": "89a67c404226d51028e135de2b9169e9020d57af",
"author": "Clear1nsight",
"title": "Conditional κ ≥ 0.00387944011068 from four additional rational returns",
"url": "https://github.com/CrocSwap/integer-mult-bounds/pull/7786"
},
{
"pr": 7795,
"head": "0893abefcc894991b67b2315f7e85e0dc4d58c5e",
"author": "Clear1nsight",
"title": "Bound six paid-slot repairs and 73 linked chart cones on #7786",
"url": "https://github.com/CrocSwap/integer-mult-bounds/pull/7795"
},
{
"pr": 7807,
"head": "864d15105ceb2f7a5cdbc6bedc72a9bc273d5e8e",
"author": "apoursh",
"title": "Prove the exact all-chart direct replacement cost of P104 paid slot 88",
"url": "https://github.com/CrocSwap/integer-mult-bounds/pull/7807"
}
]
}
Loading
Loading