Parent Log: http://ci.aztec-labs.com/78cea4cf271fb3a9 Command: 128a905c1f9c1691 yarn-project/scripts/run_test.sh merkle-tree/src/sparse_tree/sparse_tree.test.ts Commit: https://github.com/AztecProtocol/aztec-packages/commit/76ca48a2187e3506bb464eae574e49476c2876ca Env: REF_NAME=gh-readonly-queue/next/pr-15045-9d6fb0bd1594726370a5f3a56591963452264642 CURRENT_VERSION=0.87.6 CI_FULL=1 Date: Fri Jun 13 18:05:25 UTC 2025 System: ARCH=amd64 CPUS=128 MEM=493Gi HOSTNAME=pr-15045_amd64_x2-full Resources: CPU_LIST=0-127 CPUS=2 MEM=8g TIMEOUT=600s History: http://ci.aztec-labs.com/list/history_03fe1625e86d8739_next 18:05:29 PASS src/sparse_tree/sparse_tree.test.ts 18:05:29 SparseTree 18:05:29 ✓ should revert changes on rollback (117 ms) 18:05:29 ✓ should not revert changes after commit (136 ms) 18:05:29 ✓ should be able to restore from previous committed data (117 ms) 18:05:29 ✓ should throw an error if previous data does not exist for the given name (45 ms) 18:05:29 ✓ should serialize sibling path data to a buffer and be able to deserialize it back (82 ms) 18:05:29 ✓ should have correct empty tree root for depth 32 (70 ms) 18:05:29 ✓ should throw when appending beyond max index (31 ms) 18:05:29 ✓ should have correct root and sibling paths (102 ms) 18:05:29 SparseTreeSpecific 18:05:29 ✓ throws when index is bigger than (2^DEPTH - 1) (60 ms) 18:05:29 ✓ updating non-empty leaf does not change tree size (103 ms) 18:05:29 ✓ deleting leaf decrements tree size (749 ms) 18:05:29 ✓ should have correct root and sibling path after in a "non-append-only" way (69 ms) 18:05:29 ○ skipped measures time of inserting 1000 leaves at random positions for depth 254 18:05:29 18:05:29 Test Suites: 1 passed, 1 total 18:05:29 Tests: 1 skipped, 12 passed, 13 total 18:05:29 Snapshots: 0 total 18:05:29 Time: 2.874 s 18:05:29 Ran all test suites matching /merkle-tree\/src\/sparse_tree\/sparse_tree.test.ts/i. 18:05:29 Force exiting Jest: Have you considered using `--detectOpenHandles` to detect async operations that kept running after all tests finished?