Where Proof-of-Work is power hungry, and Proof-of-Stake can skew towards centralization, is Proof-of-Capacity the holy grail of Blockchain consensus algorithms?
----------------------------------------------------------------------------------------------------------------------------------------------------------------

### Proof-of-What?

When reading about [Bitcoin](https://hackernoon.com/tagged/bitcoin) or other [blockchain](https://hackernoon.com/tagged/blockchain) technologies, the phrases _Proof-of-Work_ and _Proof-of-Stake_ are often mentioned. In the case of Bitcoin, Proof-of-Work as one of the reasons for its astronomical energy consumption. These “Proof” algorithms are used by cryptocurrency networks to reach a consensus of the current state of their respective blockchains in a process called mining. Put simply, mining is the process in which a group of unaffiliated, distributed transaction processors validate the transactions that have taken place on the network. Before I get into Burst and what its _Proof-of-Work_ Algorithm means and why it’s significant, I will describe what these other “Proof” algorithms mean and how they came to be.

#### Proof-of-Work

_Users: Bitcoin, Litecoin, and damn near everyone else._

![](https://hackernoon.com/hn-images/1*vUS1xHNn4jCfsSKVQ8ShpQ.png)

Proof of Work

Proof-of-Work (PoW) was first given serious attention in the [Bitcoin whitepaper](https://bitcoin.org/bitcoin.pdf) in 2008. The beauty of Proof-of-Work, when it was announced, was that it was the first mechanism that allowed for consensus among distributed parties with no central trust. While nowadays we have several solutions to this problem, at the time a working solution to this foundational problem had never been proposed.

**Terminology**

> Hash: A hash is a cryptographic function that is meant to be a one-way function. A hashing algorithm should be able to take any amount of data and return a fixed length string that should be completely unique to that particular input.

> Nonce: A nonce is an arbitrary number that can only be used once.

> Miner: One of the independent transaction processors in the cryptocurrency network whose goal is to validate transactions. Also sometimes called a Full Node or Node.

Generally, PoW as it operates in Bitcoin and many other cryptocurrencies functions in the following way:

1.  A collective difficulty level is set. This usually refers to some characteristic that the resulting “product” or “answer” must posses (e.g. the resulting hash must start with 3 consecutive 0's).
2.  Each miner (or node) starts generating guesses for the answer. They test their guesses by generating a new hash from the current unconfirmed transactions, the hash of the previous block, and a nonce of their choosing.
3.  When a miner finally generates a hash that meets the conditions from step 1, it broadcasts its answer to the rest of the network to verify. If the answer is found to be valid, the miner that generated the answer is said to win the right to mine the block.

The power consumption concerns come into play because each “guess” a miner makes takes a set tiny amount of energy for a computer to produce. Currently the hash rate for the entire bitcoin network is [~17,000,000 tera hashes per second](https://blockchain.info/charts/hash-rate), that is **17,000,000,000,000,000,000** guesses per second for the entire network. The energy required to do this kind of computation is roughly the same as the consumption of the [country of Hungary](https://digiconomist.net/bitcoin-energy-consumption).

#### Proof-of-Stake

_Users: Dash, NEO, Lisk, etc._

![](https://hackernoon.com/hn-images/1*JuZ94vIVcCWvYmOweiHl3w.png)

Proof of Stake

Proof-of-Stake was first introduced in 2012 with the introduction of [Peercoin](https://peercoin.net/assets/paper/peercoin-paper.pdf). PoS was seen as a solution to the inherent waste occurring in PoW currencies. PoS also solves the problem of distributed consensus, albeit in via a different path.

Generally, PoS works by using a randomization algorithm to select a mining node based on its public attributes such as its age, or the amount of the native currency that the node possesses. This makes the mining process, at least computationally, much less expensive than PoW algorithms. Keep in mind this is a very brief overview of PoS, interested readers will find the topic has much more depth and complexity than I give here.

While it is considered much “greener” than PoW, there are some drawbacks to consider when looking at PoS systems. The greatest of these being the argument that such networks can quickly become unfairly distributed if too much weight is given too very wealthy or old nodes.

#### Proof-of-Capacity

_Users: Burst (And soon_ [_Bitcoin Ore_](http://www.bitcoinore.org/)_)_

![](https://hackernoon.com/hn-images/1*S6vrVlaEIqiCBNoGfLDtzA.png)

Proof of Capacity

Proof-of-Capacity, which has also been referred to as Proof-of-Space, was first proposed in 2013 in the [Proofs of Space whitepaper](https://eprint.iacr.org/2013/796.pdf).

PoC is not so very different from PoW except for one major differentiator, in PoC, rather than doing a large amount of work in order to verify each block, the work is done up front in the process called “plotting” and the results from this process are used later to verify each block.

The basic idea to take away from this is that in PoC the “work” is done once during plotting rather than with each new block, allowing PoC to realize a huge efficiency savings over PoW systems. The amount of “work” a miner will end up doing depends on the amount of free disk space they have available to devote to the plotting process.

#### How Does It Work?

_If you’d like to avoid the nitty-gritty of how plotting and mining work in Burst’s PoC system, feel free to skip on to the next section._

Plotting is the process of generating plot files, which are just files storing a large number of pre-computed hashes. Each _plot_ file contains one of more groups of 8192 hashes, these groups are called _nonces._ A nonce is exactly 256KiB in size (8192 x 32 bytes per hash). Additionally, each nonce is divided into 4096 pairs of hashes, the pairs are referred to as _scoops_. Each nonce can also be identified by its index number, ranging from 0 to 2^64.

![](https://hackernoon.com/hn-images/1*wDIWEV99RzQ1LSdB6q5CjQ.png)

The plotting process takes the miner’s burst address as an input, which ensures that plot files can only be used by a single miner.

For an even lower level look at how plot files are generated you can read [this](https://burstwiki.org/wiki/Technical_information_to_create_plot_files).

Once the plot files have been generated, the actual mining process can take place. The miner will first fetch the relevant information from the wallet for the current block, this includes a 32 byte hash called the “generation signature” from the previous block, the block height (index of the current block), and something called the “base target” which is calculated based on the last 24 blocks and can be considered as the “difficulty level” of the block.

With this information the miner can then generate a new “generation hash” which it will use to determine the which scoop to check in each nonce. With each of the applicable scoops, the miner will then perform an additional hash with the new generation signature before dividing the hash by the the base target, which results in the “deadline” being returned. The deadline represents the number of seconds since the previous block was mined before the miner would be allowed to mine the next block. The miner with the smallest deadline wins the right to mine (also called forge) the next block.

See [this article](https://burstwiki.org/wiki/Technical_information_about_mining_and_block_forging) for a more detailed description of the whole process.

The miner who forges the next block wins the “block reward” which at the time of writing is around 1200 Burst.

#### The Evolution of PoC

Burst PoC2 and PoC3 are mentioned in the recent Burst Dymaxion [whitepaper](https://www.burst-coin.org/wp-content/uploads/2017/07/The-Burst-Dymaxion-1.00.pdf). Development of PoC2 is already underway as part of the Dymaxion effort. The primary change in PoC2 will be relegated to the formatting of the plot files in order to provide protection against the “time-memory tradeoffs” as outlined in the SpaceMint [whitepaper](https://eprint.iacr.org/2015/528.pdf). The authors of the SpaceMint paper suggest that a miner doing a bit extra work could potentially have an edge on other miners while using less space.

Burst PoC3 is considered a Post-Dymaxion change. It proposed to build on PoC2, but with the ability to store dual-use data (i.e. Burst plots and non-plot data).

#### Why Does PoC Matter?

*   **Proof of Capacity is Efficient.**

PoC is very efficient when compared to PoW miners that use ASICs to mine. [Burst transactions on average use 1/500 the energy used per Bitcoin transaction.](https://www.burst-coin.org/)

*   **Proof of Capacity is Cheap.**

You can get started mining Burst with an extra laptop and external HDD, compared to the expensive, specialized ASIC rigs or GPUs needed for most PoW mining.

![](https://hackernoon.com/hn-images/1*Oq99khygl-sucspV8VdOug.png)

*   **Proof of Capacity is Distributed.**

Because excess storage space is common, hardware is cheap, and competition is less fierce, a more diverse group of people can become involved in PoC mining, meaning a more decentralized network.

Part 1 — [What is Burstcoin?](https://medium.com/@aclaytonscott/burst-part-1-what-is-burstcoin-d172561aba70)

Part 2 — [macOS Wallet Setup Tutorial](https://medium.com/@aclaytonscott/burst-part-2-macos-wallet-setup-tutorial-2822bb029f54)

Part 3 — [Proof-of-Capacity](https://hackernoon.com/burst-part-3-proof-of-capacity-the-green-alternative-8e2651211671)

Part 4 — [Network Analysis](https://hackernoon.com/burst-part-4-network-analysis-a8c1305a5750)

Part 5 — [How to Buy Burst](https://medium.com/@aclaytonscott/burst-part-5-how-to-buy-burst-5873b934ab2f)

Part 6 — [The Burst Dymaxion Explained](https://medium.com/@aclaytonscott/burst-part-6-the-burst-dymaxion-90f8e5c69a75)

_Donations are always appreciated:_

_Burst \*\*\* BURST-Q944–2MY3–97ZZ-FBWGB_

BTC \*\*\* 1KUMJDvX8fGTpsZ49NXmmL9UpWiUX8g6K7

Litecoin

Dash

Fetch

Lisk

Target

Too Long; Didn't Read

Build JavaScript blockchain apps easily with Lisk

BitcoinBurst — Part 3: Proof-of-Capacity, The Green Alternative?

Too Long; Didn't Read

Companies Mentioned

Coins Mentioned

@aclaytonscott

RELATED STORIES