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