PyNative compiles untyped, unannotated standard Python into standalone, hermetic machine code binaries for Linux x86_64 (Intel / AMD) and ARM64 (Apple Silicon & AWS Graviton). Zero CPython interpreter overhead. Zero GIL contention. Raw bare-metal performance.
By compiling PyTorch, LLMs, and neural graph loops directly into bare-metal silicon instructions, PyNative eliminates data center bottlenecks.
@turbo vs. Standalone AOTDrop in as a non-invasive decorator for immediate 40× acceleration, or compile your entire application into a 65 KB hermetic binary.
Decorate any CPU-bound bottleneck function with @turbo. PyNative extracts the AST, runs LLVM 18
optimization passes in the background, and replaces the Python code object with a direct hardware pointer.
Inspect the exact untyped Python source code side-by-side with lowered bare-metal machine code (x86_64 AVX-512 & ARM64 NEON), hardware telemetry, and bit-for-bit mathematical output parity.
Cross-platform Ahead-of-Time compilation verified across Linux x86_64 (Intel Xeon / AMD EPYC) and ARM64 (Apple Silicon M-Series / AWS Graviton). Measured against reference CPython 3.14.
| Rank | Workload / GitHub Origin | Domain Pattern | CPython 3.14 | PyNative AOT | Speedup | Exact Bit Parity |
|---|---|---|---|---|---|---|
| #1 |
Multi-Head Attention nanoGPT
|
FlashAttention Tile Kernel | 21.84 ms | 0.54 ms |
40.44x
|
✓ 100% exact |
| #2 |
SQL Tokenizer & Parser sqlglot
|
SQL AST Parsing & Keyword Lexing | 827.30 ms | 22.87 ms |
36.18x
|
✓ 100% exact |
| #3 |
Micro-ATen MatMul PyTorch
|
Tensor Matrix Multiplication & ReLU | 373.43 ms | 12.40 ms |
30.12x
|
✓ 100% exact |
| #4 |
K-Means Lloyd & Conv2D scikit-learn
|
Iterative Clustering & Image Filters | 799.35 ms | 28.50 ms |
28.05x
|
✓ 100% exact |
| #5 |
Series Rolling & GroupBy pandas
|
Columnar Aggregation & Windowing | 171.39 ms | 7.80 ms |
21.97x
|
✓ 100% exact |
| #6 |
Autograd MLP Loop micrograd
|
Backpropagation Graph Evaluation | 177.40 ms | 9.20 ms |
19.28x
|
✓ 100% exact |
| #7 |
Radix Router Trie fastapi
|
Routing Table Lookup (166k routes) | 145.00 ms | 8.40 ms |
17.26x
|
✓ 100% exact |
| #8 |
RFC-6455 Frame Masking websockets
|
Byte Stream XOR Masking & Framing | 45.09 ms | 3.80 ms |
11.87x
|
✓ 100% exact |
| #9 |
SHA-256 & ChaCha20 cryptography
|
Cryptographic Hash & Stream Cipher | 447.30 ms | 41.00 ms |
10.91x
|
✓ 100% exact |
| #10 |
Log Engine Regex Enterprise
|
High-Throughput Log Line Extraction | 45.20 ms | 4.80 ms |
9.42x
|
✓ 100% exact |
| #11 |
Gaussian Blur & Sobel Pillow
|
2D Convolution Filter on Pixels | 142.60 ms | 15.20 ms |
9.38x
|
✓ 100% exact |
| #12 |
HTTP/1.1 State Machine h11
|
Event-Based Protocol Parsing | 47.08 ms | 5.20 ms |
9.05x
|
✓ 100% exact |
| #13 |
Radix-2 FFT Butterfly scipy
|
Fast Fourier Transform (Complex64) | 249.60 ms | 28.40 ms |
8.79x
|
✓ 100% exact |
| #14 |
Raw TCP Checksum scapy
|
Network Packet Verification | 40.00 ms | 4.60 ms |
8.70x
|
✓ 100% exact |
| #15 |
Black-Scholes Monte Carlo QuantLib
|
Quantitative Options Valuation | 49.60 ms | 5.80 ms |
8.55x
|
✓ 100% exact |
| #16 |
RESP3 Protocol Parser redis-py
|
Redis Wire Protocol Serialization | 33.93 ms | 4.10 ms |
8.28x
|
✓ 100% exact |
| #17 |
Recursive Fibonacci TheAlgorithms
|
Exponential Tree Recursion (N=40) | 7.474 s | 1.082 s |
7.20x
|
✓ 100% exact |
| #18 |
Schema Validation pydantic
|
Data Type Coercion & Validation | 31.54 ms | 4.80 ms |
6.57x
|
✓ 100% exact |
| #19 |
Symbolic Differentiation sympy
|
Polynomial Expression Simplification | 31.34 ms | 5.10 ms |
6.15x
|
✓ 100% exact |
| #20 |
LLaMA-2 SwiGLU / RoPE llama2.c
|
Rotary Embedding & Fused Feed-Forward | 3,147 tok/s | 18,450 tok/s |
5.86x
|
✓ 100% exact |
| #21 |
Terminal Layout Table rich
|
Box Drawing & Terminal ANSI Styling | 40.32 ms | 7.20 ms |
5.60x
|
✓ 100% exact |
| #22 |
JSON Lexer & Parser simplejson
|
Zero-Allocation String Scanning | 104.00 ms | 19.50 ms |
5.33x
|
✓ 100% exact |
| #23 |
YAML Indentation Scanner PyYAML
|
Whitespace & Token Lexing | 47.33 ms | 8.90 ms |
5.32x
|
✓ 100% exact |
| #24 |
LALR(1) Shift-Reduce Parser lark
|
Grammar Rule Engine | 44.73 ms | 8.60 ms |
5.20x
|
✓ 100% exact |
| #25 |
Markdown Lexer & HTML mistune
|
CommonMark Tag Generation | 33.20 ms | 6.40 ms |
5.19x
|
✓ 100% exact |
| #26 |
LZ77 Sliding Matcher brotli
|
Huffman Bitstream Compression | 25.80 ms | 5.10 ms |
5.06x
|
✓ 100% exact |
| #27 |
Prime Sieve of Eratosthenes TheAlgorithms
|
Bitset Sieve (N=100,000) | 0.188 s | 0.038 s |
4.95x
|
✓ 100% exact |
| #28 |
Dijkstra Shortest Path networkx
|
Graph Adjacency Traversal | 23.60 ms | 4.80 ms |
4.92x
|
✓ 100% exact |
PyNative does not rely on heuristics. Every memory layout, pointer tag bitmask, and
compiler lowering step is certified by mathematical theorems proved UNSAT across all 264
bitvector states.