1/ I am happy you are starting to dig into the details now more @Crypt0Jed1 As to your question it requires a bit of an in depth response as it’s due to the Design & Implementation. As it relates to the developer: they don’t need to worry about this layer. $eGLD 
https://twitter.com/Crypt0Jed1/status/1432337125597405185
2/ The Arwen Machine VM is designed for statelessness which is a KEY 🔑 design process as to allow instant execution PRIOR to writing ✍️ to Blockchain. It also adds an Out-Of-Process Execution to increase security by running its own process exchange, which adds more security 🔒
3/ Also, it’s important to understand how $eGLD & @ElrondNetwork designed the Merkle Tree & Cross Shard Transactions docs.elrond.com/technology/cro…
4/ The Merkle Tree allows: Dispatching and instant traceability: Finding out the destination shard of a transaction should be determinis- tic, trivial to calculate, eliminating the need for communication rounds; The entire sharding scheme is based on a binary tree structure that
5/ distributes the account addresses, favors the scalability and deals with the state transitions.
As it relates to security it’s completely unaffected by the design elements above a deeper dive here into security: Long range attacks: mitigated by our pruning mech- anism,
As it relates to security it’s completely unaffected by the design elements above a deeper dive here into security: Long range attacks: mitigated by our pruning mech- anism,
https://twitter.com/wesleybkress/status/1425670784647786497
6/ the use of a randomly selected consensus group every round (and not just a single proposer) and stake locking. On top of all these, our pBFT consensus algo- rithm ensures finality; $eGLD The Devils in the details. Let me know if you need more clarity.
• • •
Missing some Tweet in this thread? You can try to
force a refresh
