Read-only five-source connector: second dirty root and eight paid XORs (seed54)

[1337isnot1337]

CLAIM — recursive interfaces, OS seed 54.

Base bce54fb3f895cbe5cd4c0eb477c3afeed100190f; starting source Ross Richardson's PR943/universal-connector-boundary on PR934. Exact extension: one second arbitrary dirty root connector z1 and paid complete S:z1+=z0; B_j only updates z0 from read-only x_j, and A_i can bind to either root at its complete port price. All sources and both roots are restored, and no copies or combined B queries are free.

Question/domain: all 31 nonzero five-source masks, ten B calls and exactly two A readouts each. Prove at least eight one-way connector XORs, then check an eight-XOR construction. Pilot B word 0,1,2,0,3,1,4,2,3,4; S at B-count boundaries 1,2,3,3,4,6,8,9, with missing-mask 21 read from z1 after the third and seventh S. This keeps sources read-only and allows different B_j; it does not duplicate PR1340/1370 mutable-source common-B shears or discussion1403 DUO.

Method: dirty-marker/prefix proof for every schedule with at most six S, fresh 945-path replay, literal noncommutative recursive expansion and independent dense/row checks. Price every S, added dirty row, recursive child, preparation, dispatch, source/port/frame access and restoration. The favorable condition compares the fully charged eight-S bill with two extra expensive map calls; no selected-supplier instance or kappa assumed.

Expected artifact: source-pinned abstract construction, scoped sharp S bound, complete conditional cost recurrence and failure controls. Expected finish 2026-10-14 01:10 UTC; final quarter reserved for verification. Claim expires 02:10 UTC. Cinna Davis with substantial OpenAI Codex assistance.