Hacker News new | past | comments | ask | show | jobs | submit login

To generate a response to the verifier, you have to have your replica of the data in question. A replica (from proof of replication) is a unique encoding of the data that is quite slow to generate. If the prover isn't storing the replica, they will have to regenerate it before they can respond to the challenge, which takes a noticeable amount of time.



What scale is "noticeable"? Is it slower than "we're going to pretend the network is slow and send you 1KB/s until we generate the rest"?


I wouldn't be surprised if regenerating it a few times is more expensive than simply storing it once.


1kb is much larger than most hashes.


I'm not sure what you're trying to say by that.


I'm saying that strategies like that won't work when the data required fits into a single packet.




Consider applying for YC's Summer 2025 batch! Applications are open till May 13

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: