Концептуально новая монета, которая добывается винчестером. Криптовалюта BURST основана на исходном коде от NXT, имеет кошелек на JAVA фреймворке работающий через браузер, однако в отличие то NXT имеет свой уникальных метод майнинга (POC - proof of capacity).
ссылка на оригинал bitcointalk https://bitcointalk....?topic=731923.0 https://bitcointalk....1323657.new#new
Mining speed based on HDD capacity
Burst Nation https://www.burstnation.com/
irc: Freenode: #burstcoin #burst-coin
4 minute block time
2,158,812,800 coins total
Block reward starts at 10,000/block, then decreases 5% each month (similar to halving every 14 months, but much smoother)
Wallet: 1.2.9 https://github.com/b...eases/tag/1.2.9
WEB wallet https://wallet.burst-team.us:8125 https://wallet.smit....8125/index.html
Miner (uray's) [ 1.1-R4 0.1MB Linux64 ] [ 1.1-R4 0.1MB OSX ] [ 1.1-R4 0.1MB Win64 ]
Miner Blago https://github.com/B...iner-burst/tags
Janror's AVX/SSE CPU plotter https://github.com/B...ftware/releases под Windows
creepMiner - C++ Burst Miner v 1.3.6 https://github.com/C...ses/tag/184.108.40.206
XPlotter for optimized plots v 1.0 https://github.com/B...lotter/releases
Получить бесплатно Burst (Кран. Faucet):
Reward Recipient: https://forum.bits.media/index.php?/topic/9051-burst-burst-poc/?p=763492
Proof of capacity(POC) mining:
Burst uses a new algorithm for proof of hdd capacity (POC) mining. Miners pre-generate chunks of data known as 'plots' which are then saved to disk. The number of plots you store is effectively your mining speed. Every block the miner will skim through the saved plots, and come up with an amount of time until it is able to mine a block if another block hasn't yet been found. After reading through the plots is complete, your hardware can idle until the block. The miner will be released a few hours before launch to give miners time to start generating plots.
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 eligable 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 eligability, 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.
Shoddily made flow chart of the general process. Does not include caching plot to disk and retrieving them:
Это руководство предназначено для тех, кто имеет проблемы с установкой майнера под Windows.
AT (smart contract)
Обмен QORA на BURST без биржи.
Майнинг Burst для Linux
Описание параметров конфигурации для Blago майнера
Если застрял кошелёк
Сообщение отредактировал DimitriS: 03 August 2017 - 10:59