Mathematical Foundations of Opaque State Infrastructure
Mathematical Foundations of Opaque State Infrastructure
Part I: Formal Model (Abstract, Non-Operational)
I.1 Entities and Sets
L — Set of lockboxes
S — Set of stimuli (broadcast inputs)
C — Set of commitments
W — Set of witnesses (bounded proofs)
N — Set of substrate nodes
T — Totally ordered event index (time/order)
I.2 Lockbox Definition
A lockbox ℓ ∈ L is a deterministic state machine:
Where:
- x — private internal state
- δ — deterministic transition function
- R — set of receptor predicates
- K — internal key material
- κ — commitment function mapping state to C
Properties:
- x is never externally observable
- δ is total and deterministic
- R is private and non-discoverable
- κ(x) binds future transitions
I.3 Stimulus Model
A stimulus s ∈ S is a uniform broadcast object with no addressability.
Each lockbox evaluates:
Only if match, authorization is evaluated.
I.4 Authorization and Transition
If R(ℓ, s) = match, then:
Where:
- x′ — new private state
- w ∈ W — bounded authorization witness
The lockbox emits:
I.5 Substrate Event
A substrate event is a tuple:
Substrate nodes verify:
- witness validity,
- ordering monotonicity,
- commitment continuity.
They do not interpret x, s, or δ.
I.6 Bounded Witness Invariant
There exists a global bound B such that:
Verification complexity is bounded and independent of lockbox history length.
I.7 Forgetting (State Collapse)
A lockbox may apply a collapse function:
Such that:
- κ(x̂) remains valid
- prior internal states are irrecoverable
- prior witnesses are non-operational
Externally, collapse is indistinguishable from any other transition.
I.8 Distribution and Integrity
Let N be the set of substrate nodes.
Each node stores:
- commitments C,
- witnesses W,
- ordering T.
No node stores:
- private state x,
- receptor logic R,
- keys K,
- semantic interpretations.
Integrity holds if:
I.9 Key Semantics
Keys are evaluated only inside δ.
Externally:
- all keys are indistinguishable,
- access, destruction, or no-op outcomes produce valid commitments.
No event reveals intent.
I.10 Formal Summary
Part II: Comparative Taxonomy (What This Is and Is Not)
II.1 Versus Public-Key Encryption
| Aspect | Public-Key Crypto | Lockbox Substrate |
|---|---|---|
| Primary unit | Message | State transition |
| Addressability | Explicit sender/receiver | None |
| Metadata | Preserved | Eliminated |
| History | Logged | Optional |
| Proof | Decryption ability | Authorization without meaning |
PK crypto protects content.
This system protects absence of narrative.
II.2 Versus Secure Messaging (Signal, etc.)
| Aspect | Secure Messaging | Lockbox Substrate |
|---|---|---|
| Communication | Point-to-point | Global broadcast |
| Identifiers | Required | None |
| Logs | Exist | Non-semantic |
| Seizure outcome | Recoverable graphs | Commitments only |
II.3 Versus Blockchains / Ledgers
| Aspect | Blockchain | Lockbox Substrate |
|---|---|---|
| Meaning | Global | Local |
| State | Shared | Private |
| History | Mandatory | Optional |
| Transparency | Core feature | Explicitly absent |
| Value | Native | None |
Blockchains distribute meaning.
This distributes integrity only.
II.4 Versus Zero-Knowledge Systems
| Aspect | ZK Proofs | Lockbox Substrate |
|---|---|---|
| Proof scope | Statement validity | Transition authorization |
| State | Often implicit | Explicit but private |
| History | Usually accumulative | Collapsible |
| Semantics | Still defined | Undefined globally |
ZK is a tool this system can use; it is not the system itself.
II.5 Versus MPC / Trusted Execution
| Aspect | MPC / TEE | Lockbox Substrate |
|---|---|---|
| Trust model | Cryptographic or hardware trust | Structural opacity |
| Participants | Defined | Undefined |
| Failure mode | Leakage | Ambiguity |
| Semantics | Known | Unknown |
II.6 Versus Databases / Logs
| Aspect | Database | Lockbox Substrate |
|---|---|---|
| Queryability | Core | Impossible |
| Schema | Required | None |
| Audit | Semantic | Integrity-only |
| Deletion | Exceptional | First-class |
II.7 Unique Structural Properties
This system uniquely combines:
- Broadcast without addressability
- Verification without interpretation
- Integrity without history
- Authorization without attribution
- Destruction without evidence
- Distribution without shared meaning
No existing category subsumes it.
II.8 Taxonomic Characterization
A distributed integrity substrate for private deterministic state machines, operating under a broadcast-only stimulus model with bounded witnesses and optional state collapse, where global verification never yields semantic reconstruction.
Comments
Post a Comment