Nicolas Gailly

Bump up for this one too ! But in the meantime, @jszwedko : Thank you so far for the good job you've done ;)

What's the scope of this PR ? It seems like it supersedes the previous PR of @nicola ? And if that's the case (which is fine by me), then there...

Note there is a now a wrapper around a very good performant bls12-381 library. Unfortunately wrapper is for a fork of kyber. Mentionning just in case. https://github.com/drand/kyber-bls12381/

> I think this has proven to be pretty useful functionality as well Do you have specific examples on that ? From my 2 years experience using/developing this library, I...

Mhhhh. I think it's mostly a notation problem here IIUC. + In our implementation, `t` means the number of *shares* needed to reconstruct a deal. So here the minimum `t`...

I just came back on this issue and it just struck me that you're right: the default safe `t` value should be `n/2 + 1` and not `(n+1) / 2`...

> On the one hand, t is the number of shares needed to reconstruct the secret. > On the other hand, in MinimumT it's number of shares which need to...

Ok I see what you mean. At the moment, you can already have a safe DKG with any number of shares, the `EnoughApprovals` is merely here to check that it...

Reopening so I don't forget about the `minimumT` bug.

Hi, You are right, good eye! However, let me add in some context: * Unfortunately, Pedersen DKG requires synchronous communication model with a broadcast channel. That is very hard to...