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