Zobrazeno 1 - 10
of 480
pro vyhledávání: '"Zanolini, A."'
Gasper, the consensus protocol currently employed by Ethereum, typically requires 64 to 95 slots -- the units of time during which a new chain extending the previous one by one block is proposed and voted -- to finalize. This means that under ideal c
Externí odkaz:
http://arxiv.org/abs/2411.00558
A Confirmation Rule, within blockchain networks, refers to an algorithm implemented by network nodes that determines (either probabilistically or deterministically) the permanence of certain blocks on the blockchain. An example of Confirmation Ruble
Externí odkaz:
http://arxiv.org/abs/2405.00549
The ability of streamwise-travelling waves of spanwise velocity to reduce the turbulent skin friction drag is assessed in the compressible regime. Direct numerical simulations are carried out to compare drag reduction in subsonic, transonic and super
Externí odkaz:
http://arxiv.org/abs/2312.09929
Over the past years, distributed consensus research has extended its focus towards addressing challenges in large-scale, permissionless systems, such as blockchains. This shift is characterized by the need to accommodate dynamic participation, contra
Externí odkaz:
http://arxiv.org/abs/2310.11331
Dynamically available total-order broadcast (TOB) protocols tolerate fluctuating participation, e.g., as high as 99% of their participants going offline, which is especially useful in permissionless blockchain environments. However, dynamically avail
Externí odkaz:
http://arxiv.org/abs/2309.05347
Autor:
D'Amato, Francesco, Zanolini, Luca
Currently, Gasper, the implemented consensus protocol of Ethereum, takes between 64 and 95 slots to finalize blocks. Because of that, a significant portion of the chain is susceptible to reorgs. The possibility to capture MEV (Maximum Extractable Val
Externí odkaz:
http://arxiv.org/abs/2302.12745
Autor:
D'Amato, Francesco, Zanolini, Luca
Dynamic participation has recently become a crucial requirement for devising permissionless consensus protocols. This notion, originally formalized by Pass and Shi (ASIACRYPT 2017) through their "sleepy model", captures the essence of a system's abil
Externí odkaz:
http://arxiv.org/abs/2302.11326
Blockchain protocols implement total-order broadcast in a permissionless setting, where processes can freely join and leave. In such a setting, to safeguard against Sybil attacks, correct processes rely on cryptographic proofs tied to a particular ty
Externí odkaz:
http://arxiv.org/abs/2211.12050
Fail-prone systems, and their quorum systems, are useful tools for the design of distributed algorithms. However, fail-prone systems as studied so far require every process to know the full system membership in order to guarantee safety through globa
Externí odkaz:
http://arxiv.org/abs/2211.05630
Leader-based protocols for consensus, i.e., atomic broadcast, allow some processes to unilaterally affect the final order of transactions. This has become a problem for blockchain networks and decentralized finance because it facilitates front-runnin
Externí odkaz:
http://arxiv.org/abs/2112.06615