I have read the
@boundlesshq
white paper. Here is proof: We describe the following contributions: Proof of
Verifiable Work, a fraud and spam-resistant mecha-
nism for measuring the complexity, and therefore rel-
ative cost, of a zero knowledge proof which Bound-
less uses