Established in scope
Complete binary three-interface classification
In the question: Observable reality: minimal conditions and counterworlds
Complete bounded classification of three binary interfaces; no particle/generation/dimension interpretation. One-shot consistency does not force a fixed order.
Read the exact result, assumptions and evidence
Result
Of 4096 no-self-influence candidates,744 are uniquely consistent under all64 local one-shot contexts.488 are acyclic; each of the remaining256 has an explicit reversible local two-copy control with zero or two fixed points (128 each). All744 process/order entries and256 witnesses were independently reproduced. The488 positive cases analytically work for all replica counts and arbitrary joint deterministic controls.
Required assumptions
- Finite deterministic processes with full joint replica control
Supply finite nonempty local input/output sets and total w:product O->product I. Every finite number of coordinatewise independent replicas allows every joint deterministic map I_k^M->O_k^M at corresponding interfaces, including constants/erasure. Require at least one global solution for every such experiment; do not assume a global order.
Original evidence
- PROOF.txt lines 84–148
Source checked at this snapshot
Original location and fingerprint
experiments/theory-contracts/foundational-process-classification-20261016/PROOF.txt
c478329caf5bfa8bbf69bf066745e9bbb9908d4652d52a428e04b6992bc385fa
- classify_composable.py lines 1–63
Source checked at this snapshot
Original location and fingerprint
experiments/theory-contracts/foundational-process-classification-20261016/classify_composable.py
7e6cbf827c6367cd88b0f75340175729274dc15ae64177f287df2846a5ebbc72
finding:three-binary-processes-two-copy-reversible-classification