EBLA's security starts with the consensus model and goes all the way down to the genesis file. Everything is code.
EBLA requires 15 out of 24 committee members to agree before any block finalizes. The threshold (62.5%) is custom-tuned for fast finality on a BlockDAG, with the exact ratio enforced on-chain via integer arithmetic (no floating-point rounding), no approximations.
Custom on-chain thresholdPBFT consensus makes blocks irreversible in under 3.7 seconds. There are no reorganizations on EBLA. A confirmed transaction cannot be undone, period. No probabilistic guessing.
Zero reorganization riskAsynchronous Byzantine Fault Tolerant. The network maintains security and continues producing blocks even when some validators are slow, offline, or acting maliciously. The protocol is designed to survive partial network failures without halting.
Resilient to faulty nodesDouble-vote jailing and inactivity penalties are enforced automatically in the DPoS contract. No governance vote, no admin action required. Bad behavior is punished by code, not people.
Code-enforced, not human-enforcedEBLA's 15/24 quorum (62.5%) is slightly lower than the standard 2/3 (66.7%) — a deliberate trade-off optimized for fast finality on a BlockDAG. The exact threshold is enforced via integer arithmetic in both C++ and Go nodes, so the C++ and Go implementations finalize on identical inputs.
Storage compression affects only how data is stored on disk. It has zero effect on consensus rules, state roots, or on-chain data. It is configurable per-validator, and has no security implications.
If you discover a security vulnerability in EBLA, we ask that you report it responsibly before public disclosure. The network is community-owned — protecting it protects everyone.
There is no formal bug bounty program yet. The community will decide how to reward significant findings as governance matures.