Scaling Byzantine Fault Tolerance

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Alkynes and nitriles are valuable building blocks in organic synthesis and also have multiple applications in chemical biology and materials science. Due to the high availability of tertiary alcohols, developing methods for their conversion into alkynes an ...

We address for the first time the problem of correcting group discriminations within a score function, while minimizing the individual error. Each group is described by a probability density function on the set of profiles. We first solve the problem analy ...

The recent discovery of an N2O-based synthesis of triazenes in our group has enabled the synthesis and investigation of 1-alkynyl triazenes. Early studies showed their potential for a functional group tolerant synthesis of 1-vinyl triazenes, which is furth ...

Cyclic peptides are ring-shaped molecules that emerged as a promising class of therapeutics. While it is often difficult to find small molecule binders for challenging disease targets, cyclic peptides can bind to featureless surfaces or inhibit protein-pro ...

It is known that the agreement property of the Byzantine consensus problem among n processes can be violated in a non-synchronous system if the number of faulty processes exceeds t0 = ┌n/3┐ − 1 [10], [19]. In this paper, we investigate the accountable Byza ...

The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic communication complexity in the worst case. While it has been shown that the bound is tight in synchronous environments, it is still unknown whether ...

Front-running, the practice of benefiting from advanced knowledge of pending transactions, has proliferated in the cryptocurrency space with the emergence of decentralized finance. Front-running causes devastating losses to honest participants-estimated at ...

This thesis addresses theoretical and practical aspects of identification and subsequent control of self-exciting point processes. The main contributions correspond to four separate scientific papers. In the first paper, we address the challenge of robust ...

Today, automatic control is integrated into a wide spectrum of real-world systems such as electrical grids and transportation networks. Many of these systems comprise numerous interconnected agents, perform safety-critical operations, or generate large amo ...

BackgroundTinnitus is a heterogeneous condition which may be associated with moderate to severe disability, but the reasons why only a subset of individuals is burdened by the condition are not fully clear. Ecological momentary assessment (EMA) allows a be ...

Scaling Byzantine Fault Tolerance

Chat with Graph Search

Exploring Photoredox-Catalyzed (Re)functionalizations with Core-Modified Benziodoxolones

Removing Algorithmic Discrimination (With Minimal Individual Error)

Synthesis of new 1-Vinyl and 1-Alkynyl Triazenes

De novo developed small cyclic peptides that are orally available

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony!

Flash Freezing Flash Boys: Countering Blockchain Front-Running

Self-Exciting Point Processes: Identification and Control

Data-driven and Safe Networked Control with Applications to Microgrids

Daily Contributors of Tinnitus Loudness and Distress: An Ecological Momentary Assessment Study