As per this discussion, the current secret re-assembly only attempts to use the first threshold shares passed to it (*).
An attempt may fail despite there being enough valid shares as input if there are duplicates, or bad shares in the first threshold values. We could implement the following two improvements:
eliminate duplicate shares
try permutations if the first attempt on a threshold free from duplicates does not work and we have enough additional values
As per this discussion, the current secret re-assembly only attempts to use the first
threshold
shares passed to it (*).An attempt may fail despite there being enough valid shares as input if there are duplicates, or bad shares in the first
threshold values
. We could implement the following two improvements:threshold
free from duplicates does not work and we have enough additional values