Algorithm 1 Proposed Algorithm

Input: In the blockchain, Input “data.” Data can be anything like a word, a line, a paragraph, or multiple paragraphs. data can be transactions of any digital currency.        $\left\{dat{a}_{event}\left[2^{256}-1\right]\right\}$ Output: A block created for every set of data. And as a result, a chain of the block is created known as the blockchain. $$\left\{HashValueofmedicalinputdata\right\}$$ $$intheintervalofpositiveinteger\left[0,2^{256}\right)$$ Assumption: Blockchain is a giant public ledger that tracks all bitcoin transactions ever made. These incoming transactions are referred to as “inputs. “Transactions entered in the order in which they occurred. START: FOR EVERY $\left\{dat{a}_{event}\left[2^{256}-1\right]\right\}$ Step 1: Pre-processing: Generate a hash for the data. The hash depends upon the previous hash and the data in the current hash. Initial hash value (ph = 2,3,5,7,11,13,17,19) $$int\left(\right(\sqrt{p}mod1)\ast {16}^8)$$ Step 2: Hash Computing Using Preprocessing Data: Now, we compute additional 48 words, totaling the number of words to 64. Here we compute the 10th word ( $W_9$ ). $$W_t=ROTL({\sigma }_1\left(W_{t-2}\right)+W_{t-7}+{\sigma }_0\left(W_{t-8}\right)+W_{t-9})$$ $${\sigma }_0=ROT{L}^9\left(m1\right)\vee ROT{L}^{12}\left(m1\right)\vee SH{L}^3\left(m1\right)$$ $${\sigma }_1=ROT{L}^{11}\left(m1\right)\vee ROT{L}^{13}\left(m1\right)\vee SH{L}^{34}\left(m1\right)$$ $$t=10\mathrm{and}{m}_1=W_{t-9}$$ $$ROTL-LeftRotate$$ Step 3: A small change in data creates a new hash known as AVALANCHE EFFECT. Create a block for a particular set of data. A block is accepted when 51% of the nodes verify the data within the block. That is known as BYZANTINE FAULT TOLERANCE. Step 4: Generate a new block with hash values (a, b, c, d, e, f, g, h) for other sets of data. $$\mathit{F}\mathit{o}\mathit{r}\mathit{t}=\mathbf{0}\mathit{t}\mathit{o}\mathbf{63}$$ $$T_1=h+{\displaystyle {\displaystyle \sum }_1^{256}}\mathrm{e}+\mathrm{ch}\left(\mathrm{e},\mathrm{f},\mathrm{g}\right)+k_t^{256}+W_t$$ $$T_2=h+{\displaystyle {\displaystyle \sum }_1^{256}}\mathrm{a}+\mathrm{maj}\left(\mathrm{a},\mathrm{b},\mathrm{c}\right)$$ $$h=g=f$$ $$f=d+T_1$$ $$e=f+T_1$$ $$d=c$$ $$c=b=a$$ $$anda=T_1+T_2$$ Step 5: The chain of the block created is known as the blockchain. Step 6: TO COMPUTE THE FINAL HASH, RUN THE 64 ITERATIONS OF STEP 4.