Abstract: Sharding is a natural way to scale the EVM, and we try to show the feasibility of sharding by implementing a proof-of-concept of protocols previously only available in theory. Hierarchical Level1 sharding implementation: EVM-enabled shards are arranged in a tree. Shards adjacent to each other in the tree can communicate with their neighbors. Xshard message routing: messages destined to a shard that aren't a neighbor of its shard holding the message will be routed in multiple hops via intermediate shards; Topology rebalancing: the configuration of the shards tree can change dynamically, at any time. Smart fork-choice rule that respects the shards hierarchy that enables atomic cross-shard transactions, by preventing the finalization of atomicity failures
Shard messages are guarantee to only be received once and in order. Visualization with sliding windows allows us to picture many shards executing and communicating.
Pioneer: Aditya Asgaonkar and vldzmfr
Capital: Top 10 Finalist at 2018 ETH San Francisco Hackathon