name970/Protocol

Fill in real module paths in ARCHITECTURE.md about 10 hours ago

good first issue

0

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.

Rust

#consensus#cryptography#rust#verifiable-computation#zero-knowledge

Implement slice decomposition of an FP32 matrix into bounded INT8 slices about 10 hours ago

good first issue

name970/Protocol

0

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.

Rust

#consensus#cryptography#rust#verifiable-computation#zero-knowledge

Bit-exactness test: INT8-Ozaki product vs f64 reference about 10 hours ago

good first issue

name970/Protocol

0

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.

Rust

#consensus#cryptography#rust#verifiable-computation#zero-knowledge

Explicit domain separation for all SHA-256 call sites about 10 hours ago

good first issue

name970/Protocol

0

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.

Rust

#consensus#cryptography#rust#verifiable-computation#zero-knowledge

Open Issues Need Help