Adam Back / @adam3us on Nostr: **R to @adam3us: if you don't know the discrete log of Q, that's unsolvable, looks ...
**R to @adam3us: if you don't know the discrete log of Q, that's unsolvable, looks like an impossible equation effectively once you understand the hash functions are one-way, deterministic pseudorandom so you can't pick c and work backwards it's a zero-knowledge proof of knowledge of x, as the**
if you don't know the discrete log of Q, that's unsolvable, looks like an impossible equation effectively once you understand the hash functions are one-way, deterministic pseudorandom so you can't pick c and work backwards it's a zero-knowledge proof of knowledge of x, as the**R to @adam3us: if you don't know the discrete log of Q, that's unsolvable, looks like an impossible equation effectively once you understand the hash functions are one-way, deterministic pseudorandom so you can't pick c and work backwards it's a z…
https://nitter.net/adam3us/status/1605983679481753601#m
if you don't know the discrete log of Q, that's unsolvable, looks like an impossible equation effectively once you understand the hash functions are one-way, deterministic pseudorandom so you can't pick c and work backwards it's a zero-knowledge proof of knowledge of x, as the**R to @adam3us: if you don't know the discrete log of Q, that's unsolvable, looks like an impossible equation effectively once you understand the hash functions are one-way, deterministic pseudorandom so you can't pick c and work backwards it's a z…
https://nitter.net/adam3us/status/1605983679481753601#m