Repository navigation
v0.3.0 — linear algebra, ONNX coverage, and hardened compiles
Linear algebra & scientific computing
linalg.solve(on-ANE pivoted LU) with vector and matrix right-hand sideslinalg.expm(scaling-and-squaring)det/slogdet, rank-kpinv,solve_triangular, matrix norms (fro/1/inf),matrix_powereinsumellipsis support and diagonal extractiondspKaiser/Bartlett/Tukey windows and Welch PSD
ONNX frontend
Large coverage expansion: LSTM/GRU/RNN (unrolled over the static sequence length),
Attention (opset 23) onto the native fused-attention layer, control flow (If / Loop),
Slice with step > 1, GlobalLpPool, Mod, Pad/Cast/Shrink/OneHot, tanh-approximate Gelu,
and roughly thirty more ops.
Compile correctness & robustness
- A differential fuzzer plus workarounds for the Espresso bugs it found
- The matmul fp16 saturation cliff (~fp16_max/2) characterized
opt=2fails closed when a variant's accuracy cannot be computedopt=1keeps the int8 variant when declared input activation ranges prove it safe
LLM inference
- Batched prefill (~45x lower TTFT)
- The 512-token attention context ceiling lifted (M*dh <= 65536)
- Llama-3.1
rope_scaling, multi-token EOS stop set
Tooling
- MLPerf-lite harness (ResNet-50 + LLM decode, real LoadGen)
- Cross-chip roofline suite and numeric-cliff sweeps
- Tiled decode vocab head so tok/s measures on every ANE family
Also
Python 3.14 in CI, AGENTS.md for coding-agent contributors, numeric-cliffs docs.
Full changelog: v0.2.0...v0.3.0