Skip to content

The AI lab at the frontier of speed

Efficient intelligence.

Performance-critical software often runs far slower than its hardware allows. Flash One develops AI methods to close that gap, and to verify that the optimized software remains correct.

  1. 01LLM inference optimization

    Speed and cost per generated token

  2. 02Token usage optimization

    The same quality from fewer tokens

  3. 03Low-latency software

    Where microseconds carry value

Method

Every computation has a floor: the least work its result requires. We study how far software runs above it, and how to close the distance while keeping the result correct.

Measure

Every project begins with measurement, before anything is changed: hardware counters for cycles and memory traffic, and traces of where the tokens are spent.

Optimize

We develop AI methods that search for faster ways to perform the same computation: in how data is laid out and moved, how work is batched and scheduled, and which instructions the hardware is asked to execute.

Verify

Verification is part of the method, not a final step. Every optimized version is checked against the original before it is adopted, and a speedup counts only if the result remains correct.

Research

Three areas, one method.

One discipline, applied to three kinds of cost: running a model, the tokens it consumes, and the microseconds a system takes to respond.

01

LLM inference optimization

Current focus

Token-by-token decoding is typically bound by memory rather than arithmetic: every step moves the model’s weights and cached state through the memory hierarchy, and that traffic largely sets the speed and cost of each token.

  • Memory-bound decoding
  • Key-value cache movement
  • Batching and scheduling
  • Kernels tuned to the hardware
02

Token usage optimization

Every token an AI system reads or writes is paid for, whether or not it improves the result. We study how context is assembled, cached, compressed and routed across models, so that the same quality costs fewer tokens.

  • Context assembly
  • Caching and compression
  • Routing across models
03

Low-latency software

First result: the matching engine

In systems where microseconds carry economic value, the bottleneck is often not the computation but how data moves through memory: cache misses and pointer chasing.

  • Data movement
  • Memory-bound computation
  • Order matching

Products

From research to licensed technology.

First result

Matching engine

A patented architecture for matching orders against an exchange’s order book: a different algorithm, not a faster implementation, derived from finite-field algebra, optimization theory and category theory. We license it to exchanges as IP rather than sell it as a product.

103.4M
order messages per second on one CPU core
~95M
more per second than any publicly available implementation
160
independent engines in the consensus it matches byte for byte
050100FIELD CEILING8.19≈ 95 M/sFLASH ONE103.4
Worst-case throughput on one CPU core, in million order messages per second, drawn to scale. Each point is one of the 159 conforming publicly available engines in the audit.

In research

AI-inference optimization

Our research and products going forward apply the same optimize-and-verify method to AI inference: making large language models, and the systems built on them, faster and cheaper to run.

Contact

Work with us.

We welcome correspondence on research collaboration, licensing and evaluation.