How DECOR++ can eradicate selfish mining incentive by design

A year ago I proposed the DECOR protocol, a new rule for cryptocurrencies to reduce significantly the amount of orphan blocks and then allow block rate to be as high as one every 5 seconds, and at the same time it promised to address the problem of selfish mining. After one year, I’ve received very […]

Leave a comment

Simulated Brains, Smart-contracts and the direction of time

There are three fantastic discoveries in computer science that fascinate me: fully-homomorphic encryption , Indistinguishability Obfuscation, and  sz-Snarks. Using these constructions, it’s possible to create an obfuscated program and allow others to execute the program in a way that the when the program produces an output, people cannot learn anything about its inner workings. The […]


1 Comment

Faster SHA-256 ASICs using carry reduced adders

The core part of Bitcoin mining is performing a double SHA-256 hash digest and comparing the result against the target. Two years ago, in 2013, the first Bitcoin ASIC miners appeared on the market. Since then, mining ASIC technology advanced both in terms of the manufacturing technology (the node) and in terms of design, to […]

, , ,

Leave a comment

Proof of unique blockchain storage

One of the key elements to measure the health of a blockchain based cryptocurrency is the number of nodes actually storing the blockchain. The blockchain grows normally according to the number of payments per second. But as a cryptocurrency becomes popular, the number of payments per second increases, and the blockchain growth rate also increases. […]


The Bitcoin Freeze on Transaction Attack (FRONT)

Two month passed since my last post and the reason is I’ve been terribly busy working for Coinspect and also helping with Bitcoin Core security. A rainy Sunday evening is a great moment to write, so here is my new post, with some new thoughts. People are trying to understand the security guarantees Bitcoin provides. […]

, ,


Blockpad: Improved Proof-of-work function with descentralization incentives

A few posts ago I presented BlockPow, an example of a proof of work function that practically reduces the incentives for users to join mining pools. The shorter the block interval, the best it works. Let’s first summarize the idea behind BlockPow:  if a miner tries to join a pool, then he incur in overhead […]

, , ,

Leave a comment

Preventing Geographical Centralization of Cryptocurrency Mining with the LIMIO protocol

There has been much discussion recently about how to prevent mining pools. There are theoretical and practical approaches. Nevertheless preventing mining pools is not the same as preventing geographical centralization. Mining pools incentives are: Reduce payoff variance. Reduce resource usage. Normally Bitcoin node would require more resources (memory,disk, bandwidth) than a pooled miner. Reduce exposition to […]

, , , ,

Leave a comment


Get every new post delivered to your Inbox.

Join 53 other followers