An overview of time-lock cryptography, the process of encrypting data in such a way that it cannot be decrypted for a specified lockout period of time.
Proof of work
A proposal for an alternative proof-of-work system via an adaptation of an existing solution to the Byzantine Generals Problem.
An implicit goal of Bitcoin’s reward structure is to diffuse network influence over a diverse, decentralized population of individual participants. Indeed, Bitcoin’s security claims rely on no single entity wielding a sufficiently large portion of the networks overall computational power. Unfortunately, rather than participating independently, most Bitcoin min- ers join coalitions called mining pools in […]
A proposal for a new type of proof-of-work cryptocurrency based upon a search for prime numbers via Cunningham prime chains and bit-twin prime chains.
A proposal for a proof of space alternate mining algorithm in which a service requrestor must dedicate disk space as opposed to hashing power.
A description of the design of a decentralized ledger akin to Bitcoin with a proof of work scheme utilizing iterations of arbitrary Markov-Chain Monte-Carlo chains, the scheduling of which can be purchased using the currency itself, as a mechanism for sharing computational resources.
We introduce the first graph-theoretic proof-of-work system, based on finding cycles in large random graphs. Such problems are arbitrarily scalable and trivially verifiable. Our implementation uses 1 bit per edge, and up to 1 bit per node. We hypothesize that using significantly less causes superlinear slowdown.
We introduce the first trivially verifiable, scalable, memory-hard and tmto-hard proof-of-work system.