Parent Log:
http://ci.aztec-labs.com/f213c7a0e0587cf2
Command: 68e9475192d7aeac yarn-project/scripts/run_test.sh merkle-tree/src/sparse_tree/sparse_tree.test.ts
Commit:
https://github.com/AztecProtocol/aztec-packages/commit/f495236d35f9bb0d1086b7ec79256c2c2b7c98b8
Env: REF_NAME=gh-readonly-queue/staging/pr-15201-f0619dd82429a5973f3e1da8d7eb0877264908e3 CURRENT_VERSION=0.87.6 CI_FULL=1
Date: Sat Jun 21 13:20:02 UTC 2025
System: ARCH=amd64 CPUS=128 MEM=493Gi HOSTNAME=pr-15201_amd64_x1-full
Resources: CPU_LIST=0-127 CPUS=2 MEM=8g TIMEOUT=600s
History:
http://ci.aztec-labs.com/list/history_03fe1625e86d8739_staging
13:20:07
PASS src/sparse_tree/sparse_tree.test.ts
13:20:07 SparseTree
13:20:07
✓ should revert changes on rollback (304 ms)
13:20:07
✓ should not revert changes after commit (206 ms)
13:20:07
✓ should be able to restore from previous committed data (108 ms)
13:20:07
✓ should throw an error if previous data does not exist for the given name (74 ms)
13:20:07
✓ should serialize sibling path data to a buffer and be able to deserialize it back (95 ms)
13:20:07
✓ should have correct empty tree root for depth 32 (63 ms)
13:20:07
✓ should throw when appending beyond max index (28 ms)
13:20:07
✓ should have correct root and sibling paths (92 ms)
13:20:07 SparseTreeSpecific
13:20:07
✓ throws when index is bigger than (2^DEPTH - 1) (68 ms)
13:20:07
✓ updating non-empty leaf does not change tree size (119 ms)
13:20:07
✓ deleting leaf decrements tree size (903 ms)
13:20:07
✓ should have correct root and sibling path after in a "non-append-only" way (74 ms)
13:20:07
○ skipped measures time of inserting 1000 leaves at random positions for depth 254
13:20:07
13:20:07
Test Suites: 1 passed, 1 total
13:20:07
Tests: 1 skipped,
12 passed, 13 total
13:20:07
Snapshots: 0 total
13:20:07
Time: 3.294 s
13:20:07
Ran all test suites matching merkle-tree/src/sparse_tree/sparse_tree.test.ts
.
13:20:07
Force exiting Jest: Have you considered using `--detectOpenHandles` to detect async operations that kept running after all tests finished?