Canonical repository for the ontology, theory, execution architecture, and dissertation framework of Computable Institutions.
This repository formalizes how institutional facts can be made computable without collapsing law, meaning, or governance into software.
It is simultaneously:
- a frozen theoretical substrate,
- an execution-constrained architectural reference,
- and a CUTIP PhD dissertation backbone.
Computable Institutions are institutions whose:
- constitutive rules,
- evidence models,
- execution constraints,
- and failure modes
are represented in explicit, protocol-executable form, such that:
- institutional facts are produced deterministically,
- administrative discretion is structurally constrained,
- corruption relocates into observable and contestable zones,
- failures surface explicitly instead of being absorbed silently.
This project does not claim to eliminate:
- corruption,
- ambiguity,
- human judgment,
- or political conflict.
It makes them measurable, auditable, and governable.
- Define the institutional form
- Specify status-function mappings
(
X counts as Y in context C) - Operate at the level of constitutive rules
- Answer: What does it mean for an institution to exist digitally?
See:
ontology.mddni_theory.mddni_blueprint.md
- Pure execution machinery
- Enforces institutional rules without interpretation
- Cannot legislate, judge, infer intent, or optimize outcomes
- Emits explicit failure only
Answer: How are institutional facts executed and attested without discretion?
See:
sfeu_blueprint.mdsfeu_prototype.md
Institutions define meaning. Execution enforces rules. These must never be conflated.
- Computable Institutions — umbrella concept (this repository)
- DNI — institutional type (ontology + theory)
- SFEU — execution substrate (architecture + prototype)
The term Computable Institutions emerged after DNI because:
- it names the combined achievement: institutional facts that can be executed, audited, and falsified,
- without implying: digital government, blockchain governance, or automation of meaning.
DNI is not obsolete. It is a necessary component of Computable Institutions.
All artifacts in this repository are bound by hard execution axioms defined in:
institutional_execution_axioms.md
Including (summary):
- Institution ≠ execution
- Corruption is conserved, not reduced
- No interpretive execution
- Explicit failure only
- Observability as a design requirement
- Worst-case (Thailand-class) validation
Any artifact violating these axioms is invalid, regardless of elegance.
The minimal MECE institutional–technical stack is defined in:
computable_institutions_stack.md
It spans:
- digital identity, documents, and obligations
- constitutive legal rules
- deterministic rule representation
- SFEU execution
- attestation and audit surfaces
- open transmission (email-class)
- content-addressed storage
- cryptographic integrity
- non-binding AI interpretation only
ontology.mdStatus-Function Ontologydni_theory.mdFormal, falsifiable theory of DNIsinstitutional_execution_axioms.mdNon-negotiable execution constraintscomputable_institutions_stack.mdCanonical stack definition
dni_blueprint.mdTheory → architecture mappingsfeu_blueprint.mdExecution-only blueprintsfeu_prototype.mdArtifact grounding and observability surfaces
corruption_equilibrium.mdCorruption Migration Equilibrium (CME)counterfactuals.mdFalsification and counterfactual worldsfailure_case_canon.mdComparative and adversarial validationsubstrate0_prime_purity_test.mdSubstrate-0′ integrity checks
dnm_methodology.mdDigital-Native Methodology (DNM)evp_v3.mdEvaluation & Verification Protocolmeta_ruler.mdMeta-evaluation constraints
dissertation_frame.mdCUTIP master chapter framepresentation_layer_guide.mdAcademic presentation constraintspresentation_layer_visual_map.md
This work uses Digital-Native Methodology (DNM):
- execution-first
- falsification-forward
- adversarially validated
- architecture-bound
Narrative coherence is never treated as evidence.
Thailand is treated as a worst-case institutional environment:
- high discretion
- norm-driven governance
- corruption-tolerant equilibria
If a construct survives Thailand-class conditions, it generalizes. If not, it is rejected.
This repository is:
- ontology-bound
- execution-constrained
- falsifiable by design
Academic prose, diagrams, and examples are presentation layers only. They do not generate truth.
Fractal Open License (FOL)
Fork freely. Remix without permission. Attribution optional. Preserve structural truth.
Fork-first philosophy.
You may:
- Fork
- Extend
- Apply
- Translate (resonance > literalism)
Pull requests are welcome but not required.