55 Benchmarks

Executed in Nanoseconds

Sub-microsecond execution times across 55 operations. Real benchmarks from real hardware.

Last run: January 1, 2026 at 12:24 AM UTC

9.7 ns
Fastest Op
8.20 μs
Avg Compiler
0.0 ns
Avg Backend
3
Categories

Execution Performance

Average execution times across key operation categories.

8.2μs
122x faster than 1ms

Compiler Operations

Circuit canonicalization and compilation

0ns
InfinityKx faster than 1ms

Backend Execution

ISA instructions and Unit Group operations

Speed Comparison

Direct visual comparison against common reference times.

Compiler Operations

8.2μs

Circuit canonicalization and compilation

Your benchmark
8.2μs
1 millisecond
122x slower
100 microseconds
12x slower
10 microseconds
1 microsecond

Backend Execution

0ns

ISA instructions and Unit Group operations

Your benchmark
0ns
1 millisecond
Infinityx slower
100 microseconds
Infinityx slower
10 microseconds
Infinityx slower
1 microsecond
Infinityx slower

Throughput Capacity

Operations per second at average execution times. Higher throughput enables real-time processing at scale.

Compiler Operations

Circuit canonicalization and compilation

121.9Kops/sec
121.9K
1K
10K
100K
1M
10M
100M
1B
Lower throughputHigher throughput →
8.2μsaverage execution time

Backend Execution

ISA instructions and Unit Group operations

InfinityBops/sec
InfinityB
1K
10K
100K
1M
10M
100M
1B
Lower throughputHigher throughput →
0nsaverage execution time

Speed in Context

Nanoseconds are abstract. Here's what they mean.

17,711×
Faster Than Thought

Human neural processing: ~13ms. Homgram O(1) lookup: ~734.0 ns.

408,719×
Lookups Per Blink

One blink (300ms) = 408,719 Homgram lookups.

68,120+
Per Heartbeat

Homgram lookups possible in a single 50ms heartbeat interval.

220m
Light Distance

Light travels 220m during one Homgram lookup.

Algorithmic Advantage

Homgram O(1) lookup vs traditional O(n²)/O(n³) approaches (logarithmic scale)

Homgram734.0 ns
O(n²) n=101.00 μs
O(n²) n=100100.00 μs
O(n²) n=100010.00 ms
O(n³) n=10010.00 ms

What We Benchmark

Comprehensive testing across all Homgram subsystems. Each category measures specific performance characteristics.

Compiler

2 benchmarks

Measures time to normalize circuits via 96-class geometric system and compile them for execution.

Fastest6.30 μs

Buffer Operations

2 benchmarks

Buffer allocation and memory operations

Fastest2.19 μs

Other

51 benchmarks

Cache analysis, character products, orbit operations, address computation, and type dispatch benchmarks.

Fastest9.7 ns

Performance Visualized

Side-by-side comparison of execution times. Shorter bars = faster operations.

Compiler Operations

Circuit canonicalization and compilation via the 96-class geometric system. These operations enable O(1) lookup times for circuit transformations.

Compiler Benchmarks

Compile Scheduling (compile_standard)
6.30 μs
Compile Scheduling (compile_parallel)
10.11 μs
05.05 μs10.11 μs

Backend Execution

ISA instruction execution and Unit Group operations across multiple precision types (i8, f16, f32, f64). These form the computational foundation for Homgram.

Backend Benchmarks

0-Infinity ns-Infinity ns

All Benchmarks

Detailed statistics by category. Click any card for confidence intervals and throughput data.

Compiler

Circuit compilation and canonicalization

Compile Scheduling (compile_standard)compiler
6.30 μs
Compile Scheduling (compile_parallel)compiler
10.11 μs

Buffer Operations

Buffer allocation and memory operations

Buffer Planning (without_buffer_reuse)core/buffer
2.19 μs
Buffer Planning (with_buffer_reuse)core/buffer
2.49 μs

Other

Uncategorized benchmarks

Complexity Validation (simple_function)other
9.7 ns
Shape Operations (create_concrete_4d)other
17.1 ns
Shape Operations (transpose_shape)other
24.9 ns
Complexity Validation (attention_function)other
28.8 ns
Shape Operations (matmul_shape)other
31.4 ns
Shape Operations (broadcast_2d)other
64.3 ns
Shape Operations (broadcast_4d)other
75.8 ns
Shape Operations (create_symbolic_4d)other
82.1 ns
Class Map Composition (compose_2_maps)other
114.8 ns
Complexity Validation (large_module)other
157.0 ns
Class Map Composition (compose_3_maps)other
159.6 ns
Class Map Composition (compose_5_maps)other
252.2 ns
+39more benchmarks

Methodology

Transparent, reproducible, verifiable. All benchmarks run with criterion.rs using 100 sample iterations with 10 warmup iterations excluded.

January 1, 2026
44a2366

See For Yourself

Clone the repo. Run the benchmarks. Verify the numbers. The speed is real.