Introduction

What Fairseq is, what it proves, and how temporal ordering proofs fit into your stack.

Fairseq is a Rust SDK for temporal ordering proofs: cryptographic evidence that a set of transactions was sequenced fairly and anchored to verifiable time.

Standard zkVMs prove what was computed. Fairseq proves when ordering occurred.

What you get

  • Prover and verifier primitives for temporal ordering proofs.
  • Hosted and self-hosted workflows for time beacon anchoring.
  • Developer-first integration: aim for time-to-first-proof under 10 minutes.

Who it's for

  • L2 sequencer operators who need to prove fair ordering to users and partners.
  • DEX protocol teams that want provable fairness around matching.
  • DeFi aggregators that need verifiable ordering for best-execution claims.

How it works (high-level)

  1. Capture ingress timestamps for each transaction.
  2. Order the batch deterministically (FIFO by default).
  3. Generate a proof for the ordered batch.
  4. Publish proof metadata for verification.

Core components

  • Prover: generates temporal ordering proofs.
  • Verifier: validates proofs independently.
  • Time beacon: anchors proofs to verifiable time.

Brand promise

Fair by proof, not promise.

Was this page helpful? /
Back to docs