Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
208 commits
Select commit Hold shift + click to select a range
ed15920
Add SHA-matched public replicas of three Drive parent proofs
cursoragent Sep 25, 2026
d32b5ff
Index Drive parent proofs and mesoscopic coordination notes
cursoragent Sep 25, 2026
22cb74a
Add nonauthor review notes, ENG-03 replay receipt, and route index
cursoragent Sep 25, 2026
00686ee
Index nonauthor reviews, ENG replay receipt, and downstream route
cursoragent Sep 25, 2026
b99da91
Add nonauthor notes for lifetime remainder and SIDE24 coefficient
cursoragent Sep 25, 2026
337200f
Preserve cataloged downstream route identity and add v2 pointers
cursoragent Sep 25, 2026
15d4e24
Index #67/#65 notes and downstream route v2
cursoragent Sep 25, 2026
1a6963f
Add RN count-interface and PAL-02 matching review notes
cursoragent Sep 25, 2026
b76641c
Index RN count-interface and PAL-02 matching notes
cursoragent Sep 25, 2026
489b757
Add P15 price crosswalk and marked-cylinder CAP review notes
cursoragent Sep 25, 2026
0096fad
Index P15 price crosswalk and marked-cylinder CAP notes
cursoragent Sep 25, 2026
49834c4
Add P15-B Drive replica, review index, and hard-gate notes
cursoragent Sep 25, 2026
75b90d6
Index downstream hard gate, P15-B replica, and review index
cursoragent Sep 25, 2026
41fa16f
Coordinate PR9 chart notes, route v3, and replay/index v2
cursoragent Sep 25, 2026
c8bff6c
Index PR9 chart notes, route v3, and v2 index/replay
cursoragent Sep 25, 2026
e7136df
Publish multi-agent dispatch and cross-model next-step artifacts
cursoragent Sep 25, 2026
64f2eec
Index multi-agent dispatch and D1 reverse-impact notes
cursoragent Sep 25, 2026
853ed59
Publish dispatch v2, D2 assignment ledger, and architecture tip notes
cursoragent Sep 25, 2026
a241545
Index dispatch v2 and D2/architecture coordination notes
cursoragent Sep 25, 2026
9329cb3
Publish dispatch v3, D3 ledger, and review-topology challenge notes
cursoragent Sep 25, 2026
f890782
Index dispatch v3, D3 ledger, and topology challenge notes
cursoragent Sep 25, 2026
785d756
Publish dispatch v4, D1/D4 deepen notes, and PR15 tip coordination
cursoragent Sep 25, 2026
bc0a146
Index dispatch v4 and D1/D4/PR15 coordination notes
cursoragent Sep 25, 2026
e2259d4
Fix catalog count to 71 after dispatch v4 index
cursoragent Sep 25, 2026
2223e9d
Publish topology AMEND_REQUIRED, D6 ledger, and tip/replay status
cursoragent Sep 25, 2026
7ffa5c6
Index topology disposition, D6 ledger, and tip/replay notes
cursoragent Sep 25, 2026
f9453c5
Publish dispatch v6, OA-REVIEW claim watch, and L4/L5 ledger
cursoragent Sep 25, 2026
3c3cf11
Index dispatch v6, OA-REVIEW watch, and L4/L5 formal ledger
cursoragent Sep 25, 2026
dcf6973
Publish dispatch v7 and OA-REVIEW delivery coordination notes
cursoragent Sep 25, 2026
5eeb5d5
Index dispatch v7 and OA-REVIEW delivery notes
cursoragent Sep 25, 2026
f7e15a5
Publish dispatch v8: PR15 green, PR18 formal pilot, PR98 wiring
cursoragent Sep 25, 2026
c1046a5
Index dispatch v8 and PR15/PR18/PR98 coordination notes
cursoragent Sep 25, 2026
181e7b4
Publish dispatch v9: PR14 closed, PR19 repair, PR20 map risk
cursoragent Sep 25, 2026
3120bf3
Index dispatch v9 and PR14/PR19/PR20 coordination notes
cursoragent Sep 25, 2026
b7d85ff
Publish dispatch v10: PR98 green, PR21 density, lane map
cursoragent Sep 25, 2026
c4e675a
Index dispatch v10 and PR98/PR21/lane coordination notes
cursoragent Sep 25, 2026
c2ed8de
Publish PR15 merge note and dispatch v11
cursoragent Sep 25, 2026
9c2779f
Catalog merged Math- PR15 transition gate under new keys
cursoragent Sep 25, 2026
7a1c4ae
Add Math- PR15 gate package replica under replicas/
cursoragent Sep 25, 2026
280da68
Index PR15 gate replicas without colliding Math- paths
cursoragent Sep 25, 2026
dce27ca
Publish dispatch v12: PR22 thin-tube and PR9 tip watch
cursoragent Sep 25, 2026
ddab2a4
Index dispatch v12 and PR22/PR9 tip coordination notes
cursoragent Sep 25, 2026
eb74984
Publish dispatch v13: gov-PR4 amend and D5 tip refresh
cursoragent Sep 25, 2026
75e2d25
Index dispatch v13 at catalog 128 bound
cursoragent Sep 25, 2026
0b7c399
Raise catalog bound and publish dispatch v14
cursoragent Sep 25, 2026
772e08a
Index dispatch v14 after catalog bound raise
cursoragent Sep 25, 2026
6639851
Publish dispatch v15: PR19/PR21 merged, PR20 closed
cursoragent Sep 25, 2026
6a82b6d
Index merged PR19/PR21 identities and dispatch v15
cursoragent Sep 25, 2026
661c330
Publish dispatch v16: PR98 F1–F5 tip and PR131 re-review
cursoragent Sep 25, 2026
b19ea5e
Index dispatch v16 and PR98/PR131 coordination notes
cursoragent Sep 25, 2026
ba4f27f
Publish dispatch v17: #90 unresolved_prose blocker and PR98 F2
cursoragent Sep 25, 2026
c2263fa
Index dispatch v17 and #90 blocker coordination notes
cursoragent Sep 25, 2026
58ce020
Publish dispatch v18: PR98 repair-E tip and PR41–44 watches
cursoragent Sep 25, 2026
104e1aa
Index dispatch v18 and PR98 repair-E coordination notes
cursoragent Sep 25, 2026
b865265
Raise catalog bound and publish dispatch v19
cursoragent Sep 25, 2026
bb2db26
Index merged PR22/PR28 annulus identities and dispatch v19
cursoragent Sep 25, 2026
e6a2082
Publish dispatch v20: PR98 same-carrier tip and PR9/PR41 drift
cursoragent Sep 25, 2026
ab14ae5
Index dispatch v20 and PR98 tip-drift coordination notes
cursoragent Sep 25, 2026
fc53f30
Index dispatch v21 and tip-drift coordination notes
cursoragent Sep 25, 2026
92a0457
Publish dispatch v21: PR98 CI settling and PR9/PR41 tip drift
cursoragent Sep 25, 2026
8b3a6ce
Index dispatch v21 identities into the catalog
cursoragent Sep 25, 2026
c3f5686
Publish dispatch v22: PR98 cc6a578b green, #90 still open
cursoragent Sep 25, 2026
fba9680
Index dispatch v22 and PR98 green readback notes
cursoragent Sep 25, 2026
4df99fc
Index dispatch v23 and PR45/#90 coordination notes
cursoragent Sep 25, 2026
7d168f0
Publish dispatch v23: PR45 audit reinforces #90 open
cursoragent Sep 25, 2026
3701bcb
Index dispatch v23 identities into the catalog
cursoragent Sep 25, 2026
d1ed5e4
Publish dispatch v24: PR46 reading maps watch
cursoragent Sep 25, 2026
00ce1a6
Index dispatch v24 and PR46 reading-map coordination notes
cursoragent Sep 25, 2026
1740c60
Publish dispatch v25: contact merges and landing-claims gate
cursoragent Sep 26, 2026
0624d21
Index merged contact and landing-claims identities (v25)
cursoragent Sep 26, 2026
892e2d6
Raise catalog bound and publish dispatch v26
cursoragent Sep 26, 2026
3f76a5d
Index dispatch v26 after catalog bound raise
cursoragent Sep 26, 2026
6027cb1
Publish dispatch v27: PR25 merged and PR98 tip green
cursoragent Sep 26, 2026
5a39bdf
Index merged PR25 collision-mechanism identities (v27)
cursoragent Sep 26, 2026
63df91a
Publish dispatch v28: PR50 custody and PR51 FC-10 merges
cursoragent Sep 26, 2026
d94d447
Index merged PR50/PR51 custody and FC-10 identities
cursoragent Sep 26, 2026
fef6547
Publish dispatch v29: gov PR4 merge and PR98 tip move
cursoragent Sep 26, 2026
23b56f7
Index governance PR4 topology and PR98 tip 69e9b526
cursoragent Sep 26, 2026
ed75f56
Index PR98 tip b59359eb and dispatch v30
cursoragent Sep 26, 2026
d9638a4
Publish dispatch v30 notes: PR98 tip b59359eb
cursoragent Sep 26, 2026
e97aeef
Index PR98 tip b59359eb identities into registry
cursoragent Sep 26, 2026
24cd089
Repair catalog CI: replicas for path collisions, allow governance-
cursoragent Sep 26, 2026
c696b85
Retarget FC-10/PR50 successors to replicas; catalog 221
cursoragent Sep 26, 2026
d648cf1
Publish dispatch v31: watch Math PR52/PR53 tips
cursoragent Sep 26, 2026
2c6da34
Index dispatch v31; catalog at bound 224
cursoragent Sep 26, 2026
c4b722d
Raise catalog CI bound 224→256 for next merge wave
cursoragent Sep 26, 2026
57a0656
Index PR98 green readback at b59359eb
cursoragent Sep 26, 2026
8081cc0
Publish dispatch v32 notes: PR98 tip b59359eb green
cursoragent Sep 26, 2026
dcb29de
Index PR98 green identities into registry (227)
cursoragent Sep 26, 2026
b77e13a
Publish dispatch v33: watch Math PR54/PR55 tips
cursoragent Sep 26, 2026
9f1f3c7
Index dispatch v33; catalog 227→230
cursoragent Sep 26, 2026
bbd67ce
Publish dispatch v34: #90 eng-gate close and PR63 ACCEPT
cursoragent Sep 26, 2026
ce51b8b
Index #90 eng-gate close and PR63 P15 ACCEPT identities
cursoragent Sep 26, 2026
8aa8b30
Publish dispatch v35: watch Math PR68/PR69 tips
cursoragent Sep 26, 2026
99f7bc0
Index dispatch v35; catalog 237→240
cursoragent Sep 26, 2026
0591599
Publish dispatch v36: PR54 proof index and PR66 landing
cursoragent Sep 26, 2026
56ebf2e
Index PR54 proof index and PR66 landing replicas
cursoragent Sep 26, 2026
5ed2016
Raise catalog CI bound 256→288 for open merge wave
cursoragent Sep 26, 2026
c628bd9
Publish dispatch v37: #95 open and PR70 merge-ready
cursoragent Sep 26, 2026
025e606
Index dispatch v37; catalog 250→253
cursoragent Sep 26, 2026
e1d1bc2
Publish dispatch v38: PR70 pre-bound and main PR wave
cursoragent Sep 26, 2026
d516a12
Index dispatch v38; catalog 253→256
cursoragent Sep 26, 2026
5ed6a72
Publish dispatch v39: trial PR142 watch; PR70 still open
cursoragent Sep 26, 2026
22e84d1
Index dispatch v39; catalog 256→259
cursoragent Sep 26, 2026
29b2a9c
Publish dispatch v40: trial PR143 no-promotion watch
cursoragent Sep 26, 2026
2d21adc
Index dispatch v40; catalog 259→262
cursoragent Sep 26, 2026
eb9a4bf
Publish dispatch v41: trial PR143 Batch410 merge
cursoragent Sep 26, 2026
8014114
Index trial PR143 Batch410 no-promotion identities
cursoragent Sep 26, 2026
974bf52
Publish dispatch v42: trial PR144 Batch416 merge
cursoragent Sep 26, 2026
d0b4f24
Index trial PR144 Batch416 no-promotion identities
cursoragent Sep 26, 2026
417ff2d
Publish dispatch v43: OpenAI PR70 custody-claim watch
cursoragent Sep 26, 2026
5c64772
Index PR70 custody-claim watch; catalog 274→278
cursoragent Sep 26, 2026
383789e
Docs: list PR70 custody-claim watch in README catalog table
cursoragent Sep 26, 2026
583b61c
Publish dispatch v44: trial PR145/PR146 Batch453/455 merges
cursoragent Sep 26, 2026
56f13fa
Index trial PR145/PR146 Batch453/455 no-promotion identities
cursoragent Sep 26, 2026
111bdef
Publish dispatch v45: main PR126 custody note; raise catalog bound
cursoragent Sep 26, 2026
7070136
Index main PR126 custody note; catalog 287→291 (bound 320)
cursoragent Sep 26, 2026
0614a14
Publish dispatch v46: main PR137 landing merge note
cursoragent Sep 26, 2026
6d7d17b
Index main PR137 landing note; catalog 291→295
cursoragent Sep 26, 2026
ca7d6c1
Publish dispatch v47: main PR138 front-door merge note
cursoragent Sep 26, 2026
537f3bb
Index main PR138 front-door note; catalog 295→299
cursoragent Sep 26, 2026
ee6c8fe
Publish dispatch v48: OpenAI Sol PR70 BYTE_COPY verify watch
cursoragent Sep 26, 2026
b64b635
Index Sol PR70 BYTE_COPY verify watch; catalog 299→303
cursoragent Sep 26, 2026
39366b7
Publish dispatch v49: main PR139 custody-path merge note
cursoragent Sep 26, 2026
4b07f51
Index main PR139 custody-path note; catalog 303→307
cursoragent Sep 26, 2026
6598581
Publish dispatch v50: Math- PR70 tip drift to 44901b5c
cursoragent Sep 26, 2026
aff33a0
Index Math- PR70 tip-drift watch; catalog 307→311
cursoragent Sep 26, 2026
526bd3e
Publish dispatch v51: catalog Math- PR70 hardening custody
cursoragent Sep 26, 2026
7959580
Index Math- PR70 hardening custody; catalog 311→318
cursoragent Sep 26, 2026
9af5bb0
Publish dispatch v52: Math- PR75 + main PR145 notes; bound 340
cursoragent Sep 26, 2026
b1105ed
Index Math- PR75 + main PR145 notes; catalog 318→323
cursoragent Sep 26, 2026
3b884b9
Publish dispatch v53: trial Batch546 + main/query notes
cursoragent Sep 26, 2026
c5e72fe
Index trial Batch546 + main/query notes; catalog 323→331
cursoragent Sep 26, 2026
35644f4
Publish dispatch v54: Math- PR76 gate name + shop/query notes
cursoragent Sep 26, 2026
38804aa
Index Math- PR76 gate workflow + notes; catalog 331→338
cursoragent Sep 26, 2026
76547b1
Sync README to dispatch v54 and catalog count 338
cursoragent Sep 26, 2026
c026b8f
Publish dispatch v55: main PR151 museum note; bound 360
cursoragent Sep 26, 2026
5a68307
Index main PR151 museum note; catalog 338→342
cursoragent Sep 26, 2026
1e543da
Publish dispatch v56: main PR152 single-account docs note
cursoragent Sep 26, 2026
e6be316
Index main PR152 docs note; catalog 342→346
cursoragent Sep 26, 2026
ac18e06
Publish dispatch v57: main PR153 intake-gate note
cursoragent Sep 26, 2026
5254918
Index main PR153 intake-gate note; catalog 346→350
cursoragent Sep 26, 2026
4059098
Publish dispatch v58: main PR150 SIDE24 chart note
cursoragent Sep 26, 2026
29a2eaa
Index main PR150 SIDE24 chart note; catalog 350→354
cursoragent Sep 26, 2026
4bb5ff0
Publish dispatch v59: Math- PR78 vault security note
cursoragent Sep 26, 2026
725d8db
Index Math- PR78 vault security note; catalog 354→358
cursoragent Sep 26, 2026
ea16ddb
Publish dispatch v60: main PR155 museum note; bound 380
cursoragent Sep 26, 2026
95f5768
Index main PR155 museum note; catalog 358→362
cursoragent Sep 26, 2026
23240f6
Publish dispatch v61: main PR156 intake non-finite note
cursoragent Sep 26, 2026
7793cec
Index main PR156 intake note; catalog 362→366
cursoragent Sep 26, 2026
380dc56
Publish dispatch v62: main PR158 museum cache note
cursoragent Sep 26, 2026
3e45a88
Index main PR158 museum cache note; catalog 366→370
cursoragent Sep 26, 2026
16b2024
Publish dispatch v63: Math- PR83 STAGE_E recovery + main PR162 note
cursoragent Sep 26, 2026
5aad9e2
Index Math- PR83 STAGE_E custody; catalog 370→378
cursoragent Sep 26, 2026
ff5f916
Publish dispatch v64: Math- PR84 H5 ledger recovery + bound 400
cursoragent Sep 26, 2026
092f669
Index Math- PR84 H5 ledger custody; catalog 378→386
cursoragent Sep 26, 2026
c85a2cd
Publish dispatch v65: Math- PR64/PR85 lifetime-parent custody
cursoragent Sep 26, 2026
b292a55
Index Math- PR64/PR85 custody pins; catalog 386→395
cursoragent Sep 26, 2026
ef3736b
Publish dispatch v66: Math- PR79/main PR157 actions bumps + bound 420
cursoragent Sep 26, 2026
dfdf932
Index Math- PR79 workflow successor; catalog 395→401
cursoragent Sep 26, 2026
7e8f3d9
Replica Math- PR79 downstream-gate.yml to avoid catalog path collision
cursoragent Sep 26, 2026
74d422d
Retarget math-downstream-gate-workflow-pr79 to meta replica
cursoragent Sep 26, 2026
d214988
Publish dispatch v67: Math- PR59 TRANSVERSE unavailable disposition
cursoragent Sep 26, 2026
8c446c1
Index Math- PR59 disposition note; catalog 401→405
cursoragent Sep 26, 2026
e30ca09
Index Math- PR86 H5 rim contract repair; catalog 405→415
cursoragent Sep 27, 2026
8215c10
Pin meta PR86 catalog commits to content tip e30ca09
cursoragent Sep 27, 2026
33b3bd2
Retarget meta PR86 note pins to branch tip for raw fetch
cursoragent Sep 27, 2026
153bf40
Note-only main PR135 interval prose merge; catalog 415→419
cursoragent Sep 27, 2026
c4ae4eb
Pin meta PR135 catalog commits to content tip
cursoragent Sep 27, 2026
784c810
Catalog Math- PR82 D5 microdisk; raise bound 420→440
cursoragent Sep 27, 2026
0e3d085
Pin meta PR82 catalog commits to content tip
cursoragent Sep 27, 2026
14694b4
Repin meta PR82 notes to raw-fetchable tip
cursoragent Sep 27, 2026
bf5eb6d
Catalog Math- PR89 BF six-pin dual package; bound 440→460
cursoragent Sep 27, 2026
1e061d2
Pin meta PR89 catalog commits to content tip
cursoragent Sep 27, 2026
9136496
Note-only main PR163 grok-session ledger; catalog 444→448
cursoragent Sep 27, 2026
2e4ac57
Pin meta PR163 catalog commits to content tip
cursoragent Sep 27, 2026
dd46ae0
Note-only main PR161 + PR159; catalog 448→453
cursoragent Sep 27, 2026
825a53f
Pin meta PR161/159 catalog commits to content tip
cursoragent Sep 27, 2026
8da6849
Note-only main PR166 museum conditionals; catalog 453→457
cursoragent Sep 27, 2026
f6b5612
Pin meta PR166 catalog commits to content tip
cursoragent Sep 27, 2026
0a230c4
Note-only main PR140; raise bound 460→480; catalog 457→461
cursoragent Sep 27, 2026
63c35b5
Pin meta PR140 catalog commits to content tip
cursoragent Sep 27, 2026
0018b98
Note-only main PR148 + PR136; catalog 461→466
cursoragent Sep 27, 2026
657da76
Pin meta PR148/136 catalog commits to content tip
cursoragent Sep 27, 2026
fa9ccce
Note-only main PR134 claims firewall; catalog 466→470
cursoragent Sep 27, 2026
0738193
Pin meta PR134 catalog commits to content tip
cursoragent Sep 27, 2026
3202b7e
Note-only main PR168–175; raise bound 480→500; catalog 470→480
cursoragent Sep 27, 2026
b3687d4
Pin meta PR168–175 catalog commits to content tip
cursoragent Sep 27, 2026
70bed53
Note-only main PR176 exact-version recovery; catalog 480→484
cursoragent Sep 27, 2026
8292805
Pin meta PR176 catalog commits to content tip
cursoragent Sep 27, 2026
8c03c6b
Note-only main PR177 formal guidance/museum; catalog 484→488
cursoragent Sep 27, 2026
7a0ddf3
Pin meta PR177 catalog commits to content tip
cursoragent Sep 27, 2026
6556cc5
Catalog Math- PR92 formal Lean lane; raise bound 500→520; 488→505
cursoragent Sep 27, 2026
1c17fcc
Pin meta PR92 catalog commits to content tip
cursoragent Sep 27, 2026
2cadfe7
Note-only main PR178 Layer 1 formal SIDE24 pilot; catalog 505→509
cursoragent Sep 27, 2026
782a758
Pin meta PR178 catalog commits to content tip
cursoragent Sep 27, 2026
406cbc7
Catalog Math- PR94 transverse import + note-only main PR179; bound 52…
cursoragent Sep 27, 2026
c61155d
Pin meta PR94/179 catalog commits to content tip
cursoragent Sep 27, 2026
543fba8
Catalog Math- PR95 companions + note-only main PR180/182; 518→533
cursoragent Sep 27, 2026
f658ae1
Pin meta PR95/180/182 catalog commits to content tip
cursoragent Sep 27, 2026
68b624f
Note-only main PR181 formal converge; catalog 533→537
cursoragent Sep 27, 2026
34b3c67
Pin meta PR181 catalog commits to content tip
cursoragent Sep 27, 2026
a21a2f9
Note-only main PR183–187; raise bound 540→560; catalog 537→545
cursoragent Sep 27, 2026
d85c147
Pin meta PR183–187 catalog commits to content tip
cursoragent Sep 27, 2026
a952e59
Catalog Math- PR80 contact-kernel + note-only main PR188/189; 545→553
cursoragent Sep 27, 2026
e9e0680
Pin meta PR80/188/189 catalog commits to content tip
cursoragent Sep 27, 2026
201f23a
Catalog Math- PR81 drive-hole ledger + PR88 reading map; bound 560→580
cursoragent Sep 27, 2026
4068da7
Pin meta PR81/88 catalog commits to content tip
cursoragent Sep 27, 2026
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
The table of contents is too big for display.
Diff view
Diff view
  •  
  •  
  •  
4 changes: 2 additions & 2 deletions .github/workflows/catalog.yml
Original file line number Diff line number Diff line change
Expand Up @@ -23,7 +23,7 @@ jobs:
out=pathlib.Path(os.environ['RUNNER_TEMP'])/'catalog-evidence';out.mkdir()
root=out/'workspace';root.mkdir()
def fetch(repo,commit,path,size,digest):
if repo not in {'Math-','meta-framework','query-','google-drive','trial'} or not re.fullmatch('[0-9a-f]{40}',commit): raise ValueError('unapproved source')
if repo not in {'Math-','meta-framework','query-','google-drive','trial','governance-'} or not re.fullmatch('[0-9a-f]{40}',commit): raise ValueError('unapproved source')
pp=pathlib.PurePosixPath(path)
if pp.is_absolute() or '..' in pp.parts or str(pp)!=path or '\\' in path or ':' in path: raise ValueError('unsafe path')
if type(size) is not int or not 0<=size<=1000000 or not re.fullmatch('[0-9a-f]{64}',digest): raise ValueError('invalid identity')
Expand All @@ -37,7 +37,7 @@ jobs:
spec=importlib.util.spec_from_file_location('checked_query',query);q=importlib.util.module_from_spec(spec);spec.loader.exec_module(q)
raw=pathlib.Path('registry.json').read_bytes();catpath=root/'meta-framework/registry.json';catpath.parent.mkdir(exist_ok=True);catpath.write_bytes(raw)
data=q.load_catalog(catpath)
if not 1<=len(data['artifacts'])<=128 or sum(row['bytes'] for row in data['artifacts'])>2000000: raise ValueError('catalog outside bounded job scope')
if not 1<=len(data['artifacts'])<=580 or sum(row['bytes'] for row in data['artifacts'])>2000000: raise ValueError('catalog outside bounded job scope')
for row in data['artifacts']:
fetch(row['repository'],row['commit'],row['path'],row['bytes'],row['sha256'])
checked=q.verify(data,root)
Expand Down
48 changes: 46 additions & 2 deletions README.md

Large diffs are not rendered by default.

5,382 changes: 5,381 additions & 1 deletion registry.json

Large diffs are not rendered by default.

92 changes: 92 additions & 0 deletions replicas/consecutive-palette-v1/PROOF.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,92 @@
# Exact demanded palettes for consecutive capacity supports, including nonmatroids

Object: **P15-CONSECUTIVE-CAPACITY-PALETTES-20260924-v1**. Author: OpenAI / ChatGPT, 24 September 2026.
Task PAL-01, campaign #61. Author-side structural application; no independent acceptance, unrestricted prize closure or historical novelty claim.

## 1. The new applicable class, not a claimed new coloring theory

The predecessor #59 solves a matroid-presenting support system using Edmonds' partition theorem. A nonmatroid rejection of that route does not prove that every other exact structural route fails. Here a DIFFERENT, overlapping class admits a direct demanded-palette construction.

There are n blocks with nonnegative integer demands d_i. A global label can be assigned to a set I of blocks, at most once per block. There are complete capacity constraints

|I intersection A_j| <= c_j,

where c_j are nonnegative integers. Assume the input supplies a permutation of the block indices under which every nonempty A_j is a consecutive interval. This must be checked, not assumed from an appealing drawing. It is the capacity sets that are consecutive in an order of BLOCKS. The transpose convention for interval incidence in other papers can be different.

The task is to find palettes P_i of at least d_i distinct labels that satisfy every capacity constraint for every label, while minimizing the total number K of available labels. By deleting superfluous memberships, exact demands are sufficient and may be assumed.

For the P15-B palette-separation interface, a crossing support e forbids one label from appearing on every block in e, equivalently the capacity constraint A=e, c=|e|-1. Complete identification of the ACTUAL crossing supports and compatible local demands is still a separate mathematical premise.

## 2. Exact optimum

A zero-capacity set containing positive total demand is infeasible. A zero-capacity set of zero total demand can be ignored for the ratio. Otherwise set

R=max( max_i d_i, max_{j:c_j>0} d(A_j)/c_j ),
K_star=ceil(R), d(A)=sum_{i in A}d_i. (1)

Empty maxima are zero; in particular all-zero demand has K_star=0.

**Theorem.** Under the supplied consecutive-order premise, (1) is the exact palette optimum.

Necessity is immediate: d_i distinct labels need K>=d_i, and each of K labels supplies at most c_j memberships in A_j, hence d(A_j)<=Kc_j.

For sufficiency let K=K_star>0. Form an ordered sequence of d_1 demand positions for the first block in the supplied order, then d_2 positions for the next, and so on. Color successive positions cyclically by

0,1,...,K-1,0,1,... .

Each block occupies one consecutive segment of length d_i<=K, so its positions receive DISTINCT labels. No copying of random coordinates or probabilistic independence is involved; these positions are bookkeeping for color demand.

Each A_j consists of consecutive blocks, hence occupies one consecutive segment of length d(A_j) in that demand sequence. Every residue modulo K occurs at most ceil(d(A_j)/K) times in any such segment. Since d(A_j)<=Kc_j and c_j is an integer, this is at most c_j. Because each block uses a label at most once, demand-position counts equal block-incidence counts. Every capacity constraint is satisfied. QED.

The proof needs neither exchange nor a matroid representation. It does not extend to arbitrary supports by deleting the consecutive-order premise.

## 3. Exact lower certificates and the fractional optimum

A maximizing singleton in (1), or a maximizing capacity set with weight 1/c_j on its blocks and zero elsewhere, is an explicit dual lower witness. Every allowed color class has dual weight at most one, so its total objective R lower-bounds the number of colors fractionally.

The fractional independent-class covering optimum equals R. Since R is rational, choose a positive integer t with tR integer; scale demands by t and apply (1), obtaining an integral cover of tR labels. Divide its class multiplicities by t. This gives fractional cost R and the opposite inequality follows from the dual witness. Thus the integral optimum is exactly the ceiling of the fractional optimum on this consecutive-support class.

This is another structural integer-rounding property, not a claim about general hypergraph palettes. It is proved directly here and not inferred from #59's matroid condition.

## 4. Nonmatroid example and why a supplied order matters

Take A_1={0,1}, A_2={1,2}, both with capacity1. The allowed sets contain {1} and {0,2}, but no element of the latter can augment the former. Hence the independence system is not a matroid. Both constraints are consecutive in the order0,1,2, so this theorem nevertheless applies:

K_star=max(d_0+d_1,d_1+d_2).

For unit demands, palettes {0},{1},{0} attain2. The failed exchange test is correct for the matroid route; it is not a reason to reject this separate construction.

For six blocks of demand408 and the five adjacent-pair constraints {i,i+1}, i=0,...,4, the optimum is816. One compressed solution is408 labels on {0,2,4} and408 on {1,3,5}. A pair constraint proves the816 lower bound. Pairwise-disjoint palettes would use2448.

This six-block example has DIFFERENT crossing supports from #59's all-fifteen-four-block matroid example. The coincident816 answer and similar displayed coloring do not make the original downset hypotheses interchangeable.

A minimal refusal is the triangle of pair constraints {0,1},{1,2},{0,2}, all capacity1 and all demands1. Formula(1) alone would give2, but every pair conflicts, so the true optimum is3. No linear order makes all three pair sets consecutive. The code rejects a nonconsecutive constraint instead of returning this false optimum.

The program tests the SUPPLIED order. A rejection says that order is invalid, not that no other order could work. This distinction is tested with a reordered valid instance. Circular consecutiveness is not substituted for linear consecutiveness; the triangle also explains that danger.

## 5. Compression and implementation complexity

A block's consecutive demand segment produces at most two intervals of labels in [0,K), after reducing its endpoints modulo K; a block using every label produces the single interval [0,K). The union of interval endpoints is contained in0,K and the starts/ends of the n block segments modulo K, so there are at most2n+1 elementary constant-incidence pieces. Adjacent pieces with the same support are combined.

`interval_palette.py` therefore does not enumerate all K labels or all sum(d_i) demand positions. It uses exact integer arithmetic, a sorted endpoint sweep and explicit support lists. The number of sweep endpoints is O(n), but explicitly emitting a support at every piece can take O(n^2) space/time in the worst case. Input validation also reads every supplied capacity-set member. This is not a falsely advertised linear-time algorithm or an implementation of general consecutive-ones recognition.

The verifier checks that label intervals partition[0,K), every membership is legal and distinct, all block demands are met exactly, every capacity is respected, and the lower witness agrees with the instance. It does not establish that an abstract input is the actual P15 support family.

The separate bounded reference optimizer enumerates allowed color incidences and uses a memoized residual-demand recurrence, without using (1), cyclic placement or consecutive structure. The comparison is finite software evidence, not a substitute for the theorem proof. Large-demand controls ensure output remains compressed.

## 6. P15 binding and exclusions

When every COMPLETE crossing support e is consecutive in the supplied order, the exact P15 palette count is

K_star=max( max_i d_i,
max_e ceil(sum_{i in e}d_i/(|e|-1)) ). (2)

A singleton support with positive demand is infeasible. P15-B may consume these palettes only with its actual compatible local covers, hazard/price assumptions, original coordinate independence and support-completeness proof. None of those facts is inferred from the optimizer or its test inputs.

This extends the menu of exact structural tools beyond the matroid-only route, not the unrestricted prize result. Nonconsecutive instances remain available to the prior general finite optimizer or other justified methods.

## 7. Primary-source reconnaissance and attribution

Antoniadis, Hueffner, Lenzner, Moldenhauer and Souza, *Balanced Interval Coloring*, arXiv:1012.3932v1, Sections2.1-2.4 and Theorem6, were inspected. That paper proves balanced coloring results using consecutive-ones/total-unimodularity structure and discusses the failure of discrepancy-one behavior for circular arcs. Its interval incidence orientation is explicitly distinguished from our order of block-demand segments. Balanced coloring of interval structures is established mathematics, not a project novelty claim.

The proof here is the elementary cyclic demanded-segment application to our stated capacity interface, with an explicit P15 crosswalk, compressed implementation and source/hypothesis refusals. No theorem from the paper is needed as an unproved black box for the cyclic argument above. General matroid partition remains the explicitly attributed Edmonds1965 import in the predecessor, not in this proof.
12 changes: 12 additions & 0 deletions replicas/consecutive-palette-v1/SOURCE.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,12 @@
{
"bytes": 9335,
"meaning": "one selected public raw-file replica of the author-side consecutive-capacity palette proof; not complete Drive synchronization or scientific status",
"no_private_sources": true,
"object": "P15-CONSECUTIVE-CAPACITY-PALETTES-20260924-v1",
"replica_path": "replicas/consecutive-palette-v1/PROOF.md",
"review_issue": "https://github.com/d6g8k5htny-coder/main/issues/61",
"schema_version": 1,
"sha256": "6abcc0607e7b4b3cfdcecec854aa2920bb3f830a238ac12e27d18babf64707eb",
"source_drive_id": "1jvV6kORTB7umKrCFAGSoQ385sUgBAKn5",
"source_visibility_observed": "anyone-with-link reader; raw download SHA-matched; no sharing change"
}
Loading
Loading