Open Issues Need Help
View All on GitHubA Proof-of-Useful-Work consensus where the "work" is verifiable matrix multiplication: exact INT8 arithmetic for bit-reproducible results, plus a cheap probabilistic audit that certifies a product without recomputing it.
A Proof-of-Useful-Work consensus where the "work" is verifiable matrix multiplication: exact INT8 arithmetic for bit-reproducible results, plus a cheap probabilistic audit that certifies a product without recomputing it.
A Proof-of-Useful-Work consensus where the "work" is verifiable matrix multiplication: exact INT8 arithmetic for bit-reproducible results, plus a cheap probabilistic audit that certifies a product without recomputing it.
A Proof-of-Useful-Work consensus where the "work" is verifiable matrix multiplication: exact INT8 arithmetic for bit-reproducible results, plus a cheap probabilistic audit that certifies a product without recomputing it.