-
Notifications
You must be signed in to change notification settings - Fork 33
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
* depend only on wtxid * verify merkle root of coinbase tx, use zkvm efficient sh256 and bitcoin merkle tree * remove unused asserts * pr fixes * pr fixes
- Loading branch information
1 parent
4bd460f
commit 33c8342
Showing
15 changed files
with
292 additions
and
127 deletions.
There are no files selected for viewing
Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.
Oops, something went wrong.
Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,142 @@ | ||
| /// Code is taken from Clementine | ||
| /// https://github.com/chainwayxyz/clementine/blob/b600ea18df72bdc60015ded01b78131b4c9121d7/operator/src/bitcoin_merkle.rs | ||
| /// | ||
| use super::calculate_double_sha256; | ||
|
|
||
| #[derive(Debug, Clone)] | ||
| pub struct BitcoinMerkleTree { | ||
| depth: u32, | ||
| nodes: Vec<Vec<[u8; 32]>>, | ||
| } | ||
|
|
||
| impl BitcoinMerkleTree { | ||
| pub fn new(transactions: Vec<[u8; 32]>) -> Self { | ||
| if transactions.len() == 1 { | ||
| // root is the coinbase txid | ||
| return BitcoinMerkleTree { | ||
| depth: 1, | ||
| nodes: vec![transactions], | ||
| }; | ||
| } | ||
|
|
||
| let depth = (transactions.len() - 1).ilog(2) + 1; | ||
| let mut tree = BitcoinMerkleTree { | ||
| depth, | ||
| nodes: vec![transactions], | ||
| }; | ||
|
|
||
| // Construct the tree | ||
| let mut curr_level_offset: usize = 1; | ||
| let mut prev_level_size = tree.nodes[0].len(); | ||
| let mut prev_level_index_offset = 0; | ||
| let mut preimage: [u8; 64] = [0; 64]; | ||
| while prev_level_size > 1 { | ||
| tree.nodes.push(vec![]); | ||
| for i in 0..(prev_level_size / 2) { | ||
| preimage[..32].copy_from_slice( | ||
| &tree.nodes[curr_level_offset - 1 as usize][prev_level_index_offset + i * 2], | ||
| ); | ||
| preimage[32..].copy_from_slice( | ||
| &tree.nodes[curr_level_offset - 1][prev_level_index_offset + i * 2 + 1], | ||
| ); | ||
| let combined_hash = calculate_double_sha256(&preimage); | ||
| tree.nodes[curr_level_offset].push(combined_hash); | ||
| } | ||
| if prev_level_size % 2 == 1 { | ||
| let mut preimage: [u8; 64] = [0; 64]; | ||
| preimage[..32].copy_from_slice( | ||
| &tree.nodes[curr_level_offset - 1] | ||
| [prev_level_index_offset + prev_level_size - 1], | ||
| ); | ||
| preimage[32..].copy_from_slice( | ||
| &tree.nodes[curr_level_offset - 1] | ||
| [prev_level_index_offset + prev_level_size - 1], | ||
| ); | ||
| let combined_hash = calculate_double_sha256(&preimage); | ||
| tree.nodes[curr_level_offset].push(combined_hash); | ||
| } | ||
| curr_level_offset += 1; | ||
| prev_level_size = (prev_level_size + 1) / 2; | ||
| prev_level_index_offset = 0; | ||
| } | ||
| tree | ||
| } | ||
|
|
||
| // Returns the Merkle root | ||
| pub fn root(&self) -> [u8; 32] { | ||
| return self.nodes[self.nodes.len() - 1][0]; | ||
| } | ||
|
|
||
| pub fn get_element(&self, level: u32, index: u32) -> [u8; 32] { | ||
| return self.nodes[level as usize][index as usize]; | ||
| } | ||
|
|
||
| pub fn get_idx_path(&self, index: u32) -> Vec<[u8; 32]> { | ||
| assert!( | ||
| index <= self.nodes[0].len() as u32 - 1, | ||
| "Index out of bounds" | ||
| ); | ||
| let mut path = vec![]; | ||
| let mut level = 0; | ||
| let mut i = index; | ||
| while level < self.nodes.len() as u32 - 1 { | ||
| if i % 2 == 1 { | ||
| path.push(self.nodes[level as usize][i as usize - 1]); | ||
| } else { | ||
| if (self.nodes[level as usize].len() - 1) as u32 == i { | ||
| path.push(self.nodes[level as usize][i as usize]); | ||
| } else { | ||
| path.push(self.nodes[level as usize][(i + 1) as usize]); | ||
| } | ||
| } | ||
| level += 1; | ||
| i = i / 2; | ||
| } | ||
| return path; | ||
| } | ||
|
|
||
| pub fn calculate_root_with_merkle_proof( | ||
| txid: [u8; 32], | ||
| idx: u32, | ||
| merkle_proof: Vec<[u8; 32]>, | ||
| ) -> [u8; 32] { | ||
| let mut preimage: [u8; 64] = [0; 64]; | ||
| let mut combined_hash: [u8; 32] = txid.clone(); | ||
| let mut index = idx; | ||
| let mut level: u32 = 0; | ||
| while level < merkle_proof.len() as u32 { | ||
| if index % 2 == 0 { | ||
| preimage[..32].copy_from_slice(&combined_hash); | ||
| preimage[32..].copy_from_slice(&merkle_proof[level as usize]); | ||
| combined_hash = calculate_double_sha256(&preimage); | ||
| } else { | ||
| preimage[..32].copy_from_slice(&merkle_proof[level as usize]); | ||
| preimage[32..].copy_from_slice(&combined_hash); | ||
| combined_hash = calculate_double_sha256(&preimage); | ||
| } | ||
| level += 1; | ||
| index = index / 2; | ||
| } | ||
| combined_hash | ||
| } | ||
| } | ||
|
|
||
| #[cfg(test)] | ||
| mod tests { | ||
| use super::*; | ||
|
|
||
| #[test] | ||
| fn test_merkle_tree() { | ||
| let mut transactions: Vec<[u8; 32]> = vec![]; | ||
| for i in 0u8..100u8 { | ||
| let tx = [i; 32]; | ||
| transactions.push(tx); | ||
| } | ||
| let tree = BitcoinMerkleTree::new(transactions.clone()); | ||
| let root = tree.root(); | ||
| let idx_path = tree.get_idx_path(0); | ||
| let calculated_root = | ||
| BitcoinMerkleTree::calculate_root_with_merkle_proof(transactions[0], 0, idx_path); | ||
| assert_eq!(root, calculated_root); | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.