Skip to content

AI Verification Grand Challenge

In two stages: several weeks online, then in-person finals in Singapore for the top teams.

Registration open

Sign up for the AI Verification Grand Challenge

Your answers help us match teams and plan resources.

The city and country you’ll take part from.

Are you joining as part of a team or on your own? *

Required if you’re joining with an existing team. It is the name shown on the leaderboard. Solo participants can enter their own name or leave it blank.

Are you the team lead (primary contact) for your team? (optional)

Required if you’re joining with an existing team.

Which challenge tracks are you planning to work on? *

Select all that apply. You can change your mind during the challenge.

What are your strongest relevant skill areas? *

Select all that apply.

Required if you chose Other above.

How would you describe your experience in this technical area? *

Your job title or what you study, and where (e.g. “PhD student, cryptography at ETH Zurich” or “GPU engineer at Nvidia”).

Where are you in your career? *
What are your main goals for joining this challenge? *

Pick up to 3.

One sentence.

Required if you chose Other above.

Code of conduct *

See our Code of Conduct and Privacy Policy.

Overview

AI is getting more powerful very quickly, and some of the risks could be catastrophic. Companies are racing each other, so none of them can easily slow down alone.

One way out is for the US and China to agree to pace how fast the most advanced AI systems are built. The hard part is trust. Each side needs proof that the other is keeping its word, without handing over its secrets.

AI verification is the technology that makes that proof possible. It means tools that can check what an AI data center is actually doing, so a deal can be enforced without anyone giving up their intellectual property.

Right now, those tools don’t exist in a form both sides would trust. That makes this a technical problem more than a diplomatic one. Until it’s solved, an international agreement on AI can’t really be enforced.

How it works

  • Sign up: Registration is open. Stage dates and full details are coming soon.
  • Online stage: Teams of up to five tackle five focused verification problems and are scored on live leaderboards.
  • Finals in Singapore: The top teams from the online stage meet in person in Singapore, alongside verification researchers.

Program overview

  • Duration: Online stage, then finals in person
  • Locations: Remote · Singapore
  • Format: Two challenge stages · Online → In person
  • Support: Compute · APIs · Community · In-person networking + travel · Prizes

Why join

  • Win prizes. Top performers earn cash prizes, and the finalists’ work is recognized publicly.
  • Shape the field, not just a leaderboard. Your findings go straight into the research. They inform future challenge cycles and become the foundation for the Grand Challenges that follow.
  • Follow a clear path from newcomer to contributor. Start online with access to the community. Climb the public leaderboard and become a finalist. Then meet people in person in Singapore.
  • Get recognized for what you build. Both the online and in-person stages end with an awards ceremony and a publicly visible leaderboard. You leave with concrete, verifiable wins for your portfolio.
  • Meet the people working on this. The in-person finals put you in the same room as verification experts and other top researchers.

Pick a track and try to break it.

Team slots will be filled on a rolling basis.

Focus areas

Please note, tracks are subject to change and will be confirmed ahead of challenge launch.

Adversarial Workload ClassificationDisguise an AI training run as ordinary inference to fool a monitor that watches GPU activity.
Verified Inference Beyond Dense ModelsTry to fool a cryptographic check into thinking an unapproved AI model is actually an approved one.
Fake an Evaluation AttestationPose as a dishonest model provider and forge the signed record that a safety evaluation ran on a model inside a secure hardware enclave.
Hide Compute from a Proof-of-Work CheckSneak an unapproved workload onto GPUs while still passing a verifier that checks only the approved work is running.
Sabotage an Inspector AgentAct as a facility operator and fool an AI inspector with doctored evidence.

Who should join

Security researchers and red-teamers, cryptographers, ML and GPU engineers, hardware and confidential-computing specialists, and AI agent builders, plus strong students and early-career researchers from any of these fields.

You don’t need an AI safety background. If you like breaking systems or proving they can’t be broken, there’s a challenge for you. The challenges span a wide range of difficulty and specialisms, so there’s an entry point whether you’re new to the field or a specialist.

Teams of up to five are encouraged, so bring complementary skills.

Tip: The best teams will mix one or two people who know the technical area with someone who thinks like an attacker.

Useful skill sets

  • GPU performance engineering and ML infrastructure (CUDA, profiling, distributed training, LLM inference serving)
  • Adversarial ML, including evading classifiers and monitors
  • Applied cryptography (zero-knowledge proofs, verifiable computation, proof systems)
  • Mixture-of-experts and other non-dense model architectures
  • Confidential computing and hardware security (trusted execution environments, remote attestation, firmware)
  • Offensive security, red-teaming and CTF experience, including cloud security
  • LLM agent building and LLM red-teaming (prompt injection, jailbreaks, agent tooling)
  • Theoretical computer science or blockchain protocol research

Resources

Verification Strategy

These links give a high-level overview of the requirements for a mutually-verified AI agreement and will be useful context to then dig into technical research in any of the 5 tracks. We would recommend starting with the post from The Option Space and digging into the remaining links to see how the specific research areas the 5 challenges focus on fit into the larger picture.

Track 1: Adversarial Workload Classification

Rahman & Tajdari’s work is what this track is based on and is essential for understanding the types of evasion strategies that can be employed against the workload classifier. Reading the additional sources will also help with designing adversarial attacks beyond L3.

Core Readings:

Additional Resources:

Track 2: Forge an Inference Proof

Levels L1, L2, and L3 are a statistics problem (how far can M' drift from M while staying under VerInf's surprisal threshold T); L4 is a soundness problem (find a bug in an exact proof). Read VerInf's flaw log and the Hollow-LLM and zkml-audit papers first to get an understanding of the system being used.

Core:

Additional Resources:

  • Netzer Epstein et al., zkml-audit-benchmark. Read to learn the bug patterns most common in ZK-ML code, a starting checklist for auditing the L4 prover. Access requires approval on Hugging Face, so request it early.
  • 0xPARC, zk-bug-tracker. Use as a reference of real ZK bug classes to check the L4 implementation against.
  • Gao, Liang and Guestrin, Model Equality Testing: Which Model Is This API Serving? Read for tools to measure how distinguishable M' is from M, which tells you how much behaviour change you can afford.
  • Karvonen, Reuter, Rinberg et al., DiFR: Inference Verification Despite Nondeterminism. Read to calibrate how small a model change can still be detected, a useful benchmark for your wrapper or M'.
  • Sun, Li and Zhang, zkLLM. Read to understand the standard construction most ZK-LLM provers follow.
  • Jim Miller (Trail of Bits), Frozen Heart. Read for a classic implementation flaw that let attackers forge proofs.
  • Khovratovich, Rothblum and Soukhanov, How to Prove False Statements. Read if you want to attack the proof protocol itself rather than its code.
  • Pearl Polymath Problem 7. Read for a related open problem on breaking proof-of-inference schemes.

Track 3: Fake an Evaluation Attestation

Each level removes one check from the full prototype, so finding effective adversarial strategies will likely require reading the documentation line by line and figuring out where there are gaps to exploit. Read Tinfoil's PROTOCOL.md and RECEIPT.md before anything else to understand how it works. Then, read the GPU confidential-computing security paper for L3, where the gap is the boot-time link between CPU and GPU attestation.

Core:

Additional Resources:

Track 4: Hide Compute from a Proof-of-Work Check

The track asks how much of a chip's capacity a proof of useful work actually accounts for. Read the Pearl whitepaper's list of blocked shortcuts first (L3 removes one of them), then Basu's usefulness gap (which is tested in L2), then the kernel-efficiency material, since a faster kernel than the verifier's reference is itself covert capacity.

Core:

  • Pearl Research Labs, Pearl FP8 whitepaper (code). Read first: you need the hardness assumption and the list of shortcuts the checks block, since L3 removes one of those checks.
  • Abhinaba Basu, The Usefulness Gap in Proof-of-Useful-Work. Read before L2 to see why the counted work need not be useful, which is the opening L2 leaves.
  • Pearl Polymath problems. Read for the problems the Pearl team itself considers open; #1 (security of the noise scheme) and #4 (training through cuPOW) overlap with this track.

Additional Resources:

  • Komargodski and Weinstein, Proofs of Useful Work from Arbitrary Matrix Multiplication. Read if you want to attack the scheme's security argument rather than its implementation.
  • Pearl PR #311. Read to see the FP8 mining implementation, which is not yet merged, and the open review comments on it.
  • Shah, Dao et al., FlashAttention-3. Read to see how far kernel engineering can push GPU utilisation, since capacity the verifier's baseline misses is covert capacity for you.
  • Badash, Boneh, Komargodski and Srivastava, Hawkeye. Read to understand how a verifier can recompute GPU results exactly, which constrains how you could forge tiles.

Track 5: Sabotage an Inspector Agent

A doctored evidence bundle is an indirect prompt injection against an LLM judge that returns one bit, so the most useful prior work is research on prompt injection and on attacking LLM judges. Read the Verifier Challenge write-up first for the 19 rules and the 15 evasions its automated red team found; Tier 2 (L3 and up) then needs forged telemetry that stays physically consistent.

Core:

  • Jason Hausenloy and Jasmine Li, Inspector Agents prototype. Read this first: the code shows exactly which checks the inspector runs.
  • Jeff Wu, Auditing the Singularity. Read for the general idea behind inspector agents, an AI auditor with full access to a tamper-evident audit trail, and what it is supposed to guarantee, so you know which promise your attack breaks.
  • Hausenloy and Li, Verifier Challenge and traces dataset. Read the write-up for the 60-round automated red team, the 15 evasions it found and the 19 rules that resulted. Use the traces to see what real training and serving telemetry look like; their adversarial phases change only the labels, not the telemetry.

Additional Resources:

FAQ

Do I need an AI safety background?

No. What matters is skill in an area the tracks cover, such as security, cryptography, ML infrastructure, hardware or LLM agents.

What is the application process?

Sign up with the form on this page. Candidates can choose their own challenge track. You can also choose to compete in more than one challenge track.

Full challenge rules coming soon.

Other questions?

Email: ai-verification-grand-challenge@apartresearch.com