You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Currently, if you try and to run alice on an example in the docs, it will already fail when calling NewDKG with error large rank.
The example states:
Let threshold = 3, and participants = 4. Assume that the corresponding rank of each shareholder are 0, 1, 1, 2. Then authorised sets in this setting are:
- 0, 1, 1
- 0, 1, 2
- 0, 1, 1, 2
The other combinations of shares can not recover the secret (e.g. 1, 1, 2).
This is due to ErrLargeRank of EnsureRank in crypto/utils/utils.go, . The related code is linked here.
If you think about it for the participant with rank of 2, then rank + 1 will be 3 which is equal the threshold in the example, and will fail.
There can either be 1 of the 2 possibilities:
the restriction rank+1 >= threshold is too strict
the example in the docs is invalid
Should EnsureRank be less strict or should the example in the docs be changed?
Thanks.
The text was updated successfully, but these errors were encountered:
Currently, if you try and to run alice on an example in the docs, it will already fail when calling
NewDKG
with errorlarge rank
.The example states:
This is due to
ErrLargeRank
ofEnsureRank
incrypto/utils/utils.go
, . The related code is linked here.If you think about it for the participant with rank of 2, then
rank + 1
will be 3 which is equal the threshold in the example, and will fail.There can either be 1 of the 2 possibilities:
rank+1 >= threshold
is too strictShould EnsureRank be less strict or should the example in the docs be changed?
Thanks.
The text was updated successfully, but these errors were encountered: