Opening the Filecoin Project Repos

Post by whyrusleeping » Fri, Feb 15, 2019, 5:27 AM UTC

gcbw2 wrote: post #38

whyrusleeping wrote: post #19

Earlier quoted context omitted.

The proof of replication provides assurance that for some given data D, a unique replica R is created for it. What you’re proving with the Proof of SpaceTime isn’t that you have some data , you’re proving that you have the replicas . Generating the replica is slow, so you can’t do it on the fly. I gave a talk recently that goes over some of this briefly: https://youtu.be/GZZ2G9bPXsM

you talk for 15s about it on that video. I will try to read the secondary paper on this... but doesn't look like it can protect against someone just generating hashes for multiple accounts from the same stored data. P and (the fake) P2 can both reply to V with perfectly normalized storage. But regardless if the protection works against bad actors, it definitely "works" against good actors if you take into account sto…

Post by [deleted] » Fri, Feb 15, 2019, 7:18 AM UTC

viraptor wrote: post #42

whyrusleeping wrote: post #40

Earlier quoted context omitted.

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"?

Post by darawk » Fri, Feb 15, 2019, 7:57 AM UTC

viraptor wrote: post #42

whyrusleeping wrote: post #40

Earlier quoted context omitted.

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"?

Post by askmike » Fri, Feb 15, 2019, 9:02 AM UTC

viraptor wrote: post #42

whyrusleeping wrote: post #40

Earlier quoted context omitted.

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"?

Post by RandomGuyDTB » Fri, Feb 15, 2019, 1:25 PM UTC

harshreality wrote: post #36

throwaway-1283 wrote: post #31

The fact that as a miner you have no control over whether someone stores illicit documents on your machine seems like a dealbreaker

The fact that as a maintainer of a website with user-contributed content, you have no [up-front] control over whether someone stores illicit content on, and distributes it from, your server, seems like a dealbreaker.