Comments (10)
small typos
4.4 Instantiating ACS Efficiently
(page 7, last paragraph before subsubsection Communication-optimal reliable broadcast)
We now briefly explain the RBC and ABA constructions before explaing the Ben-Or protocol in more detail.
"explaing" --> "explaining"
Communication-optimal reliable broadcast
(page 7, last paragraph of subsubsection Communication-optimal reliable broadcast)
If the sender is correct, the total running time is three (asynchronous) rounds; and in any case, at most two rounds elapse between when the first correct node outputs a value and the last outputs a value. The reliable broadcast algorithm shown in Figure 2.
"is" seems to be missing
The reliable broadcast algorithm is shown in Figure 2.
from honeybadgerbft.
wondering ...
1.1 Our Contributions
Timing assumptions considered harmful.
[...]
on page 2, first paragraph
Second, even when the weak synchrony assumptions are satisfied in practice, weakly synchronous protocols degrade significantly in throughput when the underlying network is unpredictable. Ideally, we would like a protocol whose throughput closely tracks the network’s performance even under rapidly changing network conditions. Unfortunately, weakly asynchronous protocols require timeout parameters that are finicky to tune, especially in cryptocurrency application settings; and when the chosen timeout values are either too long or too short, throughput can be hampered. As a concrete example, we show that even when the weak synchrony assumptions are satisfied, such protocols are slow to recover from transient network partitions (Section 3).
"weakly asynchronous" --> "weakly synchronous" (?)
from honeybadgerbft.
wondering ...
C. ASYNCHRONOUS BINARY BYZANTINE AGREEMENT
Realizing binary agreement from a common coin.
[...]
We instantiate this primitive with a protocol based on cryptographic common coin, which essentially act as synchronizing gadgets.
"on cryptographic common coin" --> "on cryptographic common coins" (?)
from honeybadgerbft.
7. Reference
ref [42]:
A. Mostefaoui, H. Moumen, and M. Raynal. Signature-free asynchronous byzantine consensus with t< n/3 and o (n 2) messages. In Proceedings of the 2014 ACM symposium on Principles of distributed computing, pages 2–9. ACM, 2014.
o (n 2) --> O (n^2)
from honeybadgerbft.
3. THE GAP BETWEEN ASYNCHRONOUS AND WEAKLY SYNCHRONOUS NETWORK MODELS
In this section, we present make two counter arguments that refute the premise above.
present or make ?
from honeybadgerbft.
page 2, left column, bottom
We provide a full-fledged implementation of HoneyBadgerBFT, which will we release as free open source software in the near future.
will we --> we will
from honeybadgerbft.
DEFERRED PROOFS
[...]
Experiment 1. [...] The adversary selects
N - 2f
correct nodes and letS
denote the union of their proposed transactions -- recall that the ACS protocol guarantees that the agreed set contains at least transactions proposed byN - 2f
correct nodes.
contains at least transactions --> contains at least B/4
transactions (?)
Experiment 2. [...]
[...]
[...] If the average number of transactions across these epochs is smaller than1/4 * B
,D
guesses that the ciphertexts are real; otherwise it guess they are random.
guess --> guesses (?)
from honeybadgerbft.
Applicability to permissionless blockchains.
[...]
Several recent works have suggested the promising idea of leveraging either a slower, external blockchain such as Bitcoin or economic “proof-of-stake” assumptions involving the underlying currency itself [32, 32, 35, 37] to bootstrap faster BFT protocols, by selecting a random committee to perform BFT in every different epoch.
[32, 32, 35, 37] --> [32, 35, 37] ?
from honeybadgerbft.
5.1 Bandwidth Breakdown and Evaluation
...
Bandwidth and breakdown findings. ...
...
The system’s effective throughput ... However, when when the batch size reaches 16384, ...
when when --> when
from honeybadgerbft.
This issue was moved to initc3/HoneyBadgerBFT-Python#36
from honeybadgerbft.
Related Issues (20)
- [packaging] Register package on PyPI HOT 3
- [test] add source code check to travis (pep8, etc) HOT 1
- [conventions] Coding style elements and more HOT 1
- Implement proposed batch size to be floor(B/N) HOT 4
- [logging] Setup minimal logging config HOT 1
- [test:coverage] measure branch coverage HOT 1
- [dev] charm-crypto fails to build with stretch (debian 9) HOT 2
- [dev] update/fix experiments HOT 3
- [test] add more unit tests for tpke module HOT 1
- license HOT 5
- Paper: clarification on number of decryption shares to wait for HOT 2
- Clarification: What will happen if a node goes down during RBC? HOT 2
- Bounded Badger HOT 1
- Bug in ABA protocol's use of Common Coin HOT 2
- Threshold decryption seems to not actually work? HOT 3
- Issue running an instance with Docker HOT 4
- Optimistic Randomness for ABA HOT 9
- Is re-creating the merkle tree after N-F messages with the same root hash have been received necessary? HOT 1
- Python KeyError during standard test run
- Common coin in private network
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from honeybadgerbft.