Is it possible to plot on PC1 and mine this plot on PC2?
-
I want to plot hard drives on another PC due to compatability and power issues. Can I seemlessly plot the hard drive on the first PC and then plug it into the other PC to start mining, without any problems?
-
@Akito yes you can.
-
@Akito as long as you keep the plots from overlapping, yes, no problem.
-
@haitch What would theoretically happen if they overlap? Is there any documentation on how the nonces work etc.? It's extremely hard to find any explanation for anything regarding Burst Coin, except that it is HDD mining instead of computing based.
-
You can imagine nonces as lottery tickets, only 1 Person can win a block, so if 1 lucky number gets drawn to see who wins the car in a giveaway it's similar with the Nonces. Basicly a nonce contains 4096 values, one for every scoop, every round your miner checks your ticket and submits the best in. If you have overlapp it basicly means you have the same tickets twice, what is in the end a waste of space as you can only win a block and not win. If 2 have the same Deadline the faster one wins (who submitted it faster) and the block doesn't get split between 2 winners.
Regards
-
@Menaxerius Meaning that you have to replot all the TBs regularly to be able to keep winning?
-
@Akito No, all you need to do is plot them once, and make sure over all pc's and drives the nonces don't overlap and you're good to go.
-
@Menaxerius But aren't the plots like one-time lottery tickets? Where can I read some explanation of how exactly plots work, in the technical view?
-
@Akito No, they are permanent.
From the Burst Bitcointalk thread:
How it works:
Miners generate and cache chunks of data known as 'plots', which are divided into 4096 portions known as 'scoops'. Plots are generated by taking a public address and a nonce, then hashing it, pre-appending the resulting hash, repeating the hash-pre-append cycle many times, and then hashing the whole thing and xor'ing the last hash with the whole thing.
Plots are staggered together so chunks of the same scoop number are together, then written to disk.
Each block has a generation signature which is derived only from the previous block's generation signature and miner, so it is difficult to manipulate.When mining, the scoop number to be used for a block is derived from the generation signature and the block height, so the miner reads all relevant scoops(each plot will have 1 relevant scoop, and staggering allows for larger sequential read with less seeking) Only 0.024% of the stored data will need to be read each block.
The generation signature is hashed with each scoop. 8 bytes are taken from the hash, then divided by a scaling factor (inverse difficulty). The resulting number is a number of seconds. If that many seconds passes since the last block without a new one, the address/nonce combination used to generate that plot/scoop is eligible to announce a new block.
The miner's hardware can just sit idle until either that time or a new block.The address/nonce is included in the block as proof of eligibility, and the block is signed by that address.
Technically, this mining process can be mined POW-style, however mining it as intended will yield thousands of times the hashrate, and your hardware will sit idle most of the time. Continuously hashing until a block is found is unnecessary, as waiting long enough will cause any nonce to eventually become valid.


