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
21 changes: 21 additions & 0 deletions research/p104-follow-up-findings/NOTICE
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
Apache-2.0. DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code. The outside-session lanes TOY4 S2
(Pin / Down-set No-Loss / Charge Corollary), CALLEROPEN, JUNKROLE and DECLIFT9 are DreamingOfClouds'; WEBS
(the Cut Lemma, shipped in #7606) is also his.

data/base-7605-word.json.gz is aliromman's #7605 word (the same bytes vendored by our #7608, sha256 pinned in
clearform.py), used as data only; credit aliromman, and FanPUYen (#7604), SYLforge (#7603) and ToikY (#7546) for its
lineage. data/edits-7608.json is our #7608 edit list. data/invoice-7546.json, invoice-7605.json and invoice-7608.json
are the recursive invoices (#7113 caller x native) of those words, as shipped in #7606 / #7608.

clearform.py reads research/p104-6372-clear-form-gap/inputs/candidate-WORD.json.gz (unpaidmoon's package, pinned in
SOURCES.json) as data only. sepgate.py reads research/shared-wire-split-composition/FULL-RESULT.json (the #7000
selected record, CubeJerry) as data only. No code from either package is run.

data/lines120.json (Gram and F2^9 labels of the 120 E8 lines, the first 104 being the P104 ports) is our derived data,
checked against research/complex-frame-pair-decoders/inputs/pr717/P104_HIT_flip_3a.txt in #7583/#7606; credit the
PR968 authors.

Credit Rohan Arun for the #7113 signed caller, CubeJerry for the #6805 native (W6805) used by our caller and toy lanes,
and Clear1nsight, ToikY and the other contributors of the P104 price and replay lineage for the conventions.

All checkers in this package are our own code; no code is imported from the repository or any other package.
444 changes: 444 additions & 0 deletions research/p104-follow-up-findings/PROOF.md

Large diffs are not rendered by default.

298 changes: 298 additions & 0 deletions research/p104-follow-up-findings/README.md

Large diffs are not rendered by default.

36 changes: 36 additions & 0 deletions research/p104-follow-up-findings/SOURCES.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
{
"schema_version": 1,
"base_commit": "e54523517d0f03e58352e647c403a5af3e525a57",
"files": [
{
"path": "docs/research/agent-task-catalog.json",
"usage": "provenance",
"git_blob": "3404fbdd5e7529a0674eef26114b5071e4586cec",
"sha256": "ead6cdc9d0af6d58e8a49744d8ec8c7c15e13d2ba93c276c434bcf9b51b93a81"
},
{
"path": "research/p104-6372-clear-form-gap/inputs/candidate-WORD.json.gz",
"usage": "input",
"git_blob": "0af79e58172f85c302c35b193205c0b185b09393",
"sha256": "e3b6f1c25d672b8c85433be97ebad77ae6a6972352ce2ff63507d30835fcb491"
},
{
"path": "research/shared-wire-split-composition/FULL-RESULT.json",
"usage": "input",
"git_blob": "ff3256f0d3ffbfc56b062f9ec0fdbbc7b30e76d5",
"sha256": "d9ba709fa5dcefffe3f3abdcf34600ce188224703cfd743e6db8b58ba4816cb7"
},
{
"path": "research/kappa-rebuild/architecture/FINITE-PRECOMPILATION.md",
"usage": "provenance",
"git_blob": "4badb40f0919c515823cb07e44c6470d4d6469ca",
"sha256": "4cb32f6b8e388ecf6ed41b5bbdeeb4539cb40c8424f194974afea58f7e0921e8"
},
{
"path": "upstream/build/sections/05-layers.tex",
"usage": "provenance",
"git_blob": "5ce8b3c83c455f221bb84858a97230b0285644aa",
"sha256": "20cfc8d12099d4e4ed9e3e7eeb6162edd9b6e0e076f24693364cd24377252594"
}
]
}
135 changes: 135 additions & 0 deletions research/p104-follow-up-findings/TASK.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,135 @@
{
"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": "changed",
"actual_scope": "Follow-up to #7606/#7607/#7608 collecting the P104 results logged after #7606 (Nov 14): (1) lossless owned CLEAR content is free under owned_erasure and every CLEAR of an endpoint-exact word is lossless, with exact certificates for #7608's CLEAR #44 and for the clear-form-gap candidate (Q1 YES); (2) the r_max < k_min compiler hypothesis applies after strictification and the gate passes for #7546/#7605/#7608; (3) t = -1 toys: F2^3 decided by two independent proofs (Pin/DNL/Charge; Forwarding/Union/Duality), F2^4 survivors refuted by the Pocket Lemma; (4) 8 hubs realise the cut floor M = 72 on P104 (conjecture M >= n false in the frame model) but the V-funnel lemma forces a rank-96 public layer; (5) caller theory: Crossing and Floor Lemmas, B optimal among nested two-arm layouts, junk role = rho = 3, rho >= 3 no gain, beta = 4g+2, nesting proved at outermost/innermost stages only; (6) decoders: residual identity (C >= n odd denominators, >= 16 half level), h = 10 decoder 57, mod-3/fooling/lifted negatives, E8 odd-graph facts; (7) shape/framework: kappa bounded, Delta kappa = 0 under self-application, one outer level optimal; (8) radix 3 / spec challenge: endpoint wrappers exist in odd radix but Lemma Z keeps the per-port +1, decoder target H forces c >= v; (9) scoped negatives; plus explicit corrections of our earlier statements.",
"scope_change_reason": "The card asks for a constructive helper-basis or causal-split improvement. This package records theorems, scoped negative results and corrections on P104 (no kappa claim, no word) so that others can see which caller, decoder, t = -1, radix and framework routes are closed and why, and it discharges the CLEAR-content premise of #7608.",
"bottleneck_link": "The P104 invoice's fixed costs (owned decoder mass, the per-port odd unit, the caller header) are what every proposed redesign has hit; this package proves where they come from (Crossing/Floor lemmas, residual identity, Lemma Z, target H) and which escapes remain open.",
"budget_minutes": 240,
"stop_rule": "Every proved claim has a proof in PROOF.md; every finite fact quoted as [C] is re-run by a standard-library checker with positive and negative controls; lane-only numbers are tagged [C-lane] or [C-param]; open items stated as open; work in progress excluded; validator PASS.",
"outcome": "negative-result",
"evidence": "README.md, PROOF.md, clearform.py, sepgate.py, toy4.py, labels.py, oddradix.py, data/, VERIFY.json.",
"author": "DreamingOfClouds",
"ai_assistance": "Claude Opus 5.5 (Anthropic), via Claude Code; some lanes are DreamingOfClouds' outside-session lanes (see NOTICE).",
"open_questions": [
{
"question": "Are interior stages of two-arm callers nested (b_k = 0 for 1 < k < m-1)?",
"why_it_matters": "B's optimality beyond the nested family and the arm-top part of beta = 34 rest on it.",
"first_step": "Exact L = 5 two-arm search with one dying role at stage 2, then extend DYINGGEN Theorem 1 by induction.",
"blocked_by": "Nothing."
},
{
"question": "Can a one-plane public partner layer deliver (G/2 - I)y below 2,817 D0 per call?",
"why_it_matters": "That is the crossing point at which 8 owned hubs (M = 72) would beat the asc56 decoder.",
"first_step": "Price the hub-routed U layer with the flag-free LP and build its cheapest exact instance.",
"blocked_by": "Nothing."
},
{
"question": "Is there a cancelling tiling of spilled A2/HIT rectangles giving a target-H radix-3 decoder with total cost <= 67 (rho = 2) or <= 71 (rho = 1)?",
"why_it_matters": "It is the last radix-3 escape; every 3-integral decoder costs >= 112.",
"first_step": "Search tilings of the P112 non-orthogonal cells by A2^4-type rectangles with exact F3 ranks.",
"blocked_by": "Nothing."
},
{
"question": "Is C(103) = 56 on the P104 labels restricted to 103 ports?",
"why_it_matters": "It would make the h = 10 decoder exactly 57.",
"first_step": "Re-run the rank-8 rigidity argument on the 103-port label set.",
"blocked_by": "Nothing."
}
]
}
62 changes: 62 additions & 0 deletions research/p104-follow-up-findings/VERIFY.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,62 @@
{
"schema_version": 1,
"status": "ready",
"python": "3.12",
"requirements": [],
"inputs": [
"research/p104-6372-clear-form-gap/inputs/candidate-WORD.json.gz",
"research/shared-wire-split-composition/FULL-RESULT.json"
],
"commands": [
{
"argv": [
"{python}",
"-I",
"-B",
"{package}/clearform.py"
],
"timeout_seconds": 300,
"checks": "Vendored #7605 word (sha256 pinned) + our #7608 edit list (every deleted event matched); exact Fraction replay of both words. Final public rows identical, rank 1501 = n_pub in both (with the Rank lemma: all 74 owned CLEARs lossless); 73/74 erased rows identical, only CLEAR #44 (owned 1557) differs; #7608 row {451:-1,1495:1} = exact 21-term Q-combination of the other live rows (rank 1501), #7605 row = 23-term combination, difference exactly -3/2(x902+x985). clear-form-gap candidate CLEARs 17755/17756 lossless with exact 97-term certificates (other live rank 770 = n_pub). Controls: lossy and lossless 3-register toys; a prepended COPY/zero/CLEAR of token 0 on the real word gives other live rank 1500, no certificate and endpoint rank 1500; a corrupted certificate coefficient is rejected. Prints PASS_CLEARFORM."
},
{
"argv": [
"{python}",
"-I",
"-B",
"{package}/sepgate.py"
],
"timeout_seconds": 60,
"checks": "Decimal (60 digits). #7000 control: gamma and delta at its tested C equal FULL-RESULT.json to 1e-12, kappa root inside its raw bracket. #7546, #7605, #7608 invoices (sha256 pinned): kappa root matches the published kappa, raw r_max = 64 >= k_min = 1, max target < 153, strictification gate passes (alpha < 1, gamma 0.940836 / 0.940920 / 0.940932, delta 0.908148 / 0.908149 / 0.908149 < 31/32). Negative control: paid mass of rank >= 16 scaled by 1.10 fails the gate. Prints PASS_SEPARATION_GATE."
},
{
"argv": [
"{python}",
"-I",
"-B",
"{package}/toy4.py"
],
"timeout_seconds": 60,
"checks": "Exact enumeration on F2^3, labels 1,2,4,7: 16 frames, 460 up-sets, 8,261 owned multisets of climb 3, 13 pass every births cut, Charge Corollary blocks all 13 (port 7); labels 1,2,7 climb 2: 1 cut-feasible set, blocked. Controls: 4 line feeders pass the cuts and are not blocked, 0 owned fails the cuts; climb 4: 2,074 cut-feasible, 240 blocked (non-vacuous), feeders not blocked; exact Fraction replay of the 4-feeder program (exact, owned climb 4); the duality map permutes the 13 climb-3 sets. Prints PASS_TOY4_DECISION."
},
{
"argv": [
"{python}",
"-I",
"-B",
"{package}/labels.py"
],
"timeout_seconds": 60,
"checks": "Exact (stdlib) on data/lines120.json (sha256 pinned): orthogonal (label-odd) graph SRG(120,63,30,36), complement SRG(120,56,28,24); P104 degrees 55 / 48, 5,720 odd and 4,992 non-orthogonal cells; Q = A+I GF(2) rank 9, rational rank 120 / 104 (two primes agree), G mod 2 GF(2) rank 8; 2,025 orthogonal 8-frames, no 9-clique, each orthogonal pair in 15, all span dim 4, 759 inside P104; max pairwise-odd and pairwise-even sets on P104 = 8; exact cover of P104 by 13 disjoint frames with M = sum 1_F 1_F^T zero on all non-orthogonal cells; G104 rank 8, diagonal 2, 0 on odd cells, +-1 on non-orthogonal cells. Controls: flipped label breaks the SRG parameters, non-frame 8-sets rejected, random 8-sets not a cover. Prints PASS_LABEL_FACTS."
},
{
"argv": [
"{python}",
"-I",
"-B",
"{package}/oddradix.py"
],
"timeout_seconds": 300,
"checks": "Exact. (A) minimal number of rank-1 symmetric terms = rank, or rank+1 iff alternating nonzero over F2: exhaustive (p,m) = (2,2..4),(3,2..3),(5,2..3), 0 mismatches, F2 m=4 table pinned. (B) endpoint wrappers in Z[zeta_p]: K^j = r D_a P_s K D_b for all non-isotropic lines, c, j (p=3 m=1,2,3: 4/4, 16/16, 36/36; p=5 m=1,2: 16/16, 64/64), wrappers commute with K_u for u perp v (12/12, 108/108, 12/12), no solution on isotropic lines, one-sided gauge K^2 not monomial. (C) Lemma Z admissibility (mod 7, k^3 = 1): H3, live planes, QUERY not admissible and QSELF, park1, swap admissible at m = 2, 4, 6, 36; positive controls: products of C3 swap planes reach the split target at cost m (m = 4, 6); m = 2 witness QUERY*H3 costs m+1. Prints PASS_ODD_RADIX."
}
]
}
Loading
Loading