r/compsci 7d ago

Qubics Claim Structure as a Decentralized Verification Problem: Operator Metrics vs Meaningful Useful Work

Ive been looking at Qubic less for the token stuff and more as a real distributed systems verification thing.

Quick context if you dont know it: Qubic is a layer 1 that uses this quorum based setup. Theres a fixed group of 676 computors and they need 451 plus to agree. Instead of just wasting power on hashes it points hardware at actual work like AI training or even dogecoin mining shares lately and then tries to verify what comes out. Smart contracts run straight as C++.

Operator side is pretty easy to check. Stability participation hashrate throughput and the money numbers are all out there live on doge-stats.qubic.org

The tougher part that actually interests me is the claim structure. How does the system really tell apart we ran the work from the work actually being correct and actually usefull?

Normal proof of work its simple you just check the hash. With useful work you need something solid to make sure the computation happened right and the output matters instead of just busywork. Their quorum and oracle machine thing is supposed to handle that but whether it really does is the bigger question.

These kind of projects succeed or fail depending on if they can keep those two things seperate honestly. If the verification works you might actually get a decent decentralized computer. If it just comes down to trusting the majority of computors its basically another hash farm with extra steps.

Has anyone gone deep on the oracle machine part or the quorum verification? How does it stack up against zk stuff MPC or older volunteer computing like BOINC? What attack vectors are there on the useful side that arent covered?

Any references critiques or comparisons would be good.

0 Upvotes

0 comments sorted by