Timeline for Is discrete logarithm good approach for a time-bounded proof of work?
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 23 at 12:28 | vote | accept | juhist | ||
| Jun 23 at 12:28 | comment | added | juhist | I think the number of a:s is what will kill the idea. Trying to make x_{max} large makes it so slow that x_{max} needs to be small. And if x_{max} is small, it is possible to precompute a table for every a. However, if there are a number of choices for p and b as well, then it might be infeasible to precompute a table for every (b,p,a) combination. | |
| Jun 23 at 8:34 | history | answered | kodlu | CC BY-SA 4.0 |