Making the Blockchain.

A blockchain is just a chain/list of blocks. Each block in the blockchain will have its own digital fingerprint, contain digital fingerprint of the previous block, and have some data ( this data could be transactions for example ).

I sure hope Nakamoto never sees this.

Hash = Digital Fingerprint.

Each block doesn’t just contain the hash of the block before it, but its own hash is in part, calculated from the previous hash. If the previous block’s data is changed then the previous block’s hash will change ( since it is calculated in part, by the data) in turn affecting all the hashes of the blocks there after. Calculating and comparing the hashes allow us to see if a blockchain is invalid.

What does this mean ? …Changing any data in this list, will change the signature and break the chain.

So Firsts lets create class Block that make up the blockchain:

As you can see our basic Block contains a String hash that will hold our digital signature. The variable previousHash to hold the previous block’s hash and String data to hold our block data.

Next we will need a way to generate a digital fingerprint,

there are many cryptographic algorithms you can choose from, however SHA256 fits just fine for this example. We can import java.security.MessageDigest; to get access to the SHA256 algorithm.

We need to use SHA256 later down the line so lets create a handy helper method in a new StringUtil ‘utility’ class :

This is mostly a carbon copy of the http://www.baeldung.com/sha-256-hashing-java

Don’t worry too much if you don’t understand the contents of this helper method, all you need to know is that it takes a string and applies SHA256 algorithm to it, and returns the generated signature as a string.

Now lets use our applySha256 helper, in a new method in the Block class, to calculate the hash. We must calculate the hash from all parts of the block we don’t want to be tampered with. So for our block we will include the previousHash , the data and timeStamp .

and lets add this method to the Block constructor…

Time for some testing…

In our main NoobChain class lets create some blocks and print the hashes to the screen to see that everything is in working order.

Lets test this…

The first block is called the genesis block, and because there is no previous block we will just enter “0” as the previous hash.

The output should look similar to this:

Your values will be different because your timestamp will be different.

Each block now has its own digital signature based on its information and the signature of the previous block.

Currently it’s not much of a blockchain, so lets store our blocks in an ArrayList and also import gson to view it as Json. (click here to find out how to import the gson library)

Now our output should look something closer to what we expect a blockchain to look like.

Now we need a way to check the integrity of our blockchain.

Lets create an isChainValid() Boolean method in the NoobChain class, that will loop through all blocks in the chain and compare the hashes. This method will need to check the hash variable is actually equal to the calculated hash, and the previous block’s hash is equal to the previousHash variable.

Any change to the blockchain’s blocks will cause this method to return false.

On the bitcoin network nodes share their blockchains and the longest valid chain is accepted by the network. What’s to stop someone tampering with data in an old block then creating a whole new longer blockchain and presenting that to the network ? Proof of work. The hashcash proof of work system means it takes considerable time and computational power to create new blocks. Hence the attacker would need more computational power than the rest of the peers combined.

hashcash, much wow.

Lets start mining blocks !!!

We will require miners to do proof-of-work by trying different variable values in the block until its hash starts with a certain number of 0’s.

Lets add an int called nonce to be included in our calculateHash() method, and the much needed mineBlock() method :

In reality each miner will start iterating from a random point. Some miners may even try random numbers for nonce. Also it’s worth noting that at the harder difficulties solutions may require more than integer.MAX_VALUE, miners can then try changing the timestamp.

The mineBlock() method takes in an int called difficulty, this is the number of 0’s they must solve for. Low difficulty like 1 or 2 can be solved nearly instantly on most computers, i’d suggest something around 4–6 for testing. At the time of writing Litecoin’s difficulty is around 442,592.

Lets add the difficulty as a static variable to the NoobChain class :

public static int difficulty = 5;

We should update the NoobChain class to trigger the mineBlock() method for each new block. The isChainValid() Boolean should also check if each block has a solved ( by mining ) hash.

Notice we also check and print isChainValid.

Running this your results should look like :

Mining each block took some time! ( around 3 seconds ) You should mess around with the difficulty value to see how that effects the time it takes to mine each block ;)

If someone were to tamper 😒 with the data in your blockchain system:

Their blockchain would be invalid.

They would not be able to create a longer blockchain.

Honest blockchains in your network will have a time advantage on the longest chain.

A tampered blockchain will not be able to catch up with a longer & valid chain. *

*unless they have vastly more computation speed than all other nodes in your network combined. A future quantum computer or something.

You’re all done with your basic blockchain!

Go on pat yourself on the back.

Your blockchain:

> Is made up of blocks that store data.

> Has a digital signature that chains your blocks together.

> Requires proof of work mining to validate new blocks.

> Can be check to see if data in it is valid and unchanged.

You can download these project files on Github.