So then where's the issue with SSD wear, and wouldn't it be more interesting for people to have spinning drives (for the better ratio of GB / $)?
> There is extra layers, Chia is actually proof-of-space-and-time, so that you can't win by faking proof-of-space with proof-of-work.
Is it because of this? So you'd have to print your lottery tickets often enough that a faster drive may help you?
The most efficient way to start your farm is to build your plot with a temporary drive (an SSD) and then move it to a destination drive (Spinning HDD) where the actual farming takes place.
The building of the plot is what does heaps of writes and reads and puts the wear on an SSD.
You absolutely can plot directly to Spinning Disk however it is slow and you will really be trashing the heads if you try and plot multiples to the same disk.
The solution is an enterprise SSD with proper endurance. If a consumer SSD doesn't state it's TBW then you can be pretty sure its not very much.
You do trade off for a slower read rate. If the rate of requests coming in is fast enough, your spinning drive/s may not be fast enough to go through the indexes for each one.
Say the network has seen 1TB of data before with hash H. It can generate a random number as a challenge, and request a miner to prove they have access to the 1TB worth of pre-image at the same time it has access to the random challenge. The only way for a miner to compute such a proof is to have the 1TB of data stored somewhere.
[1] https://cryptorials.io/beyond-hashcash-proof-work-theres-min...
Resulting from (1) removing irrelevant details (details crucial for an implementation, but irrelevant for an initial mental model) and (2) making use of analogies built around already known concepts.
"Complex maths" is never an excuse to not find that explanation.
Disclaimer: I am a pure mathematician.
In Proof of Stake, the network (roughly!) allocates rewards for validating transactions based on the amount of coins you have, i.e., your stake in the network.
In Proof of Space, the network allocates rewards based on you proving that you are really storing the data you were supposed to store. If you fail to produce a proof for some data item the network expected you to have stored, you lose the reward.
More info:
Sort of? But you're usually not really storing data for proof of space. That's a different kind of system.
So it requires the dedication of some hard/rivalrous real resource, storage space, other than either strictly energy/CPU (PoW) or the protocol’s own tokens (PoStake).
See the Chia ‘Green Paper’ for more details.
I'm having the same issue with understanding proof-of-space. Could someone give a technical explanation for those of us that understand basic cryptography (but aren't professional cryptographists)?