chore: rm penultimate_level_data() from Tree

summa-dev · Nov 10, 2023 · 2d9d65c · 2d9d65c
1 parent e308b7e
commit 2d9d65c
Show file tree

Hide file tree

Showing 3 changed files with 0 additions and 46 deletions.
diff --git a/zk_prover/src/merkle_sum_tree/mst.rs b/zk_prover/src/merkle_sum_tree/mst.rs
@@ -47,16 +47,6 @@ impl<const N_ASSETS: usize, const N_BYTES: usize> Tree<N_ASSETS, N_BYTES>
     fn get_entry(&self, index: usize) -> &Entry<N_ASSETS> {
         &self.entries[index]
     }
-
-    /// Returns the nodes stored at the penultimate level of the tree, namely the one before the root
-    fn penultimate_level_data(&self) -> Result<(&Node<N_ASSETS>, &Node<N_ASSETS>), &'static str> {
-        let penultimate_level = self
-            .nodes
-            .get(self.depth - 1)
-            .ok_or("The tree does not have a penultimate level")?;
-
-        Ok((&penultimate_level[0], &penultimate_level[1]))
-    }
 }
 
 impl<const N_ASSETS: usize, const N_BYTES: usize> MerkleSumTree<N_ASSETS, N_BYTES> {

diff --git a/zk_prover/src/merkle_sum_tree/tests.rs b/zk_prover/src/merkle_sum_tree/tests.rs
@@ -226,37 +226,4 @@ mod test {
         let fp_3 = fp_2 - fp;
         assert_eq!(fp_3, 18446744073709551613.into());
     }
-
-    #[test]
-    fn test_penultimate_level_data() {
-        let merkle_tree =
-            MerkleSumTree::<N_ASSETS, N_BYTES>::new("src/merkle_sum_tree/csv/entry_16.csv")
-                .unwrap();
-
-        let root = merkle_tree.root();
-
-        let (node_left, node_right) = merkle_tree
-            .penultimate_level_data()
-            .expect("Failed to retrieve penultimate level data");
-
-        // perform hashing using poseidon node
-        let expected_root = poseidon_node(
-            node_left.hash,
-            node_left.balances,
-            node_right.hash,
-            node_right.balances,
-        );
-
-        assert_eq!(root.hash, expected_root);
-
-        assert_eq!(
-            root.balances[0],
-            node_left.balances[0] + node_right.balances[0]
-        );
-
-        assert_eq!(
-            root.balances[1],
-            node_left.balances[1] + node_right.balances[1]
-        );
-    }
 }
diff --git a/zk_prover/src/merkle_sum_tree/tree.rs b/zk_prover/src/merkle_sum_tree/tree.rs
@@ -18,9 +18,6 @@ pub trait Tree<const N_ASSETS: usize, const N_BYTES: usize> {
 
     fn get_entry(&self, index: usize) -> &Entry<N_ASSETS>;
 
-    /// Returns the nodes stored at the penultimate level of the tree, namely the one before the root
-    fn penultimate_level_data(&self) -> Result<(&Node<N_ASSETS>, &Node<N_ASSETS>), &'static str>;
-
     /// Generates a MerkleProof for the user with the given index.
     fn generate_proof(&self, index: usize) -> Result<MerkleProof<N_ASSETS, N_BYTES>, &'static str> {
         let nodes = self.nodes();