Andreas Fackler
Andreas Fackler
There is a lot of duplication between HB, DHB and their builders. They each have an `encryption_schedule`, `subset_handling_strategy`, `max_future_epochs`, `rng` and, with #332, `random_value`. We need to find a solution...
Where possible, we should include a proof of misbehavior in our fault logs. We also need to come up with a way to validate that evidence, even in later epochs....
The set of boolean values `vals` that is used at the end of each agreement epoch together with the coin value to determine what the next epoch's estimate will be...
There are different ways one may want to specify the batch size in Honey Badger (see the [TODO](https://github.com/poanetwork/hbbft/blob/b3b3994ec1dd42d7a4765dc220d1e5470e35c6f5/src/honey_badger.rs#L46)): * Currently the batch size itself is a parameter; each node proposes...
The `Agreement` implementation is pretty convoluted, even though some parts of it could be split out and have a somewhat well-defined contract by themselves. E.g. the `BVal` round is called...
Parity's [Secret Store](https://wiki.parity.io/Secret-Store) [implements](https://github.com/paritytech/parity/blob/master/secret_store/src/key_server_cluster/math.rs) [ECDKG](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.124.4128&rep=rep1&type=pdf) to generate [secpk256k1](https://en.bitcoin.it/wiki/Secp256k1) key shares: It generates a random polynomial `f` of degree `t` in `Zn` (integers modulo `n`), where `n` is the order of...
At a glance it looks like [`bba.go`](https://github.com/anthdm/hbbft/blob/master/bba.go) implements the ABA as in the original paper. This has a bug that can be fixed by adding another message round: https://github.com/amiller/HoneyBadgerBFT/issues/59
Functions generated with `use_contract!` (ethabi-contract/ethabi-derive) have a `call` method that takes a `&Fn(Bytes) -> Result`. It will pass the encoded function call into that callback, and decode its output. I'm...
~The current `mlock` functionality—locking each memory page that happens to contain a secret key—causes problems with tests (and possibly also in production) because it quickly reaches the limit of locked...
Our cryptographic data structures are munlocked and zeroed on drop, and mlocked on creation. In some calculations, however, we create temporary values from which secrets could be computed. Can we...