Major blockchain projects, such as Bitcoin and Ethereum, enable secure global transfers of tokens between untrusted parties. The resulting global financial infrastructure however incurs latency and costs that are prohibitive for many economics applications that are local to a region or a community. Local economics relies on trust and reputation through repeated interactions within a community of participants that know each other, which has not previously been leveraged for the design of crypto-tokens. In this paper, we formulate the design of new local crypto-tokens as a research problem: we present concrete application examples, we identify double-spending detection as a weaker and sufficient alternative to double-spending prevention in local applications, and we formulate desired properties of new local crypto-tokens designs. Based on our analysis, we envision local crypto-tokens to complement existing blockchain projects by facilitating intra-community economics at much lower latency and costs, while evolutions of current blockchain projects will provide global inter-community exchanges of high-value transactions.
{"title":"Local crypto-tokens for local economics","authors":"Erick Lavoie, C. Tschudin","doi":"10.1145/3565383.3566113","DOIUrl":"https://doi.org/10.1145/3565383.3566113","url":null,"abstract":"Major blockchain projects, such as Bitcoin and Ethereum, enable secure global transfers of tokens between untrusted parties. The resulting global financial infrastructure however incurs latency and costs that are prohibitive for many economics applications that are local to a region or a community. Local economics relies on trust and reputation through repeated interactions within a community of participants that know each other, which has not previously been leveraged for the design of crypto-tokens. In this paper, we formulate the design of new local crypto-tokens as a research problem: we present concrete application examples, we identify double-spending detection as a weaker and sufficient alternative to double-spending prevention in local applications, and we formulate desired properties of new local crypto-tokens designs. Based on our analysis, we envision local crypto-tokens to complement existing blockchain projects by facilitating intra-community economics at much lower latency and costs, while evolutions of current blockchain projects will provide global inter-community exchanges of high-value transactions.","PeriodicalId":197460,"journal":{"name":"Proceedings of the 3rd International Workshop on Distributed Infrastructure for the Common Good","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125194895","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Decentralised Autonomous Organisations (DAOs) have the capability of being a disruptive Web3 technology. Their usage of cryptographically secure distributed ledgers shows promise of replacing existing technical and financial intermediaries. However, this promise has not been fully materialised yet: existing attempts typically rely on centralisation as the required decentralised components do not exist or are not mature enough. We present our Web3 Deployment Experiment around a robust decentralised economy to address these issues. Our economy is unique due to the removal of all centralised components and governance. It is resilient against legal and economic attacks as no individual or organisation can compromise its functioning. We dub this characteristic extreme decentralisation. Similar to BitTorrent and Bitcoin, our extreme decentralisation DAOs carefully avoid single points of failure and are effectively unstoppable. Within our experiment around a music economy, we bypass all intermediaries in finance, technology, and the music industry itself with a direct donation to musicians. We demonstrate the viability of collective decision-making within our decentralised economy and present a set of principles for Web3 DAOs. Our implementation shows that the DAO ecosystem is fully deployable on smartphones, allowing anyone to create a DAO without reliance on central authorities or components.
{"title":"Unstoppable DAOs for web3 disruption","authors":"Rowdy Chotkan, Jérémie Decouchant, J. Pouwelse","doi":"10.1145/3565383.3566112","DOIUrl":"https://doi.org/10.1145/3565383.3566112","url":null,"abstract":"Decentralised Autonomous Organisations (DAOs) have the capability of being a disruptive Web3 technology. Their usage of cryptographically secure distributed ledgers shows promise of replacing existing technical and financial intermediaries. However, this promise has not been fully materialised yet: existing attempts typically rely on centralisation as the required decentralised components do not exist or are not mature enough. We present our Web3 Deployment Experiment around a robust decentralised economy to address these issues. Our economy is unique due to the removal of all centralised components and governance. It is resilient against legal and economic attacks as no individual or organisation can compromise its functioning. We dub this characteristic extreme decentralisation. Similar to BitTorrent and Bitcoin, our extreme decentralisation DAOs carefully avoid single points of failure and are effectively unstoppable. Within our experiment around a music economy, we bypass all intermediaries in finance, technology, and the music industry itself with a direct donation to musicians. We demonstrate the viability of collective decision-making within our decentralised economy and present a set of principles for Web3 DAOs. Our implementation shows that the DAO ecosystem is fully deployable on smartphones, allowing anyone to create a DAO without reliance on central authorities or components.","PeriodicalId":197460,"journal":{"name":"Proceedings of the 3rd International Workshop on Distributed Infrastructure for the Common Good","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129707737","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Decentralized, peer-to-peer systems using Conflict-free Replicated Data Types (CRDTs) can offer a more privacy-friendly alternative to centralized solutions that are often used by Big Tech. However, traditional CRDTs assume that all replicas are trusted, which is not necessarily the case in a peer-to-peer system. This paper presents a protocol for secure state-based CRDTs which provide fine-grained confidentiality and integrity by using encryption per field in every (sub)-document. Our protocol guarantees Strong Eventual Consistency despite any Byzantine replicas. It provides a fine-grained, dynamic membership and key management system, without violating Strong Eventual Consistency or losing concurrent updates. Our evaluation shows that the protocol is suitable for use in interactive, collaborative applications.
{"title":"Secure replication for client-centric data stores","authors":"Kristof Jannes, B. Lagaisse, W. Joosen","doi":"10.1145/3565383.3566111","DOIUrl":"https://doi.org/10.1145/3565383.3566111","url":null,"abstract":"Decentralized, peer-to-peer systems using Conflict-free Replicated Data Types (CRDTs) can offer a more privacy-friendly alternative to centralized solutions that are often used by Big Tech. However, traditional CRDTs assume that all replicas are trusted, which is not necessarily the case in a peer-to-peer system. This paper presents a protocol for secure state-based CRDTs which provide fine-grained confidentiality and integrity by using encryption per field in every (sub)-document. Our protocol guarantees Strong Eventual Consistency despite any Byzantine replicas. It provides a fine-grained, dynamic membership and key management system, without violating Strong Eventual Consistency or losing concurrent updates. Our evaluation shows that the protocol is suitable for use in interactive, collaborative applications.","PeriodicalId":197460,"journal":{"name":"Proceedings of the 3rd International Workshop on Distributed Infrastructure for the Common Good","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122129118","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Web3 is progressively decentralising Internet services with the introduction of the blockchain, from social networks to online trading. Filecoin is a Web3 storage marketplace implemented on top of the Interplanetary File System that aims at decentralising storage by rewarding users who pledge storage to the system. Clients form deals with storage miners, who store deals on the Filecoin blockchain for transparency and auditability. Storage miners can also obtain extra rewards when they mine a block. In this paper, we show that although Filecoin aims at complete decentralisation, the rewarding system acts as the opposite. We download a dataset composed of 47.5M messages and expose that most of the blocks are created by the same storage miners, who are also the ones that pledge more storage. An analysis of their identity shows that they belong to cloud companies, that have a lot of extra storage resources. The effect observed is due to the fact that storage miners are able to commit all extra storage to the system, even when there are no deals in them. Additionally, this effect is further intensified by recent updates to Filecoin, which let storage miners update committed storage to deal-containing storage effortlessly.
{"title":"Evaluating the decentralisation of filecoin","authors":"Barbara Guidi, Andrea Michienzi, L. Ricci","doi":"10.1145/3565383.3566108","DOIUrl":"https://doi.org/10.1145/3565383.3566108","url":null,"abstract":"Web3 is progressively decentralising Internet services with the introduction of the blockchain, from social networks to online trading. Filecoin is a Web3 storage marketplace implemented on top of the Interplanetary File System that aims at decentralising storage by rewarding users who pledge storage to the system. Clients form deals with storage miners, who store deals on the Filecoin blockchain for transparency and auditability. Storage miners can also obtain extra rewards when they mine a block. In this paper, we show that although Filecoin aims at complete decentralisation, the rewarding system acts as the opposite. We download a dataset composed of 47.5M messages and expose that most of the blocks are created by the same storage miners, who are also the ones that pledge more storage. An analysis of their identity shows that they belong to cloud companies, that have a lot of extra storage resources. The effect observed is due to the fact that storage miners are able to commit all extra storage to the system, even when there are no deals in them. Additionally, this effect is further intensified by recent updates to Filecoin, which let storage miners update committed storage to deal-containing storage effortlessly.","PeriodicalId":197460,"journal":{"name":"Proceedings of the 3rd International Workshop on Distributed Infrastructure for the Common Good","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122777583","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A rollup is a type of popular "layer two" scaling solution for slow-but-secure blockchains like Ethereum. A rollup perfoms computation of blockchain state updates off-chain but posts the inputs and the data to the underlying blockchain in order to benefit from its security. However, if rollup operators go offline, further state updates are no longer possible through the rollup; instead, state updates to the layer two state must be forced on the underlying blockchain. Such a mechanism is called an escape hatch as it allows state, and in particular digital assets, to escape from an inoperative rollup. We review the approaches from rollups developed by the community and highlight potential issues. We also establish a wish-list of properties that an escape hatch mechanism should have to be considered trustworthy and compatible with decentralization.
{"title":"Ideal properties of rollup escape hatches","authors":"J. Gorzny, Lin Po-An, Martin Derka","doi":"10.1145/3565383.3566107","DOIUrl":"https://doi.org/10.1145/3565383.3566107","url":null,"abstract":"A rollup is a type of popular \"layer two\" scaling solution for slow-but-secure blockchains like Ethereum. A rollup perfoms computation of blockchain state updates off-chain but posts the inputs and the data to the underlying blockchain in order to benefit from its security. However, if rollup operators go offline, further state updates are no longer possible through the rollup; instead, state updates to the layer two state must be forced on the underlying blockchain. Such a mechanism is called an escape hatch as it allows state, and in particular digital assets, to escape from an inoperative rollup. We review the approaches from rollups developed by the community and highlight potential issues. We also establish a wish-list of properties that an escape hatch mechanism should have to be considered trustworthy and compatible with decentralization.","PeriodicalId":197460,"journal":{"name":"Proceedings of the 3rd International Workshop on Distributed Infrastructure for the Common Good","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117098472","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Christian Berger, Sadok Ben Toumia, Hans P. Reiser
The novel blockchain generation of Byzantine fault-tolerant (BFT) state machine replication (SMR) protocols focuses on scalability and performance to meet the requirements of distributed ledger technology (DLT), e.g., decentralization and geographic dispersion. Validating scalability and performance of BFT protocol implementations requires careful evaluation. While experiments with real protocol deployments usually offer the best realism, they are costly and time-consuming. In this paper, we explore simulation of unmodified BFT protocol implementations as a method for cheap and rapid protocol evaluation: We can accurately forecast the performance of a BFT protocol while experimentally scaling its environment, i.e., by varying the number of nodes or geographic dispersion. Our approach is resource-friendly and preserves application-realism, since existing BFT frameworks can be simply plugged into the simulation engine without requiring code modifications or re-implementation.
{"title":"Does my BFT protocol implementation scale?","authors":"Christian Berger, Sadok Ben Toumia, Hans P. Reiser","doi":"10.1145/3565383.3566109","DOIUrl":"https://doi.org/10.1145/3565383.3566109","url":null,"abstract":"The novel blockchain generation of Byzantine fault-tolerant (BFT) state machine replication (SMR) protocols focuses on scalability and performance to meet the requirements of distributed ledger technology (DLT), e.g., decentralization and geographic dispersion. Validating scalability and performance of BFT protocol implementations requires careful evaluation. While experiments with real protocol deployments usually offer the best realism, they are costly and time-consuming. In this paper, we explore simulation of unmodified BFT protocol implementations as a method for cheap and rapid protocol evaluation: We can accurately forecast the performance of a BFT protocol while experimentally scaling its environment, i.e., by varying the number of nodes or geographic dispersion. Our approach is resource-friendly and preserves application-realism, since existing BFT frameworks can be simply plugged into the simulation engine without requiring code modifications or re-implementation.","PeriodicalId":197460,"journal":{"name":"Proceedings of the 3rd International Workshop on Distributed Infrastructure for the Common Good","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121638140","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Using a single message type, we show how to obtain an efficient convergence protocol for a grow-only set CRDT (Conflict-Free Replicated Data Type) although the communication channel can drop and reorder messages at will. This permits to remove the middleware layer that is usually required in CRDT protocols for providing reliable or ordered message delivery. We use the obtained grow-only set for synchronizing a compression dictionary among peers, without the need of addresses, membership protocols or connections. In this paper we describe our CRDT protocol (which is a variant of a delta-CRDT that does not have to repeatedly send the whole state), how it can be used to bootstrap other convergent data structures and report on first simulations as well as implementations for three different platforms.
{"title":"A connectionless grow-only set CRDT","authors":"C. Tschudin","doi":"10.1145/3565383.3566110","DOIUrl":"https://doi.org/10.1145/3565383.3566110","url":null,"abstract":"Using a single message type, we show how to obtain an efficient convergence protocol for a grow-only set CRDT (Conflict-Free Replicated Data Type) although the communication channel can drop and reorder messages at will. This permits to remove the middleware layer that is usually required in CRDT protocols for providing reliable or ordered message delivery. We use the obtained grow-only set for synchronizing a compression dictionary among peers, without the need of addresses, membership protocols or connections. In this paper we describe our CRDT protocol (which is a variant of a delta-CRDT that does not have to repeatedly send the whole state), how it can be used to bootstrap other convergent data structures and report on first simulations as well as implementations for three different platforms.","PeriodicalId":197460,"journal":{"name":"Proceedings of the 3rd International Workshop on Distributed Infrastructure for the Common Good","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126148809","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We explore issues relating to the storage of digital art, based on an empirical investigation into the storage of audiovisual data referenced by non-fungible tokens (NFTs). We identify current trends in NFT data storage and highlight problems with implemented solutions. We particularly focus our investigation on the use of the Interplanetary Filesystem (IPFS), which emerges as a popular and versatile distributed storage solution for NFTs. Based on the analysis of discovered data storage techniques, we propose a set of best practices to ensure long-term storage survivability of NFT data. While helpful for forming the NFT art market into a legitimate long-term environment for digital art, our recommendations are also directly applicable for improving the availability and integrity of non-NFT digital art.
{"title":"Dude, where's my NFT: distributed infrastructures for digital art","authors":"Leonhard Balduf, Martin Florian, B. Scheuermann","doi":"10.1145/3565383.3566106","DOIUrl":"https://doi.org/10.1145/3565383.3566106","url":null,"abstract":"We explore issues relating to the storage of digital art, based on an empirical investigation into the storage of audiovisual data referenced by non-fungible tokens (NFTs). We identify current trends in NFT data storage and highlight problems with implemented solutions. We particularly focus our investigation on the use of the Interplanetary Filesystem (IPFS), which emerges as a popular and versatile distributed storage solution for NFTs. Based on the analysis of discovered data storage techniques, we propose a set of best practices to ensure long-term storage survivability of NFT data. While helpful for forming the NFT art market into a legitimate long-term environment for digital art, our recommendations are also directly applicable for improving the availability and integrity of non-NFT digital art.","PeriodicalId":197460,"journal":{"name":"Proceedings of the 3rd International Workshop on Distributed Infrastructure for the Common Good","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130375166","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Proceedings of the 3rd International Workshop on Distributed Infrastructure for the Common Good","authors":"","doi":"10.1145/3565383","DOIUrl":"https://doi.org/10.1145/3565383","url":null,"abstract":"","PeriodicalId":197460,"journal":{"name":"Proceedings of the 3rd International Workshop on Distributed Infrastructure for the Common Good","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130803762","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：