Skip to content
Technology

An architecture built on first principles

YAZIMAO’s stack is designed top-to-bottom: applications on open APIs, execution in a sandboxed runtime, and a consensus layer that separates transaction propagation from finality.

07Application Layer
06API / SDK
05WASM Execution
04State Transition
03Consensus
02P2P Network
01Storage

Conceptual stack — layer boundaries follow YAZIMAO’s protocol design (see the architectural decision records).

Core systems

Six systems, one coherent network

Each system has a clear protocol boundary. Protocol and consensus design is complete and frozen — validator set & votes, DAG, Random Witness, Finality & Precommit QC, Checkpoint, and Fork Choice (steps 10-1..10-14). Labels: \u2018Design Frozen\u2019 = specification complete & frozen; \u2018In Development\u2019 = implementation in progress; \u2018Planned\u2019 = not started. Nothing here is deployed or live.

Design Frozen

Consensus

PoS + DAG + BFT

A proof-of-stake validator set secures the network, DAG structures organize transaction propagation in parallel, and BFT finality produces a deterministic, final ordering.

  • Validator set with weighted voting power
  • DAG transaction / mempool propagation
  • BFT finality with explicit finalization
  • Finality states: Pending → Confirmed → Finalized
In Development

Network

P2P

A permissionless peer-to-peer layer for node discovery, encrypted transport, gossip, and block/transaction sync — hardened against eclipse, sybil, and spam.

  • Peer discovery & identity
  • Encrypted, authenticated transport
  • Gossip with rate limiting & size limits
  • Reputation, backoff & banning
In Development

Storage

Decentralized

Two storage concerns, cleanly separated: a verifiable on-chain state layer, and an off-chain decentralized storage network for large data.

  • Sparse Merkle tree state roots & proofs
  • Atomic, crash-recoverable state persistence
  • Content-addressed off-chain storage
  • Light nodes verify state with proofs
Planned

Compute

Decentralized

An open compute network where tasks are registered on-chain, results committed and settled — heavy computation happens off-chain.

  • On-chain task registration & escrow
  • Off-chain execution
  • Result commitment & settlement
  • Independent subsystem (not L1 consensus)
Planned

Execution

WASM

Deterministic, sandboxed execution through a WASM runtime. Contracts can never run forever — everything is metered and constrained.

  • WASM runtime with host interface
  • Gas / execution / memory limits
  • No file, network, or system access
  • Deterministic same-input same-output
In Development

Security

Security-first

Security is the first priority — before features, before performance. Domain separation, canonical encoding, and strict bounds everywhere.

  • Domain-separated signing contexts
  • Canonical binary encoding
  • Checked arithmetic (u128 balances)
  • Replay protection: chain_id + nonce
Security model

Security before everything

A pragmatic priority that shapes every decision in the protocol: security, then correctness, then recoverability — performance and features come after.

No invented crypto

Only long-reviewed, battle-tested cryptographic libraries. No self-made hashes, signatures, or curves.

Domain separation

Every signing context is separated — transactions, votes, and witnesses can never be replayed across domains.

Canonical encoding

One canonical binary encoding for the whole protocol. No mixed formats between modules.

Checked by default

Integer overflow, fee math, balance sufficiency — all checked. The protocol never silently wraps.

Transparency

Every protocol design decision is recorded in an architectural decision record (ADR) before implementation. Nothing is improvised.