Fetching the paper…
Reading the bibliography…
Bitcoin, as well as many of its successors, require the whole transaction record to be reliably acquired by all nodes to prevent double-spending.
M. J. Fischer, N. A. Lynch, and M. S. Paterson, “Impossibility of distributed consensus with one faulty process,” J. ACM , vol. 32, no. 2, pp. 374–382, Apr. 1985
1985
Earlier work this paper cites.
G. Bracha, “Asynchronous byzantine agreement protocols,” Information and Computation , vol. 75, no. 2, pp. 130–143, 1987
1987
Earlier work this paper cites.
M. Ben-Or, B. Kelmer, and T. Rabin, “Asynchronous secure computations with optimal resilience,” in Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing . ACM, 1994, pp. 183–192
1994
Earlier work this paper cites.
D. J. Watts and S. H. Strogatz, “Collective dynamics of ‘small-world’networks,” nature , vol. 393, no. 6684, p. 440, 1998
1998
Earlier work this paper cites.
M. Castro and B. Liskov, “Practical byzantine fault tolerance,” in OSDI , vol. 99, 1999, pp. 173–186
1999
Earlier work this paper cites.
S. Gilbert and N. Lynch, “Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services,” SIGACT News , vol. 33, no. 2, pp. 51–59, Jun. 2002
2002
Earlier work this paper cites.
R. Albert and A.-L. Barabási, “Statistical mechanics of complex networks,” Reviews of modern physics , vol. 74, no. 1, p. 47, 2002
2002
Earlier work this paper cites.
M. A. Serrano and M. Boguñá, “Topology of the world trade web,” Phys. Rev. E , vol. 68, p. 015101, Jul 2003
2003
Earlier work this paper cites.
C. Cachin and S. Tessaro, “Asynchronous verifiable information dispersal,” in Reliable Distributed Systems, 2005. SRDS 2005. 24th IEEE Symposium on . IEEE, 2005, pp. 191–201
2005
Earlier work this paper cites.
R. Kotla, L. Alvisi, M. Dahlin, A. Clement, and E. Wong, “Zyzzyva: speculative byzantine fault tolerance,” in ACM SIGOPS Operating Systems Review , vol. 41, no. 6. ACM, 2007, pp. 45–58
2007
Earlier work this paper cites.
K. Soramäki, M. L. Bech, J. Arnold, R. J. Glass, and W. E. Beyeler, “The topology of interbank payment flows,” Physica A: Statistical Mechanics and its Applications , vol. 379, no. 1, pp. 317 – 333, 2007
2007
Earlier work this paper cites.
S. Nakamoto, “Bitcoin: A peer-to-peer electronic cash system,” 2008. [Online]. Available: https://bitcoin.org/bitcoin.pdf
2008
Earlier work this paper cites.
G. Hardin, “The tragedy of the commons,” Journal of Natural Resources Policy Research , vol. 1, no. 3, pp. 243–253, 2009
2009
Earlier work this paper cites.
R. Guerraoui, N. Knežević, V. Quéma, and M. Vukolić, “The next 700 BFT protocols,” in Proceedings of the 5th European conference on Computer systems . ACM, 2010, pp. 363–376
2010
Cited alongside, same era.
S. King and S. Nadal, “PPCoin: Peer-to-peer crypto-currency with proof-of-stake,” 2012. [Online]. Available: https://peercoin.net/assets/paper/peercoin-paper.pdf
2012
Cited alongside, same era.
S. Popov, “The tangle,” 2014. [Online]. Available: https://iota.org/IOTA\_Whitepaper.pdf
2014
Cited alongside, same era.
P. Todd, “Email: [bitcoin-development] tree-chains preliminary summary,” 2014. [Online]. Available: https://www.mail-archive.com/bitcoin-development@lists.sourceforge.net/msg04388.html
2014
Cited alongside, same era.
G. Wood, “Ethereum: A secure decentralised generalised transaction ledger,” Ethereum Project Yellow Paper , vol. 151, 2014. [Online]. Available: http://gavwood.com/paper.pdf
R. Pass and E. Shi, “Hybrid consensus: Efficient consensus in the permissionless model,” IACR Cryptology ePrint Archive , 2016. [Online]. Available: http://eprint.iacr.org/2016/917.pdf
2016
Later among the works it cites.
G. Wood, “Polkadot: Vision for a heterogeneous multi-chain framework,” 2016. [Online]. Available: http://www.the-blockchain.com/docs/Gavin%20Wood%20-%20Polkadot%20-%20%20Vision%20For%20A%20Heterogeneous%20Multi-chain%20Framework.pdf
2016
Later among the works it cites.
A. Churyumov, “Byteball: A decentralized system for storage and transfer of value,” 2016. [Online]. Available: https://byteball.org/Byteball.pdf
2016
Later among the works it cites.
L. Baird, “The swirld hashgraph consensus algorithm: Fair, fast, byzantine fault tolerance,” 2016. [Online]. Available: http://www.swirlds.com/downloads/SWIRLDS-TR-2016-01.pdf
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
J. Kwon, “Tendermint: Consensus without mining,” 2014. [Online]. Available: https://tendermint.com/static/docs/tendermint.pdf
2014
Cited alongside, same era.
J. Garay, A. Kiayias, and N. Leonardos, The Bitcoin Backbone Protocol: Analysis and Applications . Berlin, Heidelberg: Springer Berlin Heidelberg, 2015, pp. 281–310
2015
Cited alongside, same era.
S. D. Lerner, “Rsk: Bitcoin powered smart contracts,” 2015. [Online]. Available: https://uploads.strikinglycdn.com/files/90847694-70f0-4668-ba7f-dd0c6b0b00a1/RootstockWhitePaperv9-Overview.pdf
2015
Cited alongside, same era.
J. Poon and T. Dryja, “The bitcoin lightning network: Scalable off-chain instant payments,” Technical Report (draft) , 2015. [Online]. Available: https://lightning.network/lightning-network-paper.pdf
2015
Cited alongside, same era.
A. Miller, Y. Xia, K. Croman, E. Shi, and D. Song, “The honey badger of BFT protocols,” in Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security . ACM, 2016, pp. 31–42
2016
Cited alongside, same era.
K. Croman, C. Decker, I. Eyal, A. E. Gencer, A. Juels, A. Kosba, A. Miller, P. Saxena, E. Shi, E. G. Sirer et al. , “On scaling decentralized blockchains,” in International Conference on Financial Cryptography and Data Security . Springer, 2016, pp. 106–125
2016
Cited alongside, same era.
I. Eyal, A. E. Gencer, E. G. Sirer, and R. Van Renesse, “Bitcoin-NG: A scalable blockchain protocol,” in 13th USENIX Symposium on Networked Systems Design and Implementation (NSDI 16) . USENIX Association, 2016, pp. 45–59
2016
Cited alongside, same era.
L. Luu, V. Narayanan, C. Zheng, K. Baweja, S. Gilbert, and P. Saxena, “A secure sharding protocol for open blockchains,” in Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security , ser. CCS ’16. New York, NY, USA: ACM, 2016, pp. 17–30
2016
Later among the works it cites.
Y. L. Yonatan Sompolinsky and A. Zohar, “Serialization of proof-of-work events: Confirming transactions via recursive elections,” IACR Cryptology ePrint Archive . [Online]. Available: https://eprint.iacr.org/2016/1159.pdf
2016
Later among the works it cites.
Y. Gilad, R. Hemo, S. Micali, G. Vlachos, and N. Zeldovich, “Algorand: Scaling byzantine agreements for cryptocurrencies,” in Proceedings of the 26th Symposium on Operating Systems Principles . ACM, 2017, pp. 51–68
2017
Later among the works it cites.
A. Kiayias, A. Russell, B. David, and R. Oliynykov, “Ouroboros: A provably secure proof-of-stake blockchain protocol,” in Annual International Cryptology Conference . Springer, 2017, pp. 357–388
2017
Later among the works it cites.
J. Poon and V. Buterin, “Plasma: Scalable autonomous smart contracts,” 2017. [Online]. Available: https://plasma.io/plasma.pdf
2017
Later among the works it cites.
E. Kokoris-Kogias, P. Jovanovic, L. Gasser, N. Gailly, and B. Ford, “Omniledger: A secure, scale-out, decentralized ledger,” IACR Cryptology ePrint Archive . [Online]. Available: https://eprint.iacr.org/2017/406.pdf
2017
Later among the works it cites.
V. Buterin, “On sharding blockchains,” Sharding FAQ , 2017. [Online]. Available: https://github.com/ethereum/wiki/wiki/Sharding-FAQ
2017
Later among the works it cites.