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

The base word is our #7630 (seven stop edits and a joint hub re-settle on our #7623, which is on our #7621), which uses
SYLforge's loan + stationary-snapshot device of #7616 and #7620 and inherits #7620's composition: Ali Romman's #7605, our #7611 stay
drops, Clear1nsight's #7612 contact rechart, FanPUYen's #7604, SYLforge's #7603, ToikY's #7546/#7544 and rohanarun's signed #7113
caller, and the courier lineage of our #7615/#7617 and the crowd's courier pattern (Clear1nsight's #7244/#7274/#7314/#7334/#7481,
rohanarun's #7480 and #7277, CubeJerry's #7577, petalas's #7326). The SWAP-NULL relabel law comes from our Lean package 2 (#7634).
#7633 (Clear1nsight) is cited only as a price point.

Vendored data (unmodified, data only): data/base-7630-word.json.gz, data/invoice-7630.json and data/affected-pairs-7630.json
are our #7630's data/word.json.gz, data/invoice-new.json and data/affected-pairs-new.json.

check.py is our own code. Its replay, crossing and column-test sections are taken from our #7630 package; its column
tests follow the description of the affected-pair tests in #7620's README and native runner. The CLEAR certificate
check implements the acceptance rule of #7620's verify_certificates (read, not run). No other author's code was run;
their words are read as data.
88 changes: 88 additions & 0 deletions research/p104-swap-composites-on7630/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,88 @@
# CONDITIONAL κ = 0.0036807241001: 22 swap-then-delete composites on #7630 (premises: the same as #7630's)

**κ = 0.0036807241001472786206795589800541716634…, ×1.00368972 over
[#7633](https://github.com/CrocSwap/integer-mult-bounds/pull/7633)** (κ ≥ 0.003667193194322). The base word is our
[#7630](https://github.com/CrocSwap/integer-mult-bounds/pull/7630) (κ 0.0036667343458950…). The official `evaluate_recursive_power`
bracket (256 bits) is [0.0036807241001, 0.0036807241002]. The claim 0.0036807241001 is below the exact crossing.

> **Premises: conditional on the same framework assumptions as #7630.** Those are exactly #7620's premises: its five framework
> assumptions (`native_all_columns`, `owned_erasure`, `compiler`, `precision_tape`, `analytic_recovery`) and its fixed allocation
> of 17·68 = 1,156 owned banks, with its CLEAR reading over the same **180 CLEARs**. This word adds no owned lifetime and no new kind
> of event: the owned INIT/CLEAR/MOVE sequence is #7630's. The CLEAR *contents* change (151 of 180), because the hub content they
> snapshot is re-derived, so each of the 180 CLEARs carries its own exact certificate under #7620's `verify_certificates` rule
> (`data/clear-certificates.json`). If #7620's premises are refused, this word is void with #7620, #7621, #7623 and #7630.

## The edits

Base: #7630's word (`data/base-7630-word.json.gz`, 208,738 events). New word: `data/word.json.gz`, 202,668 events. Every edit is listed
in base-word coordinates in [data/edits.json](data/edits.json): 22 composites C1–C22 on 44 helpers (521 interior deletions, 444 insertions),
then the re-derived hubs.

Each composite is two steps at one chart c:
1. **A SWAP-NULL relabel** of two helpers h1, h2 that are both born at {0} and both end at V. Exchanging their row trajectories after c is
undone exactly by the hubs (the {0} prefix and the V mix), so on its own it changes no final row and no price. This is the swap law of
our Lean package [#7634](https://github.com/CrocSwap/integer-mult-bounds/pull/7634) (`SwapNull`).
2. **Deletion of the recombined stay** at c. After the relabel, the two stays at c have new neighbours, and one of them is no longer needed.

Example C1 (helpers 396 and 564, swap chart 457): routes `396: 3→90→448→457→965→149→127`, `564: 3→457→895→127` become
`396: 3→90→448→457→895→127`, `564: 3→965→149→127`. Helper 564's stop at 457 disappears.

**Why the deletion is legal (the blank hand-off).** In every composite the receiver b is {0}-born and still *blank* when it reaches c
(its row is e_b plus {0}-chart content only). A co-resident register a either hands its content to b there (`b += a`) and then only
collects on its way to V, or has already spent its content and idles to V. Deleting b's stop without the relabel fails, because b's stop
carries that content flow. After the relabel, a carries its own content along b's old tail, and b, still blank, takes a's collector tail
straight from {0}: the copy `b += a` becomes a rename, and b's stop at c disappears. All 22 hits sit at charts of dimension 1–3.

**Joint hub re-settle.** As in #7630, every ADD/SCALE at the {0} chart and at V is then solved jointly and exactly so that all 1,569
final rows and end charts equal #7630's.

## Price

Native paid delta per call {2:−18, 3:−6, 4:−20, 6:+20, 7:+2}; helper targets unchanged. Over 17 calls: paid
{2:−306, 3:−102, 4:−340, 6:+340, 7:+34}. Paid positions 110,026 → 109,652; rank surplus S = 1,424 unchanged.
Ordinary bill (17 calls, the repository `independent.py` formula with its call count set to 17): 867,014,040 for #7630 → 859,783,396
for this word, below 10^9. Coefficients stay 5-smooth. The replayed grid moves from #7630's (2-adic exponent 20, odd lcm 675, 34 numerator
bits) to (16, 54,675, 29): the odd lcm grows. Non-dyadic literal events go from 12,312 to 11,737.
Official tools (`price.py`):
- `compare_recursive_invoices` against #7630 gives `uniformly_better`.
- `evaluate_recursive_power` (256 bits) gives `new_cost_lower` at C = 0.0036807241001 and `new_cost_higher` at C = 0.0036807241002.

## Checks

```sh
python3.12 -B scripts/research_package.py --package research/p104-swap-composites-on7630
```
`VERIFY.json` registers eight commands:
- `core`: words, interior edit list, exact replay and legality of both words, rows, end charts and owned data, routes, coefficients,
invoice and κ.
- `certificates`: all 180 CLEAR certificates, with 2 rejecting controls.
- `controls`: 14 rejecting controls and 2 accepting.
- `columns1` to `columns4`: the affected-pair column tests, in four parts.
- `price.py`.

**Affected pairs.** #7630's census is 981 pairs. The 44 changed helpers add 42 route pairs not already counted, so the census becomes
**1,023 pairs**, with none dropped. `check.py` runs 512 forward and 512 adjoint Gaussian columns, signed Pauli action, absolute phase,
exact ascent rank and a wrong-phase rejection on all of them.

Independently of the package, the word passed our exact pricer, an independent exact Fraction replay (all 1,569 rows equal #7630's,
no chart, ascent or ownership violation), a replay modulo 2^89−1 and 2^107−1, the repository's `independent.py` native audit
(bad_inputs 0) and caller identity (bad_outputs [], 17 native calls), and an interval gate on the κ bracket.

## Conditional premises and what is not rerun

The claim carries exactly #7630's premises (above), over the same 180 CLEARs with new, individually certified contents, and the signed
#7113 caller and BIT premise of the base. This package does not rerun #7620's full native/signed 17-stage application, catalogue, outer
predicates or precision/tape counts. No upstream maintainer has reviewed the package.

## Credit

The base is our [#7630](https://github.com/CrocSwap/integer-mult-bounds/pull/7630) on #7623 and #7621, which use SYLforge's loan +
stationary-snapshot device ([#7616](https://github.com/CrocSwap/integer-mult-bounds/pull/7616),
[#7620](https://github.com/CrocSwap/integer-mult-bounds/pull/7620)). Signed caller: rohanarun's #7113. See [NOTICE](NOTICE).
DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code. Apache-2.0.

## Open next questions

- **More composites.** Only pure deletions after a single relabel were screened, and 35 further single hits conflict in the joint stack.
Making non-blank receivers blank first (with a κ-null gauge) is untested.
- **The premises.** A ruling on #7620's inherited assumptions and its CLEAR reading decides #7620, #7621, #7623, #7630 and this word together.
30 changes: 30 additions & 0 deletions research/p104-swap-composites-on7630/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-swap-composites-on7630/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 #7630 word (our reroutes word on #7623, itself on #7621). Twenty-two swap-then-delete composites plus one joint hub re-settle: each composite is a SWAP-NULL relabel of two helpers h1,h2 (born at chart 3, ending at V) at a chart where both are present, followed by the deletion of the recombined stay of one of them at that chart. Every ADD/SCALE at the {0} chart and at V is then re-derived jointly and exactly so that all 1,569 final rows equal #7630's. Rows, end charts, the owned INIT/CLEAR/MOVE sequence (47 owned MOVEs, 180 lifetimes, peak 50, 68 labels) are #7630's; the CLEAR contents change with the hub content and each of the 180 carries an exact certificate under #7620's rule. Conditional on the same framework assumptions as #7630, #7623 and #7620.",
"scope_change_reason": "Removes 22 paid stops from #7630's word: after a SWAP-NULL relabel of two helpers the recombined stay of one of them carries no content that the other does not already carry (empty-carrier mechanism, see README), so it is deleted and the hubs are re-settled exactly. Candidates were screened exactly over all interior stops and each stacked composite was re-checked jointly by exact replay.",
"bottleneck_link": "Reduces the complete signed paid invoice per native call by {2:-18, 3:-6, 4:-20, 6:+20, 7:+2} (22 fewer MOVEs, some re-ranked), helper targets unchanged; over 17 calls paid positions 110,026 -> 109,652, rank-weighted S 1424 unchanged.",
"budget_minutes": 120,
"stop_rule": "One literal word with exact arbitrary-input row equality, legality, the interior edit list, exact certificates for all 180 CLEARs, all affected-pair column tests (1,023 pairs), 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": "Do #7630's premises (#7620's five inherited assumptions native_all_columns, owned_erasure, compiler, precision_tape, analytic_recovery, its 180-CLEAR reading and its fixed 17*68 bank allocation) hold?",
"why_it_matters": "The claimed kappa holds only if #7630's does. This word adds no owned lifetime and no new kind of event; its 180 CLEARs are the same lifetimes as #7630's with new contents, each certified exactly.",
"first_step": "Run check.py core and check.py certificates.",
"blocked_by": "A ruling on #7620's premises (owned_erasure, clear-form-gap Q1)."
}
]
}
Loading
Loading