Earlier quoted context omitted.
Farming: you hold massive (101GB) bingo cards of mathematical proofs on your hard drive. When you receive a challenge, you first do a pre-filter on your bingo cards to see which of them could contain a proof. Within that filtered list, you find the closest proofs. The peer with the closest proof available wins the challenge and [currently] gets 2XCH. Plotting: you fill your free space with bingo cards. You need 300-4…
Can you explain the "bingo card" analogy in a bit more depth? is this like pre-computing the values to a hash function against different inputs? Where is the write thrashing coming in? If you only need X hundred gigs, why do you write terabytes? Because you can't store intermediary values in RAM (since ram is expensive and small in comparison)? I get how bitcoin style block-chains use hashing to secure the transactio…
This happens during plotting (not farming). The plots are sorted, which is where the write thrashing happens. Once you've completely plotted a farm, it is never written to.
Everything else you said is basically spot-on.