plishman/Proof-of-work---hashing-for-documents--experimental-

This experimental program implements a simple proof of work algorithm for documents. It adds an intelligible string to any document which, when hashed with the document, yields a value of zero when the resulting hash number is divided by a user-selected modulo. The higher the modulo, the longer it takes to find the matching hash value.

JavaScriptGPL-3.0