Optimum

Optimum breaks every block into coded pieces and spreads them across the network. Any sufficient handful rebuilds the whole, so blocks survive heavy loss and still arrive. Far less travels than in flooding, and the network runs near its capacity even under loss.

rlnc fundamentals

RLNC Fundamentals

Every coded piece counts the same: none is the original, none is a backup, and any sufficient set rebuilds the block.

rlnc properties

Three Key Properties

Three properties make coded gossip beat traditional erasure codes for a blockchain.

• Relay without decoding: a node can forward fresh coded pieces it never had to unpack, so multi-hop delivery stays cheap
• Loss tolerance: any sufficient set of pieces recovers the block, under any pattern of drops
• Near-zero overhead: only a small coding tax rides on top of the payload

mump2p

The mump2p Protocol

Optimum runs coded gossip as a mesh protocol: pieces flow, peers suppress duplicates and pull what they miss, and the block decodes the moment enough arrive.

optimality

Capacity-Approaching Throughput

Older chains flood the network with the same data along every path. Optimum refuses the waste: it approaches the network's capacity, even under packet loss.

network security

Network Security

Each piece is signed by its producer, so a forged or poisoned shard is caught on arrival and the sender is pruned from the mesh.