mhtirogla
Home
Systems
API
Pricing
About
Log in
← Back
Home
›
Systems
›
Blockchain and web3
rollup
L2 rollup
Optimism, zkSync
System
Techniques · 6
Primitives · 24
rollup
Merkle patricia trie
data-structures · medium: Hex-ary Patricia trie with hashed nodes giving state roots and inclusion proofs
Data availability sampling
finance · medium: Erasure-code blocks and let light nodes sample random chunks to confirm data was published
Interactive fraud proofs
finance · medium: Bisection games that narrow a disputed execution to one step verified on chain
Circuit arithmetization
security · medium: Turn computation into constraints for proofs: R1CS, PLONKish gates, AIR, lookups
Polynomial commitment schemes
security · medium: Commit to polynomials and prove evaluations: KZG, FRI, IPA trade-offs
Pairing based cryptography
security · medium: Bilinear pairings on BN254/BLS12-381 curves: Miller loop and final exponentiation
Merkle tree
data-structures · low: Hash tree for verifying and diffing large datasets with logarithmic proofs
Deterministic serialization
finance · low: Canonical byte encodings (RLP, SSZ, canonical CBOR) so every node hashes identical bytes
Keccak sha3
security · low: Keccak sponge (SHA-3, Keccak-256) permutation, padding and absorb/squeeze
Reed-Solomon codes
signal-processing · low: Byte-oriented MDS code: n-k parity symbols correct (n-k)/2 unknown symbol errors or n-k known erasures; the workhorse for bursts, QR codes, discs and storage.
›
Bytecode interpreter
compilers · low: Register/stack VM dispatch loop for executing compiled plans or rules (SQLite VDBE, nftables)
Zstandard (zstd)
compression · low: LZ77 plus Huffman and FSE entropy coding, with levels from LZ4-like speed to xz-like ratio, all decoding at about 1-2 GB/s.
›
Event sourcing
finance · low: Persist state changes as an append-only stream of immutable events per entity; current state is a fold over them, guarded by expected-version appends.
›
ECDSA signatures
security · low: The elliptic-curve signature standardised in FIPS 186-5 (P-256) and used by secp256k1 ledgers; 64-byte signatures, but a repeated or biased nonce leaks the private key.
›
Write-ahead log
storage · low: Append each change to a checksummed sequential log and fsync it before touching data pages; the basis of crash durability in nearly every database.
›
Radix trie
data-structures · low: Compressed prefix tree for path routing, domain matching and prefix lookups
Csprng
security · low: OS-backed cryptographically secure random numbers (getrandom), and when a fast PRNG is not enough
Failure bisection
search-sort · low: Binary search over commits, batches or inputs to isolate a failure
Digital signatures (Ed25519)
security · low: Small, fast, deterministic public-key signatures that prove who produced a message; the default for tokens, releases and protocols.
›
Arithmetic circuits
hardware-os · low: Adder and multiplier circuits: carry-lookahead, prefix adders, Booth encoding, Wallace and Dadda trees
Finite field arithmetic
numerics · low: Prime-field and extension-field arithmetic (Montgomery form, Goldilocks, BabyBear), vectorized
Number theoretic transform
numerics · low: FFT over finite fields for exact polynomial and big-integer multiplication
+ 8 more primitives
System
Techniques · 6
Primitives · 24
rollup
Merkle patricia trie
data-structures · medium: Hex-ary Patricia trie with hashed nodes giving state roots and inclusion proofs
Data availability sampling
finance · medium: Erasure-code blocks and let light nodes sample random chunks to confirm data was published
Interactive fraud proofs
finance · medium: Bisection games that narrow a disputed execution to one step verified on chain
Circuit arithmetization
security · medium: Turn computation into constraints for proofs: R1CS, PLONKish gates, AIR, lookups
Polynomial commitment schemes
security · medium: Commit to polynomials and prove evaluations: KZG, FRI, IPA trade-offs
Pairing based cryptography
security · medium: Bilinear pairings on BN254/BLS12-381 curves: Miller loop and final exponentiation
Merkle tree
data-structures · low: Hash tree for verifying and diffing large datasets with logarithmic proofs
Deterministic serialization
finance · low: Canonical byte encodings (RLP, SSZ, canonical CBOR) so every node hashes identical bytes
Keccak sha3
security · low: Keccak sponge (SHA-3, Keccak-256) permutation, padding and absorb/squeeze
Reed-Solomon codes
signal-processing · low: Byte-oriented MDS code: n-k parity symbols correct (n-k)/2 unknown symbol errors or n-k known erasures; the workhorse for bursts, QR codes, discs and storage.
›
Bytecode interpreter
compilers · low: Register/stack VM dispatch loop for executing compiled plans or rules (SQLite VDBE, nftables)
Zstandard (zstd)
compression · low: LZ77 plus Huffman and FSE entropy coding, with levels from LZ4-like speed to xz-like ratio, all decoding at about 1-2 GB/s.
›
Event sourcing
finance · low: Persist state changes as an append-only stream of immutable events per entity; current state is a fold over them, guarded by expected-version appends.
›
ECDSA signatures
security · low: The elliptic-curve signature standardised in FIPS 186-5 (P-256) and used by secp256k1 ledgers; 64-byte signatures, but a repeated or biased nonce leaks the private key.
›
Write-ahead log
storage · low: Append each change to a checksummed sequential log and fsync it before touching data pages; the basis of crash durability in nearly every database.
›
Radix trie
data-structures · low: Compressed prefix tree for path routing, domain matching and prefix lookups
Csprng
security · low: OS-backed cryptographically secure random numbers (getrandom), and when a fast PRNG is not enough
Failure bisection
search-sort · low: Binary search over commits, batches or inputs to isolate a failure
Digital signatures (Ed25519)
security · low: Small, fast, deterministic public-key signatures that prove who produced a message; the default for tokens, releases and protocols.
›
Arithmetic circuits
hardware-os · low: Adder and multiplier circuits: carry-lookahead, prefix adders, Booth encoding, Wallace and Dadda trees
Finite field arithmetic
numerics · low: Prime-field and extension-field arithmetic (Montgomery form, Goldilocks, BabyBear), vectorized
Number theoretic transform
numerics · low: FFT over finite fields for exact polynomial and big-integer multiplication
Elliptic curve arithmetic
security · low: Point addition, doubling and constant-time scalar multiplication in projective coordinates
Fiat shamir transform
security · low: Make interactive proofs non-interactive by deriving challenges from a transcript hash
Multi scalar multiplication
security · low: Pippenger bucket method for large multi-scalar multiplications on elliptic curves
Big integer arithmetic
numerics · low: Multi-limb integer arithmetic (256-bit and up): carries, Karatsuba, Montgomery and Barrett reduction
CRC32C checksums
hardware-os · low: The Castagnoli CRC-32 with dedicated instructions on x86 (SSE4.2) and ARMv8. It is the standard fast integrity check for storage blocks, logs and network frames.
›
fsync, O_DSYNC and O_DIRECT
hardware-os · low: What fsync, fdatasync, O_DSYNC, O_DIRECT and F_FULLFSYNC really guarantee on Linux and macOS, and the exact call sequences for crash-safe files.
›
SIMD programming
hardware-os · low: Process 4-16 lanes per instruction with AVX2, AVX-512 or NEON via Rust std::arch, with runtime dispatch and a portable fallback.
›
Optimistic concurrency control
storage · low: Run transactions without locks, record what they read, and validate at commit that nothing changed; fastest when conflicts are rare.
›
Copy for AI
Similar systems
Share the most building blocks with this one.
smart-contract-vm
21 %
blockchain
19 %
cross-chain-bridge
16 %