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
1 change: 1 addition & 0 deletions research/p104-four-couriers-on7613/EXPECTED.json
Original file line number Diff line number Diff line change
@@ -0,0 +1 @@
{"kappa_prefix": "0.0036545537006038"}
19 changes: 19 additions & 0 deletions research/p104-four-couriers-on7613/NOTICE
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
Apache-2.0. DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code.

data/base-7613-word.json.gz and data/invoice-7613.json are the unmodified
word.json.gz and invoice-new.json of research/p104-contact902-1091-on7612 at
#7613 (ours), vendored as data only. #7613 builds on Clear1nsight's #7612
(prepared with OpenAI Codex / ChatGPT assistance; Apache-2.0), which builds on
our #7611 and #7608 (aliromman's #7605 with one edit); beneath them are
FanPUYen's #7604, SYLforge's #7603, ToikY's #7546, our #7601 and #7542,
Clear1nsight's #7334 and #7314, Rohan Arun's signed #7113 caller and all
contributors named in those packages.

The courier (funded-return) move pattern is the crowd's: Clear1nsight's
#7244/#7274/#7314/#7334/#7481 funded-return chain and determinant-one
co-encoding, rohanarun's #7480 bypass and #7277, CubeJerry's #7577 ceiling
analysis, and petalas's #7326. This package only applies that pattern to four
further (transit, courier) pairs.

check.py adapts the replay checks of our #7613 package; it imports no other
package and none of the other PRs' code was run.
103 changes: 103 additions & 0 deletions research/p104-four-couriers-on7613/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,103 @@
# CONDITIONAL κ = 0.00365455370060 — four courier (funded-return) moves on #7613 (premise: the inherited CLEAR #44 content)

**κ = 0.003654553700603812…, ×1.00040975 (+0.040975%) over
[#7613](https://github.com/CrocSwap/integer-mult-bounds/pull/7613)** (κ 0.00365305686569).
The official `evaluate_recursive_power` bracket (256 bits) is
[0.0036545537006, 0.0036545537007]; the claim 0.00365455370060 is below the exact crossing 0.00365455370060381.

> **Premise (inherited, nothing new).** Conditional on exactly the premise of
> #7608/#7612/#7613: owned CLEAR #44 (owned field 1557, chart 595) erases
> `{451:−1, 1495:1}` and `owned_erasure` must let a CLEAR discard that row.
> This word's CLEAR content is identical to #7613's at all 74 CLEARs. If that
> premise is refused, this word is void with #7613.

## The moves

The courier (funded-return) pattern is the crowd's, not ours: Clear1nsight's
#7244/#7274/#7314/#7334/#7481 funded-return chain with determinant-one
co-encoding, rohanarun's #7480 bypass (and #7277), CubeJerry's #7577 analysis
and petalas's #7326 (see [NOTICE](NOTICE)). This package applies it to four
further sibling pairs on #7613 (itself built on Clear1nsight's #7612).

In each move a transit register S drops a mid-chart visit (merging two hops).
A courier D, present with S at chart a, carries S's content through an
invertible shear re-basis, stops at S's next chart b, and the inverse shear
decodes there. Nothing is deleted; the pair (S, D) is only re-based.

| S / D | a | dropped by S | b | courier stop |
|---|---|---|---|---|
| 532 / 1464 | 3 | 744 | 746 | 1464 gains 746 |
| 1250 / 1464 | 3 | 744 | 746 | (shared with the first) |
| 226 / 990 | 719 | 907 | 127 | none (990 already stops at 127) |
| 7 / 779 | 743 | 922 | 245 | none (779 already stops at 245) |

The 226/990 move needs 226's MOVE 260→719 slid earlier, to just after its last
chart-260 op (event 33350), so that courier 990 is co-present at chart 719.

On #7613's word (76,666 events, unchanged in count; per native call ADD +3, MOVE −3):
three new public chart pairs, (3,746) (dimension 0→6), (719,127) (6→9) and
(743,245) (6→8), all strictly nested. Rows (all 1,569), end charts, header,
owned MOVEs (47), the 74 owned lifetimes, the peak (50) and the CLEARs equal
#7613's. [data/edits.json](data/edits.json) lists every event by #7613 index.

Coefficients: no non-dyadic event is added (5,901, as in #7613). All
coefficient denominators are 5-smooth and the word passes main's merged #7000
alphabet check; the common grid (odd denominator lcm 1125, 2-adic exponent 25,
40 numerator bits) is #7613's.

## Price

Native paid delta per call {1:−2, 3:−2, 4:−1, 6:+2}; over 17 calls:
- paid positions 110,247 → 110,196; productive 22,461; rank surplus S = 1,424 unchanged.

Official tools (`price.py`):
- `scripts/compare_recursive_invoices.py` against #7613: `uniformly_better`,
strictly negative for r^(1−C), paid {1:−34, 3:−34, 4:−17, 6:+34}, targets unchanged.
- `scripts/evaluate_recursive_power.py` (256 bits): `new_cost_lower` at
C = 0.0036545537006, 0.0036530568656 (#7613) and 0.0036527403112 (#7612);
`new_cost_higher` at C = 0.0036545537007.

Ordinary bound (17 calls) 778,647,060 < 10^9 (#7613: 778,697,380); precision
bit bounds unchanged (303 / 299 / 299). Strictification gate (run offline, not
in this package): γ 0.941095, δ 0.908152, both below 31/32.
An independent read-only audit found the word sound relative to #7613.

## Checks

```sh
python3.12 -B scripts/research_package.py --package research/p104-four-couriers-on7613
```

`check.py` (standard library) authenticates the vendored #7613 word, rebuilds
the new word from the edit list, replays both exactly over the rationals with
legality checks, requires every row, end chart, owned MOVE, lifetime and the
header to equal #7613's and all 74 CLEARs to erase #7613's content (CLEAR #44
asserted), checks that only registers 7, 226, 532, 1250, 1464 change
their MOVE chains (endpoints kept; S drops one chart, 1464 gains one stop),
locates the encode/decode shears and checks they are exact inverses in reverse
order around S's move, requires exactly the three new strictly nested chart
pairs and the 5-smooth coefficient alphabet with no non-dyadic event added, recomputes the invoice and κ and
reproduces #7613's crossing, and runs rejecting controls (wrong
coefficients, dropped or sign-flipped decodes or encodes, 226 slide undone, courier skipping its stop, transit
MOVE after its decode, flipped ownership flag, reversed or non-nested MOVE,
retagged encode, bare hop deletion without a courier) plus a tampered invoice.
`price.py` runs the repository tools above.

## Conditional premises and what is not rerun

On top of the inherited CLEAR #44 premise, the claim carries the framework
assumptions of #7605 (`native_all_columns`, `owned_erasure`, `compiler`,
`precision_tape`, `analytic_recovery`), the signed #7113 caller, and the BIT
premise of the base. This package does not rerun the signed caller, outer
predicates or precision/tape counts (header, rows, grid and owned data are
unchanged). No upstream maintainer has reviewed the package.

## Credit

The move pattern is the crowd's (credits above); the base word is #7613 on
Clear1nsight's #7612; the lineage is in [NOTICE](NOTICE).
DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code. Apache-2.0.

## Open next questions

**The premise.** A ruling on `owned_erasure` (clear-form-gap Q1) decides #7608, #7612, #7613 and this word together. See [TASK.json](TASK.json).
30 changes: 30 additions & 0 deletions research/p104-four-couriers-on7613/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": "scripts/compare_recursive_invoices.py",
"usage": "input",
"git_blob": "fda2a852e9937e42fe40df0707694465ca7c1b48",
"sha256": "3930c22c11da7bc6042cfeb6e459ecb06e4478430037bee3469d034353855fc6"
},
{
"path": "scripts/evaluate_recursive_power.py",
"usage": "input",
"git_blob": "ca50f8021fc3238a58fd420383f4619a8d008ace",
"sha256": "52b20f41fd0bb55fa88dccd6015af2ce358917817b9506720f3e60ce681cc3ad"
}
]
}
117 changes: 117 additions & 0 deletions research/p104-four-couriers-on7613/TASK.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,117 @@
{
"schema_version": 1,
"task_id": "p104-side-correction",
"priority_revision": 8,
"base_commit": "e54523517d0f03e58352e647c403a5af3e525a57",
"original_card": {
"id": "p104-side-correction",
"question": "Can joint helper bases and a legal causal split improve the complete P104 productive/paid invoice?",
"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/p104-helper-subspace-splits/README.md",
"research/dyadic-helper-channel-capacity/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": "An exact arbitrary-input identity, source/target frame availability and restoration at the chosen cut, plus the complete channel+correction+idle/hosting bill or an explicit favorable bound. The native channel alone is not a supplier. 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": "Start with the selected #5599 emitted word and review pending #5718 distinct input/output bases plus #5717/#5719 coverage before claiming work. Pick one uncovered source word, helper group and cut region. Prove the arbitrary-input relation and legal entry/exit corrections, then compare full target and paid profiles. Reject if completion, owned lifetimes or consumer costs repay the gain. A static pairing rank alone is not a physical split.",
"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": [
"P104",
"helper basis",
"helper split",
"5718",
"dyadic capacity"
],
"existing_checks": [
{
"scope": "PR #4133: literal-slot defect",
"evidence": "research/p104-literal-slot-defect/README.md",
"remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.",
"status": "author-checked",
"source_commit": "88666f1dee93fbd85b31fd5d6f91a219e111b5f4",
"selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129"
},
{
"scope": "PR #4136: uniform commutation gap",
"evidence": "research/p104-uniform-commutation-gap/README.md",
"remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.",
"status": "author-checked",
"source_commit": "281ce601a8be9db470de630759179c23e1dfaa88",
"selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129"
},
{
"scope": "PR #4140: uniform encoding gap",
"evidence": "research/p104-uniform-encoding-gap/README.md",
"remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.",
"status": "author-checked",
"source_commit": "de25c6525aa866962309df5d107b32d55e6e5628",
"selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129"
},
{
"scope": "PR #4153: source-chart shortcut exhausts its optimistic allowance",
"evidence": "research/p104-source-chart-shortcut/README.md",
"remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.",
"status": "author-checked",
"source_commit": "9123241fea53df77e51ffe30d9aca1625d4bf3a8",
"selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129"
},
{
"scope": "PR #4154: fiber-tag seam mismatch",
"evidence": "research/p104-fiber-tag-seam/README.md",
"remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.",
"status": "author-checked",
"source_commit": "4ffcdaee5d6255a9cea1fe53a5424435068089d0",
"selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129"
},
{
"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": "refined",
"actual_scope": "Exact #7613 word (ours, on Clear1nsight's #7612): four courier (funded-return) moves. Transit register S drops a mid-chart visit and courier D, co-present with S at chart a, carries S's content through an invertible shear re-basis to S's next chart b where the inverse shear decodes. Pairs S/D: 532/1464, 1250/1464, 226/990 (226's MOVE 260->719 slid earlier), 7/779. Rows, end charts, owned MOVEs, lifetimes, header, CLEAR content and signed #7113 caller data are #7613's; three new strictly nested chart pairs; no non-dyadic event added. Conditional on the CLEAR #44 content interpretation inherited from #7608/#7612/#7613; no new premise.",
"scope_change_reason": "Applies the crowd's courier (funded-return) move pattern (#7244/#7274/#7314/#7334/#7480/#7481) to four further sibling pairs found by scanning interior public nodes on the #7613 word.",
"bottleneck_link": "Reduces the complete signed paid invoice by {1:-34, 3:-34, 4:-17, 6:+34} over the 17 native calls without changing the productive profile.",
"budget_minutes": 90,
"stop_rule": "One literal word with exact arbitrary-input row equality, legality, identical CLEAR content, complete invoice and a certified crossing.",
"outcome": "completed",
"evidence": "README.md, data/edits.json, check.py, price.py, VERIFY.json.",
"author": "DreamingOfClouds",
"ai_assistance": "Claude Opus 5.5 (Anthropic), via Claude Code.",
"open_questions": [
{
"question": "Does owned_erasure admit owned CLEAR #44 (field 1557, chart 595) discarding {451:-1, 1495:1}? (inherited from #7608/#7612/#7613; research/p104-6372-clear-form-gap, Q1)",
"why_it_matters": "The claimed kappa holds only if it does; this word's CLEAR content equals #7613's at all 74 CLEARs, so it adds no premise.",
"first_step": "Run check.py and read the CLEAR content line.",
"blocked_by": "A ruling on owned_erasure."
}
]
}
32 changes: 32 additions & 0 deletions research/p104-four-couriers-on7613/VERIFY.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,32 @@
{
"schema_version": 1,
"status": "ready",
"python": "3.12",
"requirements": [],
"inputs": [
"scripts/compare_recursive_invoices.py",
"scripts/evaluate_recursive_power.py"
],
"commands": [
{
"argv": [
"{python}",
"-I",
"-B",
"{package}/check.py"
],
"timeout_seconds": 300,
"checks": "Vendored #7613 word bytes; word = #7613 + edit list; exact arbitrary-input replay and legality of both words; header identical; all 1,569 rows and end charts equal; owned MOVEs, lifetimes, peak unchanged; all 74 CLEARs identical to #7613 (CLEAR #44 row asserted as {451:-1, 1495:1}); only registers 7, 226, 532, 1250, 1464 change chains; four encode/decode shear groups located and checked as exact inverses; exactly 3 new strictly nested chart pairs; 5-smooth coefficient denominators, grid within #7613; #7613 crossing reproduced; new invoice and kappa 0.00365455370060381; rejecting controls."
},
{
"argv": [
"{python}",
"-I",
"-B",
"{package}/price.py"
],
"timeout_seconds": 120,
"checks": "Repository tools: uniformly_better against #7613; new_cost_lower at C=0.0036545537006, 0.0036530568656 and 0.0036527403112; new_cost_higher at C=0.0036545537007. Prints PASS_PRICE."
}
]
}
Loading
Loading