@@ -181,7 +181,7 @@ def test_correctness_internal(t, n, simulate_dkg):
181
181
182
182
183
183
def test_correctness_dkg_output (t , n , dkg_outputs : List [simplpedpop .DKGOutput ]):
184
- shares = [out [0 ] for out in dkg_outputs ]
184
+ secshares = [out [0 ] for out in dkg_outputs ]
185
185
threshold_pubkeys = [out [1 ] for out in dkg_outputs ]
186
186
signer_pubshares = [out [2 ] for out in dkg_outputs ]
187
187
@@ -196,11 +196,11 @@ def test_correctness_dkg_output(t, n, dkg_outputs: List[simplpedpop.DKGOutput]):
196
196
197
197
# Check that the share corresponds to the signer_pubshare
198
198
for i in range (n ):
199
- assert shares [i ] * G == signer_pubshares [0 ][i ]
199
+ assert secshares [i ] * G == signer_pubshares [0 ][i ]
200
200
201
201
# Check that the first t signers (TODO: should be an arbitrary set) can
202
202
# recover the threshold pubkey
203
- recovered_secret = recover_secret (list (range (1 , t + 1 )), shares [0 :t ])
203
+ recovered_secret = recover_secret (list (range (1 , t + 1 )), secshares [0 :t ])
204
204
assert recovered_secret * G == threshold_pubkey
205
205
206
206
@@ -224,10 +224,10 @@ def test_correctness(t, n, simulate_dkg):
224
224
backups = [out [1 ] for out in outputs ]
225
225
# test correctness of chilldkg_recover
226
226
for i in range (n ):
227
- (share , threshold_pubkey , signer_pubshares ), _ = chilldkg .signer_recover (
227
+ (secshare , threshold_pubkey , signer_pubshares ), _ = chilldkg .signer_recover (
228
228
seeds [i ], backups [i ], b""
229
229
)
230
- assert share == dkg_outputs [i ][0 ]
230
+ assert secshare == dkg_outputs [i ][0 ]
231
231
assert threshold_pubkey == dkg_outputs [i ][1 ]
232
232
assert signer_pubshares == dkg_outputs [i ][2 ]
233
233
0 commit comments