The received difficulty doesn't match the claimed one!
#8
Labels
No Label
left for future work
No Milestone
No project
No Assignees
1 Participants
Notifications
Due Date
No due date set.
Dependencies
No dependencies set.
Reference: Benjamin_Loison/Proof_of_Space-Time_prototype#8
Loading…
Reference in New Issue
Block a user
No description provided.
Delete Branch "%!s()"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
Note that the
The received difficulty doesn't match the claimed one!
issue also happens when applying the following to commit 4b82fdc2f879f4661093ab208984a2a020a53b79 :It seems that the more the
SPACE_TO_PROVE_IN_BITS
is low, the more often the verification passes.Maybe this issue occurs the more verifications are done.
With latest commit starts to have issues with
PROBABILITY_TO_CATCH_MALICIOUS = 1 - 2 ** -3
as far as I tested.Related to #2.
It seems that the problem is that the prover doesn't send all expected nonces.
More precisely it seems that the problem is happening when the verifier requests multiple times the same pair, so because the prover uses a
dict
, it doesn't send the repeated nonces.To solve this issue, let's pick different indices couple as the theory requires. Does it actually require that?
More precisely the theory would go for sending neighbor hashes but we send nonces as it doesn't cost much on the first level.