Use e2e tests for stump accumulator

keep-starknet-strange · Jan 5, 2025 · 028589f · 028589f
1 parent bdacade
commit 028589f
Show file tree

Hide file tree

Showing 3 changed files with 0 additions and 1,070 deletions.
diff --git a/packages/utreexo/src/lib.cairo b/packages/utreexo/src/lib.cairo
@@ -2,8 +2,6 @@ pub mod stump {
     pub mod accumulator;
     pub mod proof;
     pub mod state;
-    #[cfg(test)]
-    mod accumulator_tests;
 }
 pub mod vanilla {
     pub mod accumulator;

diff --git a/packages/utreexo/src/stump/accumulator.cairo b/packages/utreexo/src/stump/accumulator.cairo
@@ -114,34 +114,4 @@ pub impl StumpUtreexoAccumulatorImpl of StumpUtreexoAccumulator {
 
         Result::Ok(UtreexoStumpState { roots: new_roots.span(), num_leaves: *self.num_leaves })
     }
-
-    /// Legacy implementation of proof verification.
-    fn verify_legacy(
-        self: @UtreexoStumpState, proof: @UtreexoBatchProof, del_hashes: Span<felt252>,
-    ) -> Result<(), ByteArray> {
-        let computed_roots: Span<felt252> = proof
-            .compute_roots_legacy(del_hashes, *self.num_leaves)?;
-        let mut number_matched_roots: u32 = 0;
-
-        for i in 0..computed_roots.len() {
-            for root in *self.roots {
-                match root {
-                    Option::Some(root) => {
-                        if (computed_roots[i] == root) {
-                            number_matched_roots += 1;
-                        };
-                    },
-                    Option::None => {},
-                };
-            };
-        };
-
-        let computed_roots_len = computed_roots.len();
-
-        if (computed_roots_len != number_matched_roots && computed_roots_len != 0) {
-            return Result::Err("Proof verification failed");
-        }
-
-        Result::Ok(())
-    }
 }