Describe a chip. Get Verilog that is tested, measured and checked.

NVIDIA Nemotron writes every line. Locked tests decide what passes, and a formal check throws out any smaller version that differs from v1.

Built on NVIDIA Nemotron and Nebius Token Factory

The Verity bench: a chat with a RISC-V CPU request on the left and the CPU board with every block marked Passed on the right

Writing Verilog was never the hard part. Knowing it is right is.

Outside sources, not Verity runs.

Ask for a CPU. Watch it build one.

  1. 01

    You ask

    Verity splits the CPU into seven blocks. Nothing runs until you press Confirm.

  2. 02

    It builds and checks

    Nemotron writes the blocks in parallel, and each one runs against locked tests it cannot edit. Then Nemotron writes the core that joins them.

  3. 03

    Then you upgrade it

    With fast memory, a 2-stage pipeline runs the benchmarks in 0.32x the time of CPU v1.

Real CPU jobs, Nebius, 2026-10-28.

Four checks the agent cannot change.

  • Locked tests

    Written from a golden model before any Verilog exists. The agent cannot edit them.

  • Planted bugs

    We plant bugs on purpose and count how many the tests catch.

  • Measured

    Yosys and OpenSTA measure area and clock, always against our own v1.

  • Proven

    Yosys EQY proves a smaller version still does what v1 does.

A RISC-V CPU, built from seven blocks.

  • 7 of 7

    blocks passed

  • 18 of 18

    RV32I programs

  • 44 of 44

    riscv-formal checks, CPU v1

  • 0.32x

    pipelined benchmark time, fast memory

Real CPU jobs, Nebius, 2026-10-28, against our own CPU v1. The ALU's smaller version was not proven, so the core uses its v1. Three jobs cost $1.66.

RISC-V today. Your chip next.

  1. Built

    • 4 block families
    • RV32I CPU
    • 2-stage pipeline
    • 16-word cache
  2. Next

    • Custom small blocks
    • RV32IM
    • RV32IMC
    • FP8 multiplier
    • int8 requantize
    • FIFO
    • Arbiter
    • CRC-32
    • SECDED
  3. Later

    • Bring your own CPU as v1
    • Assertions and coverage
    • Layout
    • FPGA

The method stays the same as chips grow: blocks, locked golden models, proofs. A new block ships only after its golden model exists.

The whole story in under 3 minutes