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
10 changes: 10 additions & 0 deletions research/p104-findings-nov15/NOTICE
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
Apache-2.0. DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code. The outside-session lanes behind the DYINGPAIR, SLACK
and GAPLEMMA proofs and the native-side census scripts are DreamingOfClouds'.

code/pricekit.py is our PRICEKIT, as shipped in #7607. data/w7546.json.gz is ToikY's #7546 word and data/7113_CALLER.json.gz is Rohan Arun's #7113
signed caller, both as vendored in #7606/#7607 and used as data only. The frontier words that the lane scripts read (our #7615 and #7617; #7612 by
Clear1nsight and #7616 by SYLforge in their lineage) are used as data only and are not shipped. The funded-return and courier conventions come from
the crowd chain #7480/#7481; the retag/slide edit family goes back to #7277 and #7612. Credit CubeJerry for the #6805 native and the P104 price and
replay lineage.

All checkers in this package are our own code; no code is imported from the repository or any other package, and no other author's open-PR code is run.
198 changes: 198 additions & 0 deletions research/p104-findings-nov15/PROOF.md

Large diffs are not rendered by default.

219 changes: 219 additions & 0 deletions research/p104-findings-nov15/README.md

Large diffs are not rendered by default.

12 changes: 12 additions & 0 deletions research/p104-findings-nov15/SOURCES.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,12 @@
{
"schema_version": 1,
"base_commit": "e54523517d0f03e58352e647c403a5af3e525a57",
"files": [
{
"path": "docs/research/agent-task-catalog.json",
"usage": "provenance",
"git_blob": "3404fbdd5e7529a0674eef26114b5071e4586cec",
"sha256": "ead6cdc9d0af6d58e8a49744d8ec8c7c15e13d2ba93c276c434bcf9b51b93a81"
}
]
}
135 changes: 135 additions & 0 deletions research/p104-findings-nov15/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": "Findings of Nov 15 following #7606/#7607/#7609 (no kappa, no word): (1) DYINGPAIR theorem: no dying role pair or single in the rho = 2 two-arm caller under counts T1/T2 (Floor matrix nonsingular without nesting, triangular recursion with Q_a eigenvalues 1 +- sqrt(t/(1+t)) != 2); (2) SLACK: interval-capped line pricing correction, extended Crossing Lemma, lone extra roles closed, rank drop forces b_K > 0 on both sides; (3) GAPLEMMA: Delta-Floor lemma kills every pair and k = 0 layout (102 of 117), proved ceiling +1.15% for the 15 single-role layouts, standalone open question; (4) native laws on the #7615/#7617 words: RELAY-DIAMOND, lattice lock, dim-8 non-nesting tails law, JOINT-SUPPLY / FRAME-FANOUT / ROUTE-DEMAND-IS-UNIT-LEVEL; (5) exact single-main reroute bound and forced D, helper-layer lower bound 944 / 1,366 and zero-need relay census, D ledger by bucket; (6) spec ledger: SPEC vs verifier clauses, new public registers legal with one-hop helpers free in kappa, the fresh-register meet-twice (Sandwich) rule, S = 2*(104*16 - 17*56), mains S-neutral.",
"scope_change_reason": "The card asks for a constructive helper-basis or causal-split improvement. This package records theorems, scoped laws and bounds on P104 (no kappa claim, no word) so that others can see which caller layouts, native edits and contract relaxations are closed or bounded, and why.",
"bottleneck_link": "The P104 invoice's fixed costs (the caller header and per-port odd unit, the owned decoder mass, the native helper layer's 9,962 D0 per call) are what every proposed redesign has hit; this package proves where the caller part is closed (DYINGPAIR, SLACK, GAPLEMMA), bounds the native part (lock laws, helper floor, mains bound) and records which contract clauses are SPEC.",
"budget_minutes": 240,
"stop_rule": "Every proved claim has a proof in PROOF.md or a stated argument; every finite fact tagged [C] is re-run by a checker with controls; lane-only numbers are tagged [C-lane] or [C-param]; open items stated as open; validator PASS.",
"outcome": "negative-result",
"evidence": "README.md, PROOF.md, code/ (four CI checkers: gaplemma/dfloor_count.py, slack/icap_check.py, dyingpair/step1.py, spec/shuttle.py; lane scripts), data/, VERIFY.json.",
"author": "DreamingOfClouds",
"ai_assistance": "Claude Opus 5.5 (Anthropic), via Claude Code.",
"open_questions": [
{
"question": "Does a root of the non-dying layout L' (B plus one surviving extra role, one stage shorter) have a first-two-stage prefix in the set reachable by the dying family-A left arm (codimension about 7)?",
"why_it_matters": "It decides whether the single-role dying layouts exist (proved ceiling +1.15%) or the caller closes at <= +0.97%.",
"first_step": "Build an exact L' root with the exact-root pipeline, compute its prefix family dimension and test transversality against the reachable set.",
"blocked_by": "Nothing."
},
{
"question": "Are interior stages of two-arm callers nested (b_k = 0 for 1 < k < nl-1)?",
"why_it_matters": "Any rank drop across a death needs b_K > 0 on both sides, so nesting would close the slack class.",
"first_step": "Exact two-arm search with one dying role at stage 2, extending the DYINGPAIR recursion.",
"blocked_by": "Nothing."
},
{
"question": "Is there a token-flow lower bound for the helper layer above the sound 944 / 1,366 D0 per call floor?",
"why_it_matters": "4,129 D0 per call of the native sit at zero-need relay frames that no rank or contact bound sees.",
"first_step": "State per-frame span equality on full contents including helper tokens, with the row contract fixing which tokens reach which finals, and solve it as an LP.",
"blocked_by": "Nothing."
},
{
"question": "How much of the 1,811 of 3,950 D0 per call forced mains gap is forced by anisotropy once helper tokens are counted?",
"why_it_matters": "It separates the D-side ceiling of x1.209 into a forced part and a design part.",
"first_step": "Lower-bound relay contacts per X-Y transfer under the Sandwich rule and price them against the mains gap.",
"blocked_by": "Nothing."
}
]
}
49 changes: 49 additions & 0 deletions research/p104-findings-nov15/VERIFY.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,49 @@
{
"schema_version": 1,
"status": "ready",
"python": "3.12",
"requirements": [],
"inputs": [],
"commands": [
{
"argv": [
"{python}",
"-I",
"-B",
"{package}/code/gaplemma/dfloor_count.py"
],
"timeout_seconds": 60,
"checks": "Stdlib. Enumerates the 140 pair/single + slack layouts of the L = 17, nl = 8 two-arm B caller; 117 survive the refined DYINGPAIR / generalised kill; the Delta-Floor criterion kills 102; the 15 left are all c = 1, k = 1 (no pair survives). Controls: plain B has no dying set; a k = 0 single is killed at i = 0; family A (k = 1, d = 3, slack 0..3) is not killed by P1. Prints PASS_DFLOOR_COUNT."
},
{
"argv": [
"{python}",
"-I",
"-B",
"{package}/code/slack/icap_check.py"
],
"timeout_seconds": 120,
"checks": "PRICEKIT on data/w7546.json.gz and data/7113_CALLER.json.gz. Interval-capped line pricing: nested B control unchanged (1.0950 / 1.0031 / 0.9773) under old boundary caps and interval caps; B plus a lone extra role (1..3, 0..4, 2..5, 3..6) prices > +0.15% with boundary caps and <= 0 with interval caps; pair k = 0 d = 4 + slack 1..4 goes +1.56% -> +0.20%. Prints PASS_ICAP."
},
{
"argv": [
"{python}",
"-I",
"-B",
"{package}/code/dyingpair/step1.py"
],
"timeout_seconds": 400,
"checks": "PRICEKIT. Reprices the two-arm B layouts with dying single/pair roles: B control 1.0950 / 1.0031 / 0.9773; 35 of 63 single-arm layouts pass the +0.5% screen (all excluded by the DYINGPAIR theorem); per-arm pair rows. Prints PASS_DYINGPAIR_PRICE."
},
{
"argv": [
"{python}",
"-I",
"-B",
"{package}/code/spec/shuttle.py"
],
"timeout_seconds": 300,
"checks": "PRICEKIT, exact Decimal. On the #7546 word: a new 1-hop public register 4 -> 9 replays exactly and leaves kappa equal to the base to 34 digits (S, D0 unchanged); the 0 -> 4 -> 9 helper raises D0 by exactly 17 (f(9) - f(4) - f(5)) = 105.105 and keeps S. Prints PASS_SHUTTLE."
}
]
}
28 changes: 28 additions & 0 deletions research/p104-findings-nov15/code/dledger/LEDGER.tsv
Original file line number Diff line number Diff line change
@@ -0,0 +1,28 @@
bucket D0_per_call_7615 D0_per_call_7616 delta
C.T arm interior (deg2..7/8) A 21528.81 21528.81 0.00
N.T helper birth-dim 0 13876.80 13876.80 0.00
C.T hub (deg17) A 7612.66 7612.66 0.00
C.T arm top A 6601.85 6601.85 0.00
C.T arm interior (deg2..7/8) B 1794.07 1794.07 0.00
N.T helper birth-dim 5 677.90 677.90 0.00
C.T hub (deg17) B 634.39 634.39 0.00
C.T arm top B 550.15 550.15 0.00
C.T single (deg1) A 446.68 446.68 0.00
N.T helper birth-dim 3 298.31 298.31 0.00
N.T helper birth-dim 4 241.42 241.42 0.00
N.T helper birth-dim 2 177.08 177.08 0.00
N.T helper birth-dim 1 175.48 175.48 0.00
N.T helper birth-dim 6 49.44 49.44 0.00
C.T single (deg1) B 37.22 37.22 0.00
N.T helper birth-dim 7 13.86 13.86 0.00
N.T helper birth-dim 8 0.00 0.00 0.00
C.P thin QUERY A 0.00 0.00 0.00
C.P idle line (ODD) B -37.22 -37.22 0.00
N.P owned reg -118.00 -118.00 0.00
N.P main X2 -611.31 -611.31 0.00
N.P main X -662.16 -664.41 -2.25
N.P main Y2 -670.16 -667.66 2.50
N.P main Y -737.01 -760.76 -23.76
C.P idle line B -2004.36 -2004.36 0.00
N.P helper MOVE -5548.36 -5537.88 10.49
C.P idle line A -21234.08 -21234.08 0.00
70 changes: 70 additions & 0 deletions research/p104-findings-nov15/code/dledger/ledger.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,70 @@
import sys, math, json
sys.path.insert(0,'inputs/PRICEKIT')
import pricekit as pk
from collections import Counter, defaultdict
f=lambda r: r*math.log(r)
CALLER='inputs/MONOCALLER/7113_CALLER.json'
WORDS={'7615':'inputs/ATTACK/COURIER226/hit_c226_1.json.gz',
'7616':'inputs/ATTACK/WATCH/work/pr7616_word.json.gz'}
C=pk.load(CALLER); ports=pk.caller_ports(C); NST=C['stages']
def ledger(wpath):
W=pk.load(wpath); nat=pk.native_from_word(W); ci=pk.caller_invoice(C)
L=ci['nJ']; inv=pk.invoice(ci,nat); pr=pk.price(inv,30)
B=defaultdict(lambda:[Counter(),Counter()]) # bucket -> [T,P] histograms (totals over all calls/ports)
# caller T: fields
for ty,t in C['types'].items():
for dg in t['diagonal']:
bits=dg[2:]; d=sum(bits); r=int(dg[0])%2+8*d
idx=[k+1 for k,b in enumerate(bits) if b]
if d==NST: name='C.T hub (deg17)'
elif d==1: name='C.T single (deg1)'
elif idx[0]==1 and d==8 or idx[-1]==NST and d==9 and idx[0]==9 or (idx[0]==1 and d==8): name='C.T arm top'
elif idx[-1]==NST and idx[0]==9 and d==9: name='C.T arm top'
else: name='C.T arm interior (deg2..7/8)'
B[name+' %s'%ty][0][r]+=ports[ty]
# caller P
for e in C['events']:
if e[0]=='J': continue
ty,op=e[0],e[1]; k=ports[ty]
if op=='QUERY': B['C.P thin QUERY '+ty][1][1]+=k
elif op=='IDLE_ONE': B['C.P idle line '+ty][1][8*len(e[3])]+=k
elif op=='IDLE_ODD': B['C.P idle line (ODD) '+ty][1][8*len(e[3])+1]+=k
# J/host ops: ADD/SWAP/SCALE/HOST/LAMBDA unpriced
n=len(W['initial']); live=set(W['live']); H=W.get('hosted') or {}
X2,Y2=set(H.get('X2',[])),set(H.get('Y2',[]))
cls={}
for r in live: cls[r]='X'; cls[r+112]='Y'
for r in X2: cls[r]='X2'
for r in Y2: cls[r]='Y2'
dim=[len(b) for b in W['frames']]
for e in W['program']:
if e[0]=='MOVE':
rk=abs(dim[e[3]]-dim[e[2]]); r=e[1]
if r in cls: nm='N.P main '+cls[r]
elif r>=n: nm='N.P owned reg'
else: nm='N.P helper MOVE'
B[nm][1][rk]+=L
main=live|{r+112 for r in live}|X2|Y2
for r in range(n):
if r in main: continue
d0,d1=dim[W['initial'][r]],dim[W['final'][r]]
B['N.T helper birth-dim %d'%d0][0][d1-d0]+=L
return pr,B,L,inv
def Dof(T,P): return sum(v*f(r) for r,v in T.items())-sum(v*f(r) for r,v in P.items())
def Sof(T,P): return sum(r*v for r,v in T.items())-sum(r*v for r,v in P.items())
out={}
for lab,wp in WORDS.items():
pr,B,L,inv=ledger(wp)
Tt=Counter(); Pt=Counter()
for T,P in B.values(): Tt.update(T); Pt.update(P)
exact = (+Tt==+inv['T']) and (+Pt==+inv['P'])
rows=sorted(((Dof(T,P),Sof(T,P),b,sum(T.values()),sum(P.values())) for b,(T,P) in B.items()),reverse=True)
out[lab]=dict(kappa=pk.kstr(pr['kappa'],14),S=int(pr['S']),D0=float(pr['D0']),exact_hist=exact,sumD=sum(r[0] for r in rows),L=L,
rows=[dict(D=r[0],S=r[1],b=r[2],nT=r[3],nP=r[4]) for r in rows],
detail={b:dict(T=dict(sorted(T.items())),P=dict(sorted(P.items()))) for b,(T,P) in B.items()})
print(lab,out[lab]['kappa'],out[lab]['S'],out[lab]['D0'],'hist-exact',exact,'sumD',out[lab]['sumD'],'L',L)
json.dump(out,open('ledger.json','w'),default=str)
a,b=out['7615'],out['7616']; bb={r['b']:r['D'] for r in b['rows']}
print('%-40s %12s %12s %10s'%('bucket','D0/call 7615','D0 7616','delta'))
for r in a['rows']:
print('%-40s %12.2f %12.2f %10.2f'%(r['b'],r['D']/17,bb.get(r['b'],0)/17,(bb.get(r['b'],0)-r['D'])/17))
Loading
Loading