ATTENTION/WARNING - NE PAS DÉPOSER ICI/DO NOT SUBMIT HERE

Ceci est la version de TEST de DIAL.mem. Veuillez ne pas soumettre votre mémoire sur ce site mais bien à l'URL suivante: 'https://thesis.dial.uclouvain.be'.
This is the TEST version of DIAL.mem. Please use the following URL to submit your master thesis: 'https://thesis.dial.uclouvain.be'.
 

DAVE : Deterministic, Adaptive, Verifiable and Efficient transaction placement for sharded UTXO blockchains

Clement, Maxime ; Moueddene, Alexandre
(2021)

Files

Clement_29011600_Moueddene_42381600_2021.pdf
  • Open access
  • Adobe PDF
  • 7.69 MB
Download

Details

Supervisors
Riviere, Etienne ; Schaus, Pierre
Faculty
Ecole polytechnique de Louvain
Degree label
Master [120] : ingénieur civil en informatique, à finalité spécialisée
Abstract
Sharding is a well-known method that allows UTXO blockchains to scale up. This technique introduces two types of transactions, the intra-shard and inter-shard transactions. Their respective temporal cost is very different as the inter-shard transactions are a lot more time-consuming. The main problem of existing sharded blockchains is that they tend to shard transactions randomly, which creates a lot of inter-shard transactions. In addition to that, if an attacker managed to hack the system, he could place his transactions where it suits him best without anyone being able to detect it since the placement strategy is random. We developed DAVE, a transaction placement strategy that manages to minimize the overall number of inter-shard transactions while making the placement strategy deterministic and computed at the miner side. When introduced in existing randomly sharded blockchains, this new way to take placement decisions improves both their throughput and latency. DAVE even enables the execution of a verification mechanism allowing anyone to check that a transaction has been placed where it was supposed to.