Research for Answerable Computing.
Glyph Standard studies how consequential machine transactions remain answerable across control boundaries. Bulla is its shipped system. The work below is research, not released Bulla capability. Executable experiments identify their repository-source implementations and evidence.
No orphaned consequence. No silent discharge.
A consequence names its eligible predicate and authority. Defeated evidence leaves declared dependents recheckable or unresolved rather than silently cleared.
Research areas
Records and history
RESEARCH · SOURCE_ONLY
Retained history · What did a witness commit to, and can incompatible signed commitments be established?
same-size fork established
Evidence →EXPERIMENT · SOURCE_ONLY
Recomputes a historical judgment and later correction from retained artifacts.
10,000 review-all → 5,000 required · 0 incomplete cleared
Evidence →Dependency and correction
RESEARCH · SOURCE_ONLY
Correction and recall · Which later judgments require review?
5,000 review · 5,000 no declared path · 0 incomplete cleared
Evidence →Composition and consequence
EXPERIMENT · SOURCE_ONLY
Combines witnessed history and declared lineage.
2,500 declared paths to recheck
Evidence →EXPERIMENT · SOURCE_ONLY
Combines transaction records, fault evidence, covenant terms, and consequence authority.
verified authorization · reported Test-ledger attempt · D0
Evidence →EXPERIMENT · SOURCE_ONLY
Tests whether independently scoped public evidence shares an authenticated event binding.
unbound public evidence → ESCALATE
Evidence →EXPERIMENT · SOURCE_ONLY
Tests one receiver-owned effect behind one target-side verification and grant-consumption path.
direct call rejected · 1 grant / 1 committed effect
Evidence →Profiles
Foundational and historical work
Res Agentica develops foundational research on machine institutions. Glyph Standard develops Bulla and publishes applied research for Answerable Computing.