Distributed ledger technologies rely on foundational components to operate effectively. Within the Hedera Hashgraph ecosystem, the EDNA Node is a key system component for processing and validating network transactions. This article explores what an EDNA Node is, how it functions within the Hedera network, and its overall importance.
Understanding the EDNA Node
An EDNA Node is a participant within the Hedera network that maintains the integrity and functionality of the distributed ledger. The architecture it represents is fundamentally “event-driven.” In a network context, a node is a device or computer that connects to the network and performs specific tasks, acting as a point of communication and data storage.
In Hedera, these nodes process and validate transactions. They contribute to the network’s consensus mechanism, ensuring all participants agree on the order and validity of operations. Hedera’s mainnet consensus nodes are currently operated by members of the Hedera Governing Council, with plans for greater decentralization. These nodes receive transactions from clients, process them, and store the public ledger’s most recent state.
Beyond consensus nodes, Hedera uses “mirror nodes,” which are permissionless and store historical ledger data. Mirror nodes do not participate in consensus but are important for developers to query data, perform analytics, and build applications. This tiered structure distributes workload and enhances data accessibility.
How EDNA Nodes Function in Hedera
EDNA Nodes in Hedera operate using the Hashgraph consensus algorithm, which employs a “gossip about gossip” protocol. When a client initiates a transaction, it is cryptographically signed and submitted to any Hedera node. This initial node processes the transaction, confirming details like sufficient account balance, and then introduces it for network consensus.
The “gossip about gossip” protocol enables rapid information sharing. Instead of broadcasting to everyone, nodes randomly choose another node to “gossip” with, sharing transaction data and information about transactions they have already received.
This process creates a directed acyclic graph (DAG) of events. Each event includes a cryptographic hash of two previous events, forming an interconnected web of transaction history. This propagation ensures transaction data spreads quickly across the network.
Consensus on transaction timing and order is achieved through “virtual voting,” a core part of the Hashgraph algorithm. Nodes determine what other nodes would vote for without sending additional messages. This mechanism allows nodes to independently calculate a consensus timestamp for each transaction, reflecting when the majority of the network received it. This method secures transaction order and maintains ledger integrity.
Key Advantages of the EDNA Architecture
The EDNA architecture, powered by the Hashgraph consensus algorithm, offers several advantages for the Hedera network and its users. It provides high transaction throughput, allowing Hedera to process thousands of transactions per second (TPS).
This capacity is an improvement over many other distributed ledger technologies, making it suitable for applications requiring rapid processing, such as digital payments. This speed is attributed to the Hashgraph’s ability to process multiple transactions in parallel due to its DAG structure.
Another advantage is the low latency and near-instant finality of transactions. Unlike systems with probabilistic finality, Hedera’s consensus algorithm ensures that once consensus is reached, the transaction is immutable and permanently recorded on the public ledger within seconds. This rapid finality provides confidence for network participants and applications, eliminating uncertainties from potentially reversed or altered transactions.
The architecture also provides security through its Asynchronous Byzantine Fault Tolerance (aBFT) property. This means the network maintains agreement and operates correctly even if up to one-third of the nodes are malicious or faulty.
The aBFT characteristic ensures no single node or small group can prevent consensus or alter the agreed-upon state, offering strong security for distributed systems. This resilience makes the network resistant to various forms of attacks, including Distributed Denial of Service (DDoS).
The EDNA architecture promotes fairness in transaction ordering and network efficiency. The Hashgraph algorithm orders transactions based on the median time they are received by the network, preventing malicious actors from manipulating the order. This fair ordering, combined with low computational requirements, results in an energy-efficient system, consuming less power than other DLTs. Low transaction fees also contribute to its overall efficiency, making it cost-effective for many applications.