{"id":8055,"date":"2022-09-26T19:20:38","date_gmt":"2022-09-26T19:20:38","guid":{"rendered":"https:\/\/mdr.foobrdigital.com\/?p=8055"},"modified":"2022-09-26T19:20:38","modified_gmt":"2022-09-26T19:20:38","slug":"making-the-chain-unbreakable","status":"publish","type":"post","link":"https:\/\/mudassirbackup.infinitycodestudio.com\/index.php\/2022\/09\/26\/making-the-chain-unbreakable\/","title":{"rendered":"Making the chain unbreakable"},"content":{"rendered":"\n<p>The innovation of blockchain technology is that by design, blockchains are resistant to retroactive modification and can store data securely without a centralised authority.&nbsp;<\/p>\n\n\n\n<p>The process starts with the cryptographic hash function. Each block has a hash function for its own data and a hash function for the last block&#8217;s data.&nbsp;<\/p>\n\n\n\n<p>By encoding the previous block&#8217;s data into each new block, the hashes create a chain that is it grows becomes ever harder to corrupt.; to tamper with, or modify any particular block&#8217;s data, you would also have to modify all subsequent blocks to keep the chain valid.&nbsp;<\/p>\n\n\n\n<p>If I change the data on a specific block, it&#8217;s corresponding hash will change &#8211; remember from our dog example above &#8211; and be different to all following block&#8217;s recorded hashes and thus the chain will become invalid.&nbsp;<\/p>\n\n\n\n<p>However, due to the speed of today&#8217;s computers, this hash function isn&#8217;t enough to secure blockchain&#8217;s from being tampered with.&nbsp;<\/p>\n\n\n\n<p>Computers can calculate hundreds of thousands of hash functions per second and could effectively calculate new hashes for all blocks in a chain to make it valid again. Thus, Sastoshi&#8217;s need to create a consensus mechanism &#8211; borrowing from previous attempts at digital cash &#8211; that was immune to brute force attack.&nbsp;&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>The innovation of blockchain technology is that by design, blockchains are resistant to retroactive modification and can store data securely without a centralised authority.&nbsp; The process starts with the cryptographic hash function. Each block has a hash function for its own data and a hash function for the last block&#8217;s data.&nbsp; By encoding the previous [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[455],"tags":[],"_links":{"self":[{"href":"https:\/\/mudassirbackup.infinitycodestudio.com\/index.php\/wp-json\/wp\/v2\/posts\/8055"}],"collection":[{"href":"https:\/\/mudassirbackup.infinitycodestudio.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/mudassirbackup.infinitycodestudio.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/mudassirbackup.infinitycodestudio.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/mudassirbackup.infinitycodestudio.com\/index.php\/wp-json\/wp\/v2\/comments?post=8055"}],"version-history":[{"count":0,"href":"https:\/\/mudassirbackup.infinitycodestudio.com\/index.php\/wp-json\/wp\/v2\/posts\/8055\/revisions"}],"wp:attachment":[{"href":"https:\/\/mudassirbackup.infinitycodestudio.com\/index.php\/wp-json\/wp\/v2\/media?parent=8055"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/mudassirbackup.infinitycodestudio.com\/index.php\/wp-json\/wp\/v2\/categories?post=8055"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/mudassirbackup.infinitycodestudio.com\/index.php\/wp-json\/wp\/v2\/tags?post=8055"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}