← Back to ASI Chain Runtime Environment
Responsible: Greg Meredith, Mike Stay
Papers: Meredith, Goertzel, Warrell, Vandervorst (2023), Meta-MeTTa (compilation to rho-calculus); Goertzel (2025), Hyperon Whitepaper §2.5, §3.4–3.5, §3.8; Goertzel (2025), TrueAGI State Management Platform
GitHub: asi-chain, F1R3FLY-io (org), MeTTa-IL, MeTTaTron
Documentation: docs.asichain.io
Status: ASI Chain infrastructure is under active development. The F1R3FLY engine, Rholang runtime, and MeTTa-IL compiler exist as in-progress implementations. MeTTaCycle integration with PeTTa and ChromaDB is operational in prototype. The full decentralized cognitive execution pipeline (inference settlement, CRDT state management, multi-party governance) is on the development roadmap.
This card provides technical depth beyond the concise ASI Chain index card and its subcards (F1R3FLY, MeTTa-IL, MeTTaCycle). ASI Chain is the blockchain runtime environment for decentralized AGI — a Layer 1 execution fabric designed for the massive, concurrent, graph-based workloads that cognitive systems produce.
Dual-Engine Architecture. ASI Chain is powered by two complementary engines:
MeTTa-IL Routing. MeTTa-IL (Intermediate Layer) is the bridge between MeTTa programs and execution targets. It performs semantic analysis and determines routing:
MeTTa-IL is grounded in reflective higher-order pi-calculus with Object-Capability (Ocaps) security — access rights are unforgeable and mathematically verifiable. MeTTa-IL uses BNFC grammars to define algebraic theories (Monoid, Rig, Group, etc.) as module specifications, enabling formal verification of the compilation target.
RSpaces and Storage. F1R3FLY uses reified RSpaces and MORK PathMaps (specialized Merkle Tries) for programmable storage with high-efficiency structure sharing. LMDB provides durable low-latency persistence. RSpaces treat storage as a reactive system rather than static buckets — functioning simultaneously as blockchain, file system, or vector database depending on access patterns.
Any Internet-facing computational service must protect against denial-of-service attacks. Ethereum's solution — metering each virtual machine step with gas tokens — demonstrated that economically secured computation can scale to millions of transactions. Meta-MeTTa §6 applies this same principle to MeTTa's operational semantics, defining effort objects (EOs) as the native resource metering mechanism for decentralized MeTTa execution.
Formal Definition. The standard four-register MeTTa state \(\langle i, k, w, o \rangle\) is extended to a five-register model:
\[\langle i, k, w, o;\; eos \rangle\]where the fifth register \(eos\) contains terms of the form \((h(p)\; eo)\), pairing a private-key-derived identity function \(h(p)\) with an effort object balance \(eo\). A polymorphic cost function \(\#\) maps terms to EO costs, and the EO domain forms a commutative group under \(+\) and \(-\), supporting additive accounting across transitions.
Resource-Bounded Transitions. Every rewrite rule in MeTTa's operational semantics is reprised with resource guards. A transition is permitted only when sufficient EOs remain: the cost \(c\) of each operation (computed from substitution sizes and result terms) must satisfy \((e + e') - c > 0\), where \(e\) is the EO balance carried by the triggering term and \(e'\) is the account balance in the \(eos\) register. If the balance is insufficient, the transition is blocked (the term remains unchanged and the account is preserved). Each term carries a cryptographic signature \(t_{\chi(p, eo)}\) binding it to its owner's identity and EO allocation.
Metered Operations. All six rewrite rules (Query, Chain, Transform, AddAtom, RemAtom, Output) and all builtin operations (Boolean, numeric, and string arithmetic) are metered. The cost of a Query or Chain includes the sum of unification costs \(\sum_i \#(\sigma_i)\) plus the sum of substituted result sizes \(\sum_i \#(u_i \sigma_i)\). Storage operations (AddAtom, RemAtom) cost \(\#(t)\) proportional to the stored term's size. This ensures that every computational and storage step on the decentralized network has a well-defined, verifiable price.
Compilation Correctness. The Meta-MeTTa paper proves that this resource-bounded semantics compiles correctly to Rholang. Theorem 2 establishes that resource-bounded MeTTa computations are bisimulation-equivalent to their Rholang translations: \(S_1 \approx S_2 \Leftrightarrow [\![S_1]\!]_M \approx [\![S_2]\!]_M\). The translation maps the \(eos\) register to a dedicated Rholang channel \(c\), with each transition checking and updating balances via channel reads and writes. When EOs are exhausted, the Rholang translation preserves the term and balance unchanged — graceful degradation rather than crash.
The State Management Platform design document describes the formal underpinnings for ASI Chain's cognitive state management:
These foundations are described in the design document as the proposed mathematical architecture; the current implementation uses simpler mechanisms while this infrastructure is built out.
The whitepaper describes ASI Chain as targeting native inference settlement — verifying cognitive state transitions (reasoning steps) rather than just token transfers. The effort object mechanism provides the economic foundation: each inference step costs EOs proportional to its computational complexity, and the metered Rholang translation ensures that the blockchain can verify both the correctness of the inference and the proper deduction of resources. This means the blockchain can verify that a PLN inference chain is valid, that a self-modification satisfies admission certificates, or that a transferred skill maintained its SubRep guarantees. This capability depends on the full MeTTa-IL → F1R3FLY compilation pipeline being operational.
Related cards: MeTTa Full · DAS Full · PRIMUS Full