Skip to content

perf: Optimize Morton order with hypercube and vectorization #3708

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
d-v-b merged 21 commits into from
Feb 19, 2026

Update 3708.misc.md

4a342c9
Select commit
Loading
Failed to load commit list.
Merged

perf: Optimize Morton order with hypercube and vectorization #3708

Update 3708.misc.md
4a342c9
Select commit
Loading
Failed to load commit list.
CodSpeed HQ / CodSpeed Performance Analysis succeeded Feb 19, 2026 in 0s

Performance Gate Passed

⚡ 4 improved benchmarks
✅ 52 untouched benchmarks
⏩ 6 skipped benchmarks1

Performance Changes

Mode Benchmark BASE HEAD Efficiency
⚡ WallTime test_sharded_morton_write_single_chunk[(32, 32, 32)-memory] 953.3 ms 548.4 ms +73.84%
⚡ WallTime test_morton_order_iter[(16, 16, 16)] 56.2 ms 8.3 ms ×6.8
⚡ WallTime test_morton_order_iter[(8, 8, 8)] 6.2 ms 1.1 ms ×5.4
⚡ WallTime test_morton_order_iter[(32, 32, 32)] 502.6 ms 70.7 ms ×7.1

Comparing mkitti:mkitti-morton-decode-optimization (4a342c9) with main (36caf1f)

Open in CodSpeed

Footnotes

  1. 6 benchmarks were skipped, so the baseline results were used instead. If they were deleted from the codebase, click here and archive them to remove them from the performance reports. ↩

View more details on CodSpeed HQ