Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/hrmeetsingh/blockchain-merkle-proofs
Demonstration of Merkle root verification with Javascript/Typescript on blockchain
https://github.com/hrmeetsingh/blockchain-merkle-proofs
blockchain merkle merkle-proof merkle-root merkle-tree merkletree
Last synced: 6 days ago
JSON representation
Demonstration of Merkle root verification with Javascript/Typescript on blockchain
- Host: GitHub
- URL: https://github.com/hrmeetsingh/blockchain-merkle-proofs
- Owner: hrmeetsingh
- Created: 2024-08-09T17:31:53.000Z (5 months ago)
- Default Branch: main
- Last Pushed: 2024-08-26T02:45:49.000Z (5 months ago)
- Last Synced: 2024-11-09T05:20:53.541Z (2 months ago)
- Topics: blockchain, merkle, merkle-proof, merkle-root, merkle-tree, merkletree
- Language: TypeScript
- Homepage:
- Size: 526 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
## Blockchain verification using Merkle proof in JavaScript
Example code taken from [This repo](https://gist.github.com/eddmann/6b8d0ddd3123c37f296b7680b8fa198a)
To run the verification script
```shell
npm i
npm run verify
```
---
What happens in a proof calculation?
- Fetching the latest block hash from blockchain
- Getting information of the block and picking up two specific data points - merkle root and transaction hashes
- Selecting a random transaction hash from the list (leaf)
- Calculating the merkle proof using the transaction and the whole list of transactions
- Verifying the merkle proof stands for the proof generated in previous step
---
Steps involved in BTC merkle root calculation:
- List All Transactions:
- Start with all the transactions in the block. Each transaction is hashed using SHA-256 twice (double SHA-256) to produce a transaction hash.
- Pair Hashes Together:
- The transaction hashes are paired together. If the number of transactions is odd, the last hash is duplicated to make the number of pairs even.
- Hash the Pairs:
- Each pair of hashes is concatenated together and hashed again using double SHA-256. This produces a new list of hashes, which are now half the size of the previous list.
- Repeat the Process:
- The process of pairing and hashing is repeated on the new list of hashes until only one hash remains. This final hash is the Merkle root.
---
Merkel proof calculation complexity ( log21494 steps)
-------
