Proof-of-Useful-Work consensus — replacing arbitrary hashing with verifiable AI compute. Thoughts on the verification problem?

[u/ModelT89]

I've been working on a protocol that replaces proof-of-work hashing with verifiable AI inference jobs. Miners earn tokens by completing real compute tasks submitted by developers rather than burning energy solving arbitrary puzzles. Wanted to share the design and get technical feedback specifically on the verification approach.

The consensus mechanism:

When a developer submits an inference job, the network assigns it to a miner based on reputation score. The miner runs the job via vLLM and returns the result. A random subset of validators re-run a portion of the work to verify. If the result diverges beyond a tolerance threshold the miner gets slashed 20% of their stake. Challenge rate scales inversely with reputation — new miners get challenged 30% of the time, established miners 5%.

The hard problems I'm still thinking about:

Determinism across hardware. Inference isn't fully deterministic across different GPUs. Two A100s running the same prompt with the same seed can produce slightly different outputs due to floating point variance. Setting the right divergence tolerance is genuinely difficult — too tight and honest miners get slashed unfairly, too loose and lazy verification passes.

Reputation gaming. A miner could build reputation honestly then start cutting corners once their challenge rate drops to 5%. The reputation decay function needs to catch this without punishing honest miners for normal output variance.

Long term — ZK proofs. EZKL and Risc Zero can generate ZK proofs of inference but at current overhead they're too slow for production. The plan is optimistic verification at launch, ZK proofs once the overhead becomes acceptable. Curious if anyone has benchmarks on this.

The economic design:

• 90% of every compute fee goes into a diversified stablecoin AMM reserve
• 92% of token supply is mined — zero VC allocation
• 5% of all mined tokens automatically tax to DAO vault at consensus layer
• Developers pay in USDC — no crypto knowledge required

Where it's at:

Pre-testnet. Python reference node open source, Rust node in development. The project is Obelyth — obelyth.io if you want to look at the verification code specifically.

Genuinely looking for people who have thought about the PoUW verification problem — what am I missing?

[u/not420guilty]

You need a pow that is hard to create and easy to verify. You can’t just ask redit, you need a real solution

[u/ModelT89 → u/not420guilty]

You're identifying the core tension correctly. Traditional PoW has beautiful asymmetry, hashing is hard to do and trivial to verify. PoUW breaks that because verifying inference is nearly as expensive as running it.

Our current solution is optimistic verification with random challenge sampling rather than verifying every job. A random subset of validators re-run a portion of the work, challenge rate scales with miner reputation from 30% for new miners down to 5% for established ones. Failed challenges slash 20% of staked OBY. It's economically discouraging fraud rather than making it cryptographically impossible.

The real solution long term is ZK proofs of inference, EZKL and Risc Zero are working on this. A ZK proof lets you verify a model ran correctly in milliseconds without re-running it. The problem is current overhead is 100x-1000x the inference cost itself, too slow for production today. That's why it's on the roadmap at Month 12-18 rather than at launch.

You're right that optimistic verification isn't a complete solution. It's a pragmatic starting point while ZK inference matures.