x86-64
Parameters
| Parameter | Value |
|---|---|
| Architecture | Register |
| Field | Goldilocks (p = 2^64 - 2^32 + 1) |
| Field bits | 64 |
| Hash function | Software (Tip5 or Poseidon2) |
| Digest width | Configurable |
| Extension field | None |
| Stack depth | 16 GP registers |
| Output format | Machine code (ELF) |
| Cost model | Wall-clock time (no proof cost) |
| OS | Linux, macOS (via Rosetta or native) |
For testing and local execution. Field arithmetic is modular reduction on native 64-bit integers. No proof generation — the program runs directly. Useful for debugging program logic before deploying to a provable target.
Cost Model (Wall-clock)
No proof cost — direct native execution. Field arithmetic uses software modular reduction on 64-bit integers. Performance depends on CPU clock speed, cache hierarchy, and branch prediction. No metering or gas.