Understanding Elrond Network, Protocols and concepts - series 2.

Components of Elrond network.

---

Hours ago, I wrote an Introductory article on how Elrond plans and adopts best strategy to solve inherent blockchain issues and/or barriers to mainstream adoption. Access the article here.

There is need to understand how the overall Elrond's protocol works so as not to underestimate the potentials it conceives. So, today, I begun writing on
the components of Elrond's network and how they work. There are three basis emphasis of Elrond's blockchain which are :

• Adaptive Stage Sharding

• Secure Proof Of Work, and

• The Meta VM.

---

S1 : Adaptive State Sharding

---

src

To achieve transaction throughput, effective and efficient blockchain performance and reliability through its secure protocols and algorithms, Elrond introduces a system called Adaptive State Sharding.

As the network expands, that is, more users joined (dApps come on board and as end users increases), network of validators increase, to maintain horizontal scaling plus the need to keep the system against known odds, here, Sharding is proven to be very effective.

Sharding is one scaling tactic qualified to be employed in blockchain development to divide into segments state of the world and transaction processing so that each node would handle only a part of overall transactions in parallel with other nodes. Partitioning a blockchain into shards would allow it to process many transactions in a parallel state as long as there in force enough nodes required to handle or approve the transactions for the purpose of reliability. Elrond builds on the three Sharding types thus:

Transaction Sharding	Network Sharding
This section is developed to handle controls the pattern at which each transaction is mapped and sent to where it will be processed. Other Sharding types do not concern themselves with this. This is a method of reducing workload as much as possible.	In every approach to Sharding, this is the basic perhaps one of the challenging part as well as the mechanism that is used in mapping nodes to shards. Developer (s) using this approach (s) need to be wary of and put in consideration the possibility of a hacker gaining access to a shard hence it must be thoroughly configured so as not to jeopardize the essence of the methodology.

---

State Sharding.

---

There have been several proposals whose approaches attempted to shard either of these three Sharding types (Transaction, Network and State Sharding). Combining the first two have proven to be effective without deteriorating effect on the storage and computing power. Far above simplicity is the State Sharding where each shard handles only a part of the chain state as compared to earlier blockchain where nodes maintain the entire network. To uphold resistance against attack, nodes in shards are reshuffled from time to time and they keep up with the process of synchronization.

Elrond's approach to Sharding combines all these three kinds and considering the complexity in combining the three pillars of Sharding, the method was foresaw to achieve the purpose thus:

• to achieve optimum scalability without short-changing the availability of majority nodes. Even if there may exist downtime (which is not quite certain), the significance is expected to be at the lowest possible course that may affect very infinitesimal part of the nodes worthy of being overlooked.

• the destination shard of a transaction is expected to be instantly traceable and dispatchable as well as the efficiency and adaptability of shards.

---

Join Elrond's Communities

YOUTUBE	TWITTER	MEDIUM	TELEGRAM

---

CONTACT - EMAIL	WHITEPAPER	ROADMAP

---

All right reserved. This article is originally created by @Bob-elr. None of the contents of this post shall be used except for the images without the express permission of the Author

---

@Bob-elr . TG username: @cryptopreach

---