3 ms·
There's a whole niche in cryptography called verifiable delay functions (VDFs) if you want a big rabbit hole to go down. The idea is that these are unavoidably
by api 1y ago
There's a whole niche in cryptography called verifiable delay functions (VDFs) if you want a big rabbit hole to go down.
The idea is that these are unavoidably slow and preferably non-parallelizable to compute one way, but fast or near instantaneous to verify the result. Examples include the Weslowski VDFs based on similar math to RSA, MIMC, and the use of zero knowledge proofs to provide proof of slow computations.
- thfuran 1y agoFor this purpose though, computation should be minimized to avoid spilling registers and having more complicated performance side effects than just the intended direct delay.
- 01HNNWZ0MV43FF 1y agoThose sound like the space-hard and time-hard hashes, like used for password checking
- api 1y agoThey're a relative of that, but have stronger linearity and asymmetrical verification time guarantees AFAIK.
- porridgeraisin 1y agoCurious, is this what PoW (proof of work) captchas use?