Advertise with us (we do not endorse any site advertised)

Author Topic: Guarantees for different weight functions - optimistics responsiveness.  (Read 232 times)

0 Members and 1 Guest are viewing this topic.

Offline ataraxiacelesteTopic starter

  • Newbie
  • Joined: Jul 2020
  • Posts: 23
  • Karma: +0/-0
  • HODL!
    • View Profile
Existing Nakamoto-style blockchains (NSBs) rely on some sort of synchrony assumption to offer any type of safety guarantees.

A basic requirement is that when a party produces a new block, then all previously produced blocks should be known to that party, as otherwise the new block might not append the current head of the chain, creating a fork. In practice, however, the network delay for parties to receive messages is not a known constant, but rather varies over time.

The consequence is that the parameters of the blockchain need to be set such that the time between the generation of two blocks is typically larger than the network delay (e.g., 10 minutes in Bitcoin) to guarantee security even under bad network conditions.

This results in lost efficiency for two reasons:
(1) Since blocks are produced less often, there is low throughput. 
(2) blocks can only be considered final, and thus the transactions inside confirmed, once they are extended by sufficiently many other blocks, which incurs a waiting time that is a multiple of 10 minutes.

This is true even if the actual network delay is only 1 second, meaning that NSBs are slow even under good network conditions.

Concordium Researchers at Aarhus Research Center at Aarhus University show how the Bitcoin protocol can be adjusted such that they preserve Bitcoin’s security guarantees in the worst case, and in addition, their protocol can produce blocks arbitrarily fast and achieve optimistic responsiveness.

The latter means that in periods without corruption, the confirmation time only depends on the (unknown) actual network delay instead of the known upper bound.

Technically, they propose an approach where blocks are treated differently in the “longest chain rule”.

The crucial parameter of their protocol is a weight function assigning different weight to blocks according to their hash value.

They even present a framework for analyzing different weight functions, in which they prove all statements at the appropriate level of abstraction.

This allows them to quickly derive protocol guarantees for different weight functions. They even exemplify the usefulness of their framework by capturing the classical Bitcoin protocol as well as exponentially growing functions as special cases, where the latter provide the above mentioned guarantees, including optimistic responsiveness.


 


your ads here