Protocols and papers
State Transition Protocol v1.2 Candidate
The working version of the State Transition Protocol: a candidate concurrency, consequence, and exploration profile that proposes changes to STP v1.1.
PROPOSED ยท owner review required
- Printed title
- State Transition Protocol v1.2 Candidate: Concurrency, Consequence, and Exploration Profile
- Format
- Word document (.docx)
- Date
- 12 August 2026
- Structure
- 16 numbered sections, Appendix A (source and identity register) and Appendix B (verification packet)
What it means
Probabilistic systems may explore broadly. Deterministic, versioned gates control consequences. Independent observation records what happened, and append-only receipts preserve attempts and outcomes.
Consequential autonomy increases only when observation, settlement, and recovery capacity are measured in the same unit and remain within bound.
This is a proposal and research instrument, not a certification, deployment authorization, or accepted replacement for STP v1.1.
Candidate thesis
This proves agreement for those bytes and implementations. It does not prove schedule equivalence or semantic truth.
Section 6.1, Deterministic replay
How it functions
Read it to see exactly what each guarantee covers and where it stops. Section 6 states five separate guarantees: deterministic replay, schedule equivalence, invariant safety, effect safety, and liveness and fairness. Each one says what it establishes and what it does not.
The other sections set out the authority and claim boundary, a plain technical statement, formal objects and notation, the consequence path with a separate receipt for each phase, causal order and canonical replay, the pair and triple gate, exploration pressure against effect pressure with a per-lane backlog recurrence, a deterministic drift vector, neutral confidence, the optimizer and model authority ceiling, non-alias rules for adjacent systems, harness-neutral adapters, conformance evidence, the change record from v1.1, and the acceptance gates.
Appendix B lists each verification lane with what it establishes and what remains outside the claim. The public reproduction packet in this repository is a separate, minimized executable release from the same v1.2 research: it runs synthetic cases in JavaScript and Python, overlaps this document on concurrency and effect finality, adds profiles this document does not contain, and is not the complete draft.
Status and claim boundary
Working version, under owner review. The document's own control block reads PROPOSED; owner review required, and its baseline line reads STP v1.1 remains current; no silent supersession. Formal acceptance waits on the acceptance gates in section 16, ending in an append-only owner receipt (ACCEPT, ACCEPT_WITH_LIMITS, DEFER, REJECT, or SUPERSEDE). Until that receipt exists, the correct state is PROPOSED, and STP v1.1 remains the formal baseline.
Its evidence is a dual JavaScript and Python harness over synthetic fixtures. Passing those fixtures shows agreement for the enumerated synthetic records only. It does not establish all deltas, all schedules, live external effects, global confluence, fairness, or semantic truth. In Appendix B, termination is UNKNOWN and Ledger identity is BLOCKING.