Back to Minimaverse

Minima Protocol Architecture

Edge consensus, Tx-PoW, and lightweight full-node infrastructure

📚 Primary Sources

Status indicators:• confirmed• in-development• community-maintained

📋About This Page

This page provides a technical overview of the Minima Protocol architecture, including edge consensus, Tx-PoW mechanics, data structures, and protocol layers. All information is compiled from publicly available documentation and whitepapers, presented in a neutral, developer-focused format for educational purposes.

🌐Edge Consensus Architecture

Minima implements edge consensus, where block production and validation are carried out by every device connected to the network. Unlike traditional blockchains that rely on specialized miners or validators, Minima supports universal participation: smartphones, Raspberry Pi, and IoT devices are intended to participate in network validation without specialized hardware requirements.

Architectural characteristic: Through collaborative Tx-PoW, the complete blockchain state remains compact (~300 MB RAM), allowing any device to store and verify the entire chain history independently.

Source: Consensus, Forks and Immutable Protocols 

⛏️Tx-PoW: Collaborative Proof of Work

How Tx-PoW Works

Each transaction in Minima performs a small amount of Proof of Work (~10 seconds average work per device). When a Tx-PoW value meets the network difficulty threshold (~1 block every 50 seconds), that transaction also mines a block. Blocks store only transaction hashes (~10 KB per block), reducing on-chain storage requirements.

Security Through Collaboration

Minima nodes collaborate rather than compete. The total network security equals the sum of all individual Tx-PoW contributions. Increased Tx-PoW participation contributes to aggregate network security. This cooperative approach reduces competitive mining overhead associated with proof-of-work race conditions.

Source: Tx-PoW Documentation 

🗄️Efficient Data Structures

Cascading Chain with Superblocks

Minima's Cascading Chain structure efficiently manages blockchain growth through Superblocks. This approach keeps the chain compact and scalable without sacrificing security, enabling fast synchronization even on resource-constrained devices.

Learn more: The Cascading Chain 

Merkle Mountain Range (MMR) UTXO

Minima utilizes a Merkle Mountain Range database to store only the UTXOs relevant to each node's private keys. This "storage-less" approach allows each node to operate with just ~300 MB RAM, reducing hardware requirements for node operation.

Source: MMR Database Documentation 

🧱Protocol Layers

LayerFunctionStatus
Minima (L1)Value transfer; flood-fill P2P backbone; all nodes validate all transactionsconfirmed
MaximaCommunication layer; point-to-point off-chain messaging between connected peersconfirmed
OmniaLayer 2 scaling; bi-directional payment channels (Lightning Network-style)in-development
MiniDapps (L3)Decentralized applications using value transfer (Minima) + messaging (Maxima) + scaling (Omnia)confirmed

Source: Network Overview 

⚙️Technical Specifications

Tx-PoW Difficulty

~10 seconds average work per transaction; ~1 block every 50 seconds network-wide

Block Size

~10 KB (stores transaction hashes only); adaptive based on network activity

RAM Requirement

~300 MB per node using MMR UTXO storage optimization

Consensus

GHOST protocol for fast block times with secure finality

Quantum Resistance

KECCAK hashing + WOTS signatures for post-quantum security

Source: Core Features Overview 

👥Network Participation Requirements

To maintain network health and personal security, Minima users should connect their node at least once per week. This ensures:

  • Updates to MMR proofs for owned UTXOs
  • Contribution to collective Tx-PoW security
  • Synchronization with the latest chain state

Note: The protocol design aims to allow all users to operate complete validating nodes without reliance on specialized validator classes.

⚠️Disclaimer:This site does not represent the official Minima team. All information is compiled from publicly available sources. Learn more

Last updated: May 19, 2026