Autonomous Data Availability & IPFS Sharding Engine.
AetherDA operates as an in-process verification pipeline: ingesting binary rollup payloads, distributing 2D Reed-Solomon polynomial proofs, and pinning content across planetary Kademlia DHT subnets.
Distributed Hash Table (DHT) Topology
Real-time Kademlia distance routing algorithm resolving Content Identifiers (CIDs) across dynamic network hops and subnets.
UnixFS Merkle-DAG Pinning Console
Ingest raw data blobs, compute Blake3 / SHA-256 multihashes, and chunk data into standard 256KB UnixFS blocks for cluster replication.
Kademlia DHT Peer Swarm Inventory
Active K-bucket peers providing redundancy for the Data Availability sharding layer.
| Peer ID / Multiaddr | XOR Metric Distance | Transport Security | Round Trip (RTT) | Bitswap State |
|---|---|---|---|---|
| 12D3KooWJ...8F19 / /ip4/45.10.166.42/udp/4001/quic-v1 | 0x0F4A...19 | Noise-XX (TLS 1.3) | 12.4 ms | ACTIVE_REPLICATOR |
| 12D3KooWR...4C82 / /ip4/185.220.101.5/tcp/4001 | 0x1B82...44 | Noise-XX (Yamux) | 24.1 ms | ACTIVE_REPLICATOR |
| 12D3KooWS...99EA / /ip4/91.108.4.12/udp/4001/quic-v1 | 0x2A19...90 | Noise-XX (TLS 1.3) | 8.2 ms | IDLE_DISCOVERED |
Modular Architecture & Data Pipeline
Incoming block requests are answered directly from kernel page caches via `sendfile()` without passing through user-space serialization layers.
Integrated STUN/TURN hole-punching and Circuit Relay v2 protocols permit nodes behind symmetric enterprise NATs to maintain high connectivity.
Multihash headers are computed using parallel Blake3 tree hashes, reaching hashing speeds over 12 GB/s on modern multi-core server CPUs.
Ecosystem Stacks & Frameworks
Core implementations that AetherDA interfaces with across the network.
Modular Data Availability node executing 2D Reed-Solomon light client sampling.
Official Go implementation of the IPFS protocol and Bitswap exchange engine.
Modular peer-to-peer network stack with Yamux, Noise, and Kademlia DHT.
High-throughput Data Availability service secured by Ethereum restaking.