As we know blockchains are designed to be immutable.
 Here we will design a simple blockchain that will help you understand how hashing makes a blockchain immutable with just a few lines of Java Code. Note: This is just a demo blockchain, real blockchain involves a lot of other things such as consensus mechanisms, digital signatures, Merkle Tree, etc.. This code sample will be beneficial for an ideal purpose. The first Block in a blockchain is a Genesis block. The genesis block is almost always hard coded into the software of the applications that utilize its blockchain. For every new block that is generated afterward, we are going to use the previous block’s hash, as well as its own transactions, as input to determine its block hash. As; [] contents ={Arrays.hashCode(transactions),previousHash};
  blockHash = Arrays.hashCode(contents); Object A hash function is a mathematical function that takes the input of arbitrary length numerical data and converts it into fixed-length numerical data. Different hash functions use different algorithms to produce hash values. Moreover, a hash function will always give same output for any particular input always.
 But if you make even a small change in the input the hash value produced will be completely different 
as compared to the previous one. Remember hashing is not encryption. In encryption, once you encrypt the data you can get it back by decrypting it, unlike in hashing you cannot get the input back by any method. You might have wondered sometime about why is there a need for hashing algorithms such as SHA256(SECURE HASH ALGORITHM)? The most important reason is that these algorithms help us avoid (similar hash values for different inputs). collisions Now let's see-through code how blockchain makes it impossible to change the hash of a block so that once a block is written to a blockchain, it cannot change. We will create a Block class. Each block will have: List of transactions(int) Previous Block Hash(String[]) Hash(int) After applying getter setter methods to the variables block class look like this: java.util.Arrays; { previousHash; String[] transactions; blockHash; { .previousHash = previousHash; .transactions = transactions;
        Object[] contents = {Arrays.hashCode(transactions),previousHash}; .blockHash = Arrays.hashCode(contents);
    } { previousHash;
    } String[] getTransactions() { transactions;
    } { blockHash;
    } { .previousHash = previousHash;
    } { .transactions = transactions;
        } { .blockHash = blockHash;
 }
} import public class Block private int private private int public Block ( previousHash, String[] transactions) int this this this public int getPreviousHash () return public return public int getBlockHash () return public void setPreviousHash ( previousHash) int this public void setTransactions (String[] transactions) this public void setBlockHash ( blockHash) int this Now let's create a blockchain. We will start by creating a Genesis Block. As Genesis block is the first block in the chain we will hard-code the transactions and previous hash value. Transactions in real blockchain are definitely going be some transaction class and different data structures will be used.
 For simplicity, I am writing them as strings. So the Main class looks like this: java.util.ArrayList; {

    ArrayList<Block> blockchain = ArrayList<>(); {
        String[] genesisTransactions = { , };
        Block genesisBlock = Block( ,genesisTransactions);
        System.out.println( +genesisBlock.getBlockHash());
        String[] block2Transactions = { , };
        Block block2= Block(genesisBlock.getBlockHash(), block2Transactions);
        System.out.println( +block2.getBlockHash());
       String[] block3Transactions = { };
       Block block3 = Block(block2.getBlockHash(), block3Transactions);
       System.out.println( +block3.getBlockHash());
    }        
} import public class Blockchain new public static void main (String[] args) "Suraj sent Ruja 1542 Bitcoins" "Ruja sent 10 Bitcoins to John" new 0 "Genesis Block Hash:" "John sent 10 bitcoins to Suraj" "Suraj sent 10 bitcoins to Alex" new "Block2 Hash:" "Alex sent 999 bitcoins to non" new "Block3 Hash:" Output: Genesis Block Hash:-1106827926 Block2 Hash:957910147 Block3 Hash:-716750945 You can output the HashCode of genesis block change it and see the changes you will see the output differs from the previous output a lot even if you change the case of a single alphabet in the string of transaction. Output after changing "S" of "Suraj" in genesis block transaction to "s": Genesis Block Hash:1528835466 Block2 Hash:-701393757 Block3 Hash:1918912447 This is how a chain of blocks is formed, each new block hash pointing to the block hash that came before it.
 This system of hashing guarantees that no transaction in the history can be tampered with because if any single part of the transaction changes, so does the hash of the block to which it belongs, and any following blocks’ hashes as a result. It would be fairly easy to catch any tampering as a result because you can just compare the hashes.

Chain

Alphabet

Read my stories on medium @surajrajeshdubey123

Read My Stories

Too Long; Didn't Read

Discover Saakuru: Web3 Mass-Adoption with 0-FEES

Building Your Own Blockchain in Java [A How-To Guide]

Too Long; Didn't Read

Company Mentioned

Coin Mentioned

Suraj Dubey

About Author

TOPICS

THIS ARTICLE WAS FEATURED IN...

Building Your Own Blockchain in Java [A How-To Guide]

Too Long; Didn't Read

Company Mentioned

Coin Mentioned

Suraj Dubey

About Author

TOPICS

THIS ARTICLE WAS FEATURED IN...

RELATED STORIES