clarification on bounds of inputs
This commit is contained in:
parent
c05f239987
commit
16b6a4a4b9
|
@ -232,6 +232,10 @@ mod tests {
|
|||
let mut solver = Solver::new(s, t);
|
||||
for i in 0..10 {
|
||||
// These are the indexes which are to be random...you can try swapping them around..
|
||||
// REMEMBER: the number of true hash needs to be AT LEAST `t+1` AND the number of fake hashes
|
||||
// must be AT-MOST `s`.
|
||||
// If |random hashes| > s this this procedure will *not* work
|
||||
// There is an extended algorithm for extract assuming |true hashes| > t though - we do not implement it.
|
||||
if i != 2 && i != 5 && i != 8 {
|
||||
let x0: u64 = rng.gen_range(0..PRIME_ORDER);
|
||||
let hash = dhf.hash(PrimeOrderDomain::new(x0));
|
||||
|
|
Loading…
Reference in New Issue