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