references.bib

@book{goetzmann_origins_2005,
	address = {Oxford, New York},
	title = {The {Origins} of {Value}: {The} {Financial} {Innovations} that {Created} {Modern} {Capital} {Markets}},
	isbn = {978-0-19-517571-4},
	shorttitle = {The {Origins} of {Value}},
	abstract = {The essays in this volume are written by a distinguished and adventurous set of historians and economists who have been willing, in many cases, to step beyond their typical field of inquiry and explore the historical foundations of financial innovation. The essays are motivated by the need to place our current age of finanical revolution in historical perspective. The continuing process of financial innovation, as sophisticated as it may seem to most of the modern world, is in fact built on surprisingly few basic principles: the inter-temporal transfer of value through time, the ability to contract on future outcomes, and the negotiability of claims. This book traces the evolution of these basic principles of finance through 3,000 years of history - to the dawn of writing. The methodology that is used can be thought of as  financial archaeology in the sense that the authors focus on primary survived financial documents to draw their conclusions such as clay tablets, notched sticks, sealed parchment and printed paper. The analysis of original documents is a means for economists to focus on the primary text, to analyze and interpret the object and to move interpretation and understanding of its relationship to modern financial instruments and markets. The result is a collection of interdisciplinary studies of the key innovations in finance from the Old Babylonion loan tablets, to the 1953 London Debt Agreement that span regions in Asia, Africa, North America and Europe.},
	publisher = {Oxford University Press},
	author = {Goetzmann, William N. and Rouwenhorst, K. Geert},
	month = aug,
	year = {2005},
}

@book{riegel_new_1976,
	address = {San Pedro, Calif.},
	title = {The new approach to freedom: together with essays on the separation of money and state},
	isbn = {978-0-9600300-7-1},
	shorttitle = {The new approach to freedom},
	language = {English},
	publisher = {Heather Foundation},
	author = {Riegel, Edwin C and MacCallum, Spencer Heath},
	year = {1976},
	note = {OCLC: 8117045},
}

@misc{ashkenazy_bamboo_nodate,
	title = {Bamboo {Tallies}},
	url = {https://primaltrek.com/bamboo.html},
	urldate = {2022-03-13},
	author = {Ashkenazy, Gary},
}

@article{nakamoto_bitcoin_2008,
	title = {Bitcoin: {A} {Peer}-to-{Peer} {Electronic} {Cash} {System}},
	abstract = {A purely peer-to-peer version of electronic cash would allow online payments to be sent directly from one party to another without going through a financial institution. Digital signatures provide part of the solution, but the main benefits are lost if a trusted third party is still required to prevent double-spending. We propose a solution to the double-spending problem using a peer-to-peer network. The network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof-of-work. The longest chain not only serves as proof of the sequence of events witnessed, but proof that it came from the largest pool of CPU power. As long as a majority of CPU power is controlled by nodes that are not cooperating to attack the network, they'll generate the longest chain and outpace attackers. The network itself requires minimal structure. Messages are broadcast on a best effort basis, and nodes can leave and rejoin the network at will, accepting the longest proof-of-work chain as proof of what happened while they were gone.},
	language = {en},
	author = {Nakamoto, Satoshi},
	year = {2008},
	pages = {11},
}

@misc{dwork_pricing_1992,
	title = {Pricing via processing or combatting junk mail},
	author = {Dwork, C. and Naor, M.},
	year = {1992},
	note = {Pages: 139-147
Publisher: Annual International Cryptography Conference},
}

@incollection{jakobsson_proofs_1999,
	address = {Boston, MA},
	series = {{IFIP} — {The} {International} {Federation} for {Information} {Processing}},
	title = {Proofs of {Work} and {Bread} {Pudding} {Protocols}({Extended} {Abstract})},
	isbn = {978-0-387-35568-9},
	url = {https://doi.org/10.1007/978-0-387-35568-9_18},
	abstract = {We formalize the notion of a proof of work (POW). In many cryptographic protocols, a prover seeks to convince a verifier that she possesses knowledge of a secret or that a certain mathematical relation holds true. By contrast, in a POW, a prover demonstrates to a verifier that she has performed a certain amount of computational work in a specified interval of time. POWs have served as the basis of a number of security protocols in the literature, but have hitherto lacked careful characterization. In this paper, we offer definitions treating the notion of a POW and related concepts.We also introduce the dependent idea of a bread pudding protocol. Bread pudding is a dish that originated with the purpose of reusing bread that has gone stale. In the same spirit, we define a bread pudding protocol to be a POW such that the computational effort invested in the proof may be reused by the verifier to achieve a separate, useful, and verifiably correct computation. As an example of a bread pudding protocol, we show how the MicroMint scheme of Rivest and Shamir can be broken up into a collection of POWs. These POWs can not only serve in their own right as mechanisms for security protocols, but can also be harvested in order to outsource the MicroMint minting operation to a large group of untrusted computational devices.},
	language = {en},
	urldate = {2022-03-14},
	booktitle = {Secure {Information} {Networks}: {Communications} and {Multimedia} {Security} {IFIP} {TC6}/{TC11} {Joint} {Working} {Conference} on {Communications} and {Multimedia} {Security} ({CMS}’99) {September} 20–21, 1999, {Leuven}, {Belgium}},
	publisher = {Springer US},
	author = {Jakobsson, Markus and Juels, Ari},
	editor = {Preneel, Bart},
	year = {1999},
	doi = {10.1007/978-0-387-35568-9_18},
	keywords = {Hash Function, Information Hiding, Memory Resource, Security Protocol, Signature Scheme},
	pages = {258--272},
}


@misc{buterin_limits_2021,
	title = {The {Limits} to {Blockchain} {Scalability}},
	url = {https://vitalik.ca/general/2021/05/23/scaling.html},
	urldate = {2022-03-14},
	author = {Buterin, Vitalik},
	month = may,
	year = {2021},
}

@article{rocket_scalable_2020,
	title = {Scalable and {Probabilistic} {Leaderless} {BFT} {Consensus} through {Metastability}},
	url = {http://arxiv.org/abs/1906.08936},
	abstract = {This paper introduces a family of leaderless Byzantine fault tolerance protocols, built around a metastable mechanism via network subsampling. These protocols provide a strong probabilistic safety guarantee in the presence of Byzantine adversaries while their concurrent and leaderless nature enables them to achieve high throughput and scalability. Unlike blockchains that rely on proof-of-work, they are quiescent and green. Unlike traditional consensus protocols where one or more nodes typically process linear bits in the number of total nodes per decision, no node processes more than logarithmic bits. It does not require accurate knowledge of all participants and exposes new possible tradeoffs and improvements in safety and liveness for building consensus protocols. The paper describes the Snow protocol family, analyzes its guarantees, and describes how it can be used to construct the core of an internet-scale electronic payment system called Avalanche, which is evaluated in a large scale deployment. Experiments demonstrate that the system can achieve high throughput (3400 tps), provide low confirmation latency (1.35 sec), and scale well compared to existing systems that deliver similar functionality. For our implementation and setup, the bottleneck of the system is in transaction verification.},
	urldate = {2022-03-14},
	journal = {arXiv:1906.08936 [cs]},
	author = {Rocket, Team and Yin, Maofan and Sekniqi, Kevin and van Renesse, Robbert and Sirer, Emin Gün},
	month = aug,
	year = {2020},
	note = {arXiv: 1906.08936},
	keywords = {Computer Science - Distributed, Parallel, and Cluster Computing},
}

@phdthesis{othman_automated_2012,
	type = {thesis},
	title = {Automated {Market} {Making}: {Theory} and {Practice}},
	shorttitle = {Automated {Market} {Making}},
	url = {https://kilthub.cmu.edu/articles/thesis/Automated_Market_Making_Theory_and_Practice/6714920/1},
	abstract = {Market makers are unique entities in a market ecosystem. Unlike other participants that have exposure (either speculative or endogenous) to potential future states of the world, market making agents either endeavor to secure a risk-free profit or to facilitate trade that would otherwise not occur. In this thesis we present a principled theoretical framework for market making along with applications of that framework to different contexts. We begin by presenting a synthesis of two concepts—automated market making from the artificial intelligence literature and risk measures from the finance literature—that were developed independently. This synthesis implies that the market making agents we develop in this thesis also correspond to better ways of measuring the riskiness of a portfolio—an important application in quantitative finance. We then present the results of the Gates Hillman Prediction Market (GHPM), a fielded large-scale test of automated market making that successfully predicted the opening date of the new computer science buildings at CMU. Ranging over 365 possible opening days, the market’s large event partition required new advances like a novel span-based elicitation interface. The GHPM uncovered some practical flaws of automated market makers; we investigate how to rectify these failures by describing several classes of market makers that are better at facilitating trade in Internet prediction markets. We then shift our focus to notions of profit, and how a market maker can trade to maximize its own account. We explore applying our work to one of the largest and most heavily-traded markets in the world by recasting market making as an algorithmic options trading strategy. Finally, we investigate optimal market makers for fielding wagers when good priors are known, as in sports betting or insurance.},
	language = {en},
	urldate = {2022-03-17},
	school = {Carnegie Mellon University},
	author = {Othman, Abraham M.},
	month = may,
	year = {2012},
	doi = {10.1184/R1/6714920.v1},
}

@misc{martinelli_non-custodial_2019,
	title = {A non-custodial portfolio manager, liquidity provider, and price sensor},
	url = {https://balancer.fi/whitepaper.pdf},
	author = {Martinelli, Fernando and Mushegian, Nikolai},
	month = sep,
	year = {2019},
}

@misc{zhang_formal_2018,
	title = {Formal {Specification} of {Constant} {Product} (x  * y = k) {Market} {Maker} {Model} and {Implementation}},
	url = {https://github.com/runtimeverification/verified-smart-contracts/blob/uniswap/uniswap/x-y-k.pdf},
	author = {Zhang, Yi and Chen, Xiaohong and Park, Daejun},
	month = oct,
	year = {2018},
}

@misc{szabo_shelling_2002,
	title = {Shelling {Out}: {The} {Origins} of {Money}},
	url = {https://nakamotoinstitute.org/shelling-out/},
	abstract = {The precursors of money, along with language, enabled early modern humans to solve problems of cooperation that other animals cannot – including problems of reciprocal altruism, kin altruism, and the mitigation of aggression. These precursors shared with non-fiat currencies very specific characteristics – they were not merely symbolic or decorative objects.},
	urldate = {2022-03-19},
	author = {Szabo, Nick},
	year = {2002},
}

@article{riegel_non-political_1944,
	title = {A {Non}-{Political} {Money} {System} by {E}.{C}. {Riegel}},
	language = {en},
	author = {Riegel, E C},
	year = {1944},
	pages = {93},
}

@article{benson_quipu_1975,
	title = {The {Quipu}: "{Written}" {Texts} in {Ancient} {Peru}},
	volume = {37},
	issn = {0032-8456},
	shorttitle = {The {Quipu}},
	url = {https://www.jstor.org/stable/26403946},
	doi = {10.2307/26403946},
	number = {1},
	urldate = {2022-03-26},
	journal = {The Princeton University Library Chronicle},
	author = {BENSON, ELIZABETH P.},
	year = {1975},
	note = {Publisher: Princeton University Library},
	pages = {11--23},
}

@book{greco_end_2009,
	title = {The {End} of {Money} and the {Future} of {Civilization}},
	isbn = {978-1-60358-224-7},
	abstract = {Like the proverbial fish who doesn’t know what water is, we swim in an economy built on money that few of us comprehend, and, most definitely, what we don’t know is hurting us. Very few people realize that the nature of money has changed profoundly over the past three centuries, or—as has been clear with the latest global financial crisis—the extent to which it has become a political instrument used to centralize power, concentrate wealth, and subvert popular government. On top of that, the economic growth imperative inherent in the present global monetary system is a main driver of global warming and other environmental crises. The End of Money and the Future of Civilization demystifies the subjects of money, banking, and finance by tracing historical landmarks and important evolutionary shifts that have changed the essential nature of money. Greco’s masterful work lays out the problems and then looks to the future for a next stage in money’s evolution that can liberate us as individuals and communities from the current grip of centralized and politicized money power. Greco provides specific design proposals and exchange-system architectures for local, regional, national, and global financial systems. He offers strategies for their implementation and outlines actions grassroots organizations, businesses, and governments will need to take to achieve success. Ultimately, The End of Money and the Future of Civilization provides the necessary understanding— for entrepreneurs, activists, and civic leaders—to implement approaches toward monetary liberation. These approaches would empower communities, preserve democratic institutions, and begin to build economies that are sustainable, democratic, and insulated from the financial crises that plague the dominant monetary system.},
	language = {en},
	publisher = {Chelsea Green Publishing},
	author = {Greco, Thomas},
	month = jun,
	year = {2009},
	note = {Google-Books-ID: lUdPcDWQv90C},
	keywords = {Business \& Economics / Finance / General, Business \& Economics / Money \& Monetary Policy},
}

@article{decandia_dynamo_2016,
	title = {Dynamo: {Amazon}’s {Highly} {Available} {Key}-value {Store}},
	abstract = {Reliability at massive scale is one of the biggest challenges we face at Amazon.com, one of the largest e-commerce operations in the world; even the slightest outage has significant financial consequences and impacts customer trust. The Amazon.com platform, which provides services for many web sites worldwide, is implemented on top of an infrastructure of tens of thousands of servers and network components located in many datacenters around the world. At this scale, small and large components fail continuously and the way persistent state is managed in the face of these failures drives the reliability and scalability of the software systems.},
	language = {en},
	author = {DeCandia, Giuseppe and Hastorun, Deniz and Jampani, Madan and Kakulapati, Gunavardhan and Pilchin, Alex and Sivasubramanian, Swaminathan and Vosshall, Peter and Vogels, Werner},
	year = {2016},
	pages = {16},
}


@article{fazio_cryptographic_2002,
	title = {Cryptographic {Accumulators}: {Definitions}, {Constructions} and {Applications}},
	abstract = {After their first appearance in the cryptographic community ten years ago, cryptographic accumulators have received a discontinuous attention from the researchers of the field. Although occasionally studied, there has been no systematic effort to organize the knowledge of the subject, abstracting away from the unnecessary details of specific proposals, so as to provide a reliable starting point for further investigation.},
	language = {en},
	author = {Fazio, Nelly and Nicolosi, Antonio},
	year = {2002},
	pages = {23},
}

@incollection{kurosawa_vector_2013,
	address = {Berlin, Heidelberg},
	title = {Vector {Commitments} and {Their} {Applications}},
	volume = {7778},
	isbn = {978-3-642-36361-0 978-3-642-36362-7},
	url = {https://link.springer.com/10.1007/978-3-642-36362-7_5},
	abstract = {We put forward the study of a new primitive that we call Vector Commitment (VC, for short). Informally, VCs allow to commit to an ordered sequence of q values (m1, . . . , mq) in such a way that one can later open the commitment at specific positions (e.g., prove that mi is the i-th committed message). For security, Vector Commitments are required to satisfy a notion that we call position binding which states that an adversary should not be able to open a commitment to two different values at the same position. Moreover, what makes our primitive interesting is that we require VCs to be concise, i.e. the size of the commitment string and of its openings has to be independent of the vector length.},
	language = {en},
	urldate = {2022-03-29},
	booktitle = {Public-{Key} {Cryptography} – {PKC} 2013},
	publisher = {Springer Berlin Heidelberg},
	author = {Catalano, Dario and Fiore, Dario},
	editor = {Kurosawa, Kaoru and Hanaoka, Goichiro},
	year = {2013},
	doi = {10.1007/978-3-642-36362-7_5},
	note = {Series Title: Lecture Notes in Computer Science},
	pages = {55--72},
}


@inproceedings{camenisch_dynamic_2002,
	address = {Berlin, Heidelberg},
	title = {Dynamic {Accumulators} and {Application} to {Efficient} {Revocation} of {Anonymous} {Credentials}},
	isbn = {978-3-540-45708-4},
	doi = {10.1007/3-540-45708-9_5},
	abstract = {We introduce the notion of a dynamic accumulator. An accumulator scheme allows one to hash a large set of inputs into one short value, such that there is a short proof that a given input was incorporated into this value. A dynamic accumulator allows one to dynamically add and delete a value, such that the cost of an add or delete is independent of the number of accumulated values. We provide a construction of a dynamic accumulator and an efficient zero-knowledge proof of knowledge of an accumulated value. We prove their security under the strong RSA assumption. We then show that our construction of dynamic accumulators enables efficient revocation of anonymous credentials, and membership revocation for recent group signature and identity escrow schemes.},
	language = {en},
	booktitle = {Advances in {Cryptology} — {CRYPTO} 2002},
	publisher = {Springer},
	author = {Camenisch, Jan and Lysyanskaya, Anna},
	editor = {Yung, Moti},
	year = {2002},
	pages = {61--76},
}

@inproceedings{li_universal_2007,
	address = {Berlin, Heidelberg},
	title = {Universal {Accumulators} with {Efficient} {Nonmembership} {Proofs}},
	isbn = {978-3-540-72738-5},
	doi = {10.1007/978-3-540-72738-5_17},
	abstract = {Based on the notion of accumulators, we propose a new cryptographic scheme called universal accumulators. This scheme enables one to commit to a set of values using a short accumulator and to efficiently compute a membership witness of any value that has been accumulated. Unlike traditional accumulators, this scheme also enables one to efficiently compute a nonmembership witness of any value that has not been accumulated. We give a construction for universal accumulators and prove its security based on the strong RSA assumption. We further present a construction for dynamic universal accumulators; this construction allows one to dynamically add and delete inputs with constant computational cost. Our construction directly builds upon Camenisch and Lysyanskaya’s dynamic accumulator scheme. Universal accumulators can be seen as an extension to dynamic accumulators with support of nonmembership witness. We also give an efficient zero-knowledge proof protocol for proving that a committed value is not in the accumulator. Our dynamic universal accumulator construction enables efficient membership revocation in an anonymous fashion.},
	language = {en},
	booktitle = {Applied {Cryptography} and {Network} {Security}},
	publisher = {Springer},
	author = {Li, Jiangtao and Li, Ninghui and Xue, Rui},
	editor = {Katz, Jonathan and Yung, Moti},
	year = {2007},
	pages = {253--269},
}

@article{gao_jellyfish_2021,
	title = {Jellyfish {Merkle} {Tree}},
	abstract = {This paper presents Jellyfish Merkle Tree (JMT), a space-and-computation-efficient sparse Merkle tree optimized for Log-Structured Merge-tree (LSM-tree) based key-value storage, which is designed specially for the Diem Blockchain. JMT was inspired by Patricia Merkle Tree (PMT), a sparse Merkle tree structure that powers the widely known Ethereum network. JMT further makes quite a few optimizations in node key, node types and proof format to find the ideal balance between the complexity of data structure, storage, I/O overhead and computation efficiency, to cater to the needs of the Diem Blockchain. JMT has been implemented in Rust, but it is languageindependent such that it could be implemented in other programming languages. Also, the JMT structure presented is of great flexibility in implementation details for fitting various practical use cases.},
	language = {en},
	author = {Gao, Zhenhuan and Hu, Yuxuan and Wu, Qinfan},
	year = {2021},
	pages = {12},
}


@incollection{brumley_efficient_2016,
	address = {Cham},
	title = {Efficient {Sparse} {Merkle} {Trees}},
	volume = {10014},
	isbn = {978-3-319-47559-2 978-3-319-47560-8},
	url = {http://link.springer.com/10.1007/978-3-319-47560-8_13},
	abstract = {A sparse Merkle tree is an authenticated data structure based on a perfect Merkle tree of intractable size. It contains a distinct leaf for every possible output from a cryptographic hash function, and can be simulated efficiently because the tree is sparse (i.e., most leaves are empty). We are the first to provide complete, succinct, and recursive definitions of a sparse Merkle tree and related operations. We show that our definitions enable efficient space-time trade-offs for different caching strategies, and that verifiable audit paths can be generated to prove (non-)membership in practically constant time ({\textless} 4 ms) when using SHA-512/256. This is despite a limited amount of space for the cache—smaller than the size of the underlying data structure being authenticated—and full (concrete) security in the multi-instance setting.},
	language = {en},
	urldate = {2022-03-29},
	booktitle = {Secure {IT} {Systems}},
	publisher = {Springer International Publishing},
	author = {Dahlberg, Rasmus and Pulls, Tobias and Peeters, Roel},
	editor = {Brumley, Billy Bob and Röning, Juha},
	year = {2016},
	doi = {10.1007/978-3-319-47560-8_13},
	note = {Series Title: Lecture Notes in Computer Science},
	pages = {199--215},
}

@article{shapiro_conict-free_2011,
	title = {Conflict-free {Replicated} {Data} {Types}},
	abstract = {Replicating data under Eventual Consistency (EC) allows any replica to accept updates without remote synchronisation. This ensures performance and scalability in largescale distributed systems (e.g., clouds). However, published EC approaches are ad-hoc and error-prone. Under a formal Strong Eventual Consistency (SEC) model, we study sufficient conditions for convergence. A data type that satisfies these conditions is called a Conflictfree Replicated Data Type (CRDT). Replicas of any CRDT are guaranteed to converge in a self-stabilising manner, despite any number of failures. This paper formalises two popular approaches (state- and operation-based) and their relevant sufficient conditions. We study a number of useful CRDTs, such as sets with clean semantics, supporting both add and remove operations, and consider in depth the more complex Graph data type. CRDT types can be composed to develop large-scale distributed applications, and have interesting theoretical properties.},
	language = {en},
	author = {Shapiro, Marc and Preguiça, Nuno and Baquero, Carlos and Zawirski, Marek},
	year = {2011},
	pages = {21},
}

@article{poon_bitcoin_2016,
	title = {The {Bitcoin} {Lightning} {Network}:},
	abstract = {The bitcoin protocol can encompass the global financial transaction volume in all electronic payment systems today, without a single custodial third party holding funds or requiring participants to have anything more than a computer using a broadband connection. A decentralized system is proposed whereby transactions are sent over a network of micropayment channels (a.k.a. payment channels or transaction channels) whose transfer of value occurs off-blockchain. If Bitcoin transactions can be signed with a new sighash type that addresses malleability, these transfers may occur between untrusted parties along the transfer route by contracts which, in the event of uncooperative or hostile participants, are enforceable via broadcast over the bitcoin blockchain in the event of uncooperative or hostile participants, through a series of decrementing timelocks.},
	language = {en},
	author = {Poon, Joseph and Dryja, Thaddeus},
	month = jan,
	year = {2016},
	pages = {59},
}


@article{wang_cyclic_2022,
	title = {Cyclic {Arbitrage} in {Decentralized} {Exchanges}},
	url = {http://arxiv.org/abs/2105.02784},
	abstract = {Decentralized Exchanges (DEXes) enable users to create markets for exchanging any pair of cryptocurrencies. The direct exchange rate of two tokens may not match the crossexchange rate in the market, and such price discrepancies open up arbitrage possibilities with trading through different cryptocurrencies cyclically. In this paper, we conduct a systematic investigation on cyclic arbitrages in DEXes. We propose a theoretical framework for studying cyclic arbitrage. With our framework, we analyze the profitability conditions and optimal trading strategies of cyclic transactions. We further examine exploitable arbitrage opportunities and the market size of cyclic arbitrages with transaction-level data of Uniswap V2. We find that traders have executed 292,606 cyclic arbitrages over eleven months and exploited more than 138 million USD in revenue. However, the revenue of the most profitable unexploited opportunity is persistently higher than 1 ETH (4,000 USD), which indicates that DEX markets may not be efficient enough. By analyzing how traders implement cyclic arbitrages, we find that traders can utilize smart contracts to issue atomic transactions and the atomic implementations could mitigate users’ financial loss in cyclic arbitrage from the price impact.},
	language = {en},
	urldate = {2022-04-25},
	journal = {arXiv:2105.02784 [cs, q-fin]},
	author = {Wang, Ye and Chen, Yan and Wu, Haotian and Zhou, Liyi and Deng, Shuiguang and Wattenhofer, Roger},
	month = jan,
	year = {2022},
	note = {arXiv: 2105.02784},
	keywords = {Computer Science - Computational Engineering, Finance, and Science, Computer Science - Cryptography and Security, Quantitative Finance - Trading and Market Microstructure},
}


@book{beer_designing_1994,
	address = {Chichester, West Sussex, England ; New York},
	series = {The {Stafford} {Beer} classic library},
	title = {Designing freedom},
	isbn = {978-0-471-95165-0 978-0-471-06220-2},
	publisher = {Wiley},
	author = {Beer, Stafford and Beer, Stafford},
	year = {1994},
	keywords = {Cybernetics, Operations research, Social systems},
}

@incollection{goos_kademlia_2002,
	address = {Berlin, Heidelberg},
	title = {Kademlia: {A} {Peer}-to-{Peer} {Information} {System} {Based} on the {XOR} {Metric}},
	volume = {2429},
	isbn = {978-3-540-44179-3 978-3-540-45748-0},
	shorttitle = {Kademlia},
	url = {http://link.springer.com/10.1007/3-540-45748-8_5},
	abstract = {We describe a peer-to-peer system which has provable consistency and performance in a fault-prone environment. Our system routes queries and locates nodes using a novel XOR-based metric topology that simplifies the algorithm and facilitates our proof. The topology has the property that every message exchanged conveys or reinforces useful contact information. The system exploits this information to send parallel, asynchronous query messages that tolerate node failures without imposing timeout delays on users.},
	language = {en},
	urldate = {2022-05-19},
	booktitle = {Peer-to-{Peer} {Systems}},
	publisher = {Springer Berlin Heidelberg},
	author = {Maymounkov, Petar and Mazières, David},
	editor = {Goos, Gerhard and Hartmanis, Juris and van Leeuwen, Jan and Druschel, Peter and Kaashoek, Frans and Rowstron, Antony},
	year = {2002},
	doi = {10.1007/3-540-45748-8_5},
	note = {Series Title: Lecture Notes in Computer Science},
	pages = {53--65},
}

@article{wood_ethereum_2013,
	title = {{ETHEREUM}: {A} {SECURE} {DECENTRALISED} {GENERALISED} {TRANSACTION} {LEDGER}},
	abstract = {The blockchain paradigm when coupled with cryptographically-secured transactions has demonstrated its utility through a number of projects, with Bitcoin being one of the most notable ones. Each such project can be seen as a simple application on a decentralised, but singleton, compute resource. We can call this paradigm a transactional singleton machine with shared-state.},
	language = {en},
	author = {Wood, Dr Gavin},
	year = {2013},
	pages = {41},
}

@article{swann_towards_2018,
	title = {Towards an anarchist cybernetics: {Stafford} {Beer}, self-organisation and radical social movements},
	shorttitle = {Towards an anarchist cybernetics},
	url = {https://repository.lboro.ac.uk/articles/journal_contribution/Towards_an_anarchist_cybernetics_Stafford_Beer_self-organisation_and_radical_social_movements/9469565/1},
	abstract = {In the early 1960s, a number of anarchist writers showed an interest in cybernetics, in which they saw the tools for better articulating radical forms of self-organisation. Discussions on the connections between anarchism and cybernetics did not advance very far, however, and by the 1970s the topic seems to have fallen off the anarchist radar. With an increase in interest in cybernetics over the last few years, this paper picks up where these debates left off and highlights some key points of contact between cybernetics and anarchism that have the potential to advance radical accounts of self-organisation. Based on a theoretical appraisal of the core texts and arguments in the debate around anarchism and cybernetics, the paper shows that the way in which hierarchy is formulated in cybernetic thought has a crucial impact on anarchist theory and practice and aids both academic approaches to social movements and, importantly, anarchist and radical left praxis. In addition, it provides a response to the critique of cybernetics in critical management studies that stands as a barrier to taking cybernetics seriously as a contribution to radical understandings of organisation.},
	language = {en},
	urldate = {2022-05-30},
	author = {Swann, Thomas},
	month = jan,
	year = {2018},
	note = {Publisher: Loughborough University},
}