Timothy Tzen Vun Yap, Ting Fong Ho, Hu Ng, Vik Tor Goh
<ns3:p> <ns3:bold>Background:</ns3:bold> This research uses exploratory graph analysis to analyze the transaction data of the Ethereum network. This is achieved through network visualization and mathematical and statistical modelling of the network data. </ns3:p> <ns3:p> <ns3:bold>Methods:</ns3:bold> The dataset used in this study was extracted from the Ethereum in the BigQuery public dataset, specifically selected transactions in July 2019. The transactions were firstly modelled as network graphs and then visualized using the Kamada-Kawai and force-directed graphs layouts. Further modelling was explored with classical random graph and network block, with emphasis on network cohesion, hierarchical clustering and community membership. </ns3:p> <ns3:p> <ns3:bold>Results:</ns3:bold> Looking at the network visualization and hierarchical clustering of the data, the network shows 170 clusters, the largest having 135 members. Through random graph modelling the optimum number of clusters is shown to be 95. Referring to the generated dendrograms, notable large transactions center around the DRINK token, the Maximine Exchange, the Upbit2 Exchange and the IDEX Exchange, identified through public disclosure of their Ethereum addresses. The network graphs tend to go towards the DRINK smart contract and the Maximine Exchange, indicating deposit actions, while it is the opposite for the IDEX Exchange. Further analysis also shows a different number of communities than the expected number. Falling short of the expected 170 clusters, the model is not able to capture additional mechanism that may be present at the density and social interaction distribution level of the network. On the other hand, network block modelling shows only four major clusters out of the 170 expected clusters, an indication that the model is not able to capture the network sufficiently. </ns3:p> <ns3:p> <ns3:bold>Conclusions:</ns3:bold> The study was able to capture and model the interconnectedness of the system with its notion of elements, in this case, the transactions on the network. </ns3:p>
Blockchain is a digital technology built on three pillars: decentralization, transparency and immutability. Bitcoin and Ethereum are two prevalent Blockchain platforms, where the participants are globally connected in a peer-to-peer manner and anonymously perform trade electronically. The vast number of decentralized transactions and the pseudo-anonymity of participants open the door for scams, cyber frauds, hacks, money laundering and fraudulent transactions. It is challenging to detect such fraudulent activities using traditional auditing techniques, since they need more processing power, time and memory for complex queries to join combinations of tables. This paper proposes several algorithms to extract the transaction- related features from the Bitcoin and Ethereum networks and to represent the features as graphs. Moreover, the paper discusses how visualisation of graphs can reflect the anomalies and patterns of fraudulent activities.
In this paper, the cross-correlations of cryptocurrency returns are analysed. The paper examines one years worth of data for 146 cryptocurrencies from the period January 1 2019 to December 31 2019. The cross-correlations of these returns are firstly analysed by comparing eigenvalues and eigenvector components of the cross-correlation matrix C with Random Matrix Theory (RMT) assumptions. Results show that C deviates from these assumptions indicating that C contains genuine information about the correlations between the different cryptocurrencies. From here, Louvain community detection method is applied as a clustering mechanism and 15 community groupings are detected. Finally, PCA is completed on the standardised returns of each of these clusters to create a portfolio of cryptocurrencies for investment. This method selects a portfolio which contains a number of high value coins when compared back against their market ranking in the same year. In the interest of assessing continuity of the initial results, the method is also applied to a smaller dataset of the top 50 cryptocurrencies across three time periods of T = 125 days, which produces similar results. The results obtained in this paper show that these methods could be useful for constructing a portfolio of optimally performing cryptocurrencies.
Aug 19, 2021·2021 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech)
Shiv Sondhi, Sherif Saad, Kevin Shi, Mohammad Abdullah Al Mamun · 5 authors
A critical component of any blockchain or distributed ledger technology (DLT) platform is the consensus algorithm. Blockchain consensus algorithms are the primary vehicle for the nodes within a blockchain network to reach an agreement. In recent years, many blockchain consensus algorithms have been proposed mainly for private and permissioned blockchain networks. However, the performance of these algorithms and their reliability in hostile environments or the presence of byzantine and other network failures are not well understood. In addition, the testing and validation of blockchain applications come with many technical challenges. In this paper, we apply chaos engineering and testing to understand the performance of consensus algorithms in the presence of different loads, byzantine failure and other communication failure scenarios. We apply chaos engineering to evaluate the performance of three different consensus algorithms (PBFT, Clique, Raft) and their respective blockchain platforms. We measure the blockchain network's throughput, latency, and success rate while executing chaos and load tests. We develop lightweight blockchain applications to execute our test in a semi-production environment. Our results show that using chaos engineering helps understand how different consensus algorithms perform in a hostile or unreliable environment and the limitations of blockchain platforms. Our work demonstrates the benefits of using chaos engineering in testing complex distributed systems such as blockchain networks.
Blockchain analysis is essential for understanding how cryptocurrencies like Bitcoin are used in practice, and address clustering is a cornerstone of blockchain analysis. However, current techniques rely on heuristics that have not been rigorously evaluated or optimized. In this paper, we tackle several challenges of change address identification and clustering. First, we build a ground truth set of transactions with known change from the Bitcoin blockchain that can be used to validate the efficacy of individual change address detection heuristics. Equipped with this data set, we develop new techniques to predict change outputs with low false positive rates. After applying our prediction model to the Bitcoin blockchain, we analyze the resulting clustering and develop ways to detect and prevent cluster collapse. Finally, we assess the impact our enhanced clustering has on two exemplary applications.
Jan A. Fischer, Andres Palechor, Daniele Dell’Aglio, Abraham Bernstein · 5 authors
Bitcoin is built on a blockchain, an immutable decentralised ledger that allows entities (users) to exchange Bitcoins in a pseudonymous manner. Bitcoins are associated with alpha-numeric addresses and are transferred via transactions. Each transaction is composed of a set of input addresses (associated with unspent outputs received from previous transactions) and a set of output addresses (to which Bitcoins are transferred). Despite Bitcoin was designed with anonymity in mind, different heuristic approaches exist to detect which addresses in a specific transaction belong to the same entity. By applying these heuristics, we build an Address Correspondence Network: in this representation, addresses are nodes are connected with edges if at least one heuristic detects them as belonging to the same entity. %addresses are nodes and edges are drawn between addresses detected as belonging to the same entity by at least one heuristic. %nodes represent addresses and edges model the likelihood that two nodes belong to the same entity %In this network, connected components represent sets of addresses controlled by the same entity. In this paper, we analyse for the first time the Address Correspondence Network and show it is characterised by a complex topology, signalled by a broad, skewed degree distribution and a power-law component size distribution. Using a large-scale dataset of addresses for which the controlling entities are known, we show that a combination of external data coupled with standard community detection algorithms can reliably identify entities. The complex nature of the Address Correspondence Network reveals that usage patterns of individual entities create statistical regularities; and that these regularities can be leveraged to more accurately identify entities and gain a deeper understanding of the Bitcoin economy as a whole.
Jan A. Fischer, Andres Palechor, Daniele Dell’Aglio, Abraham Bernstein · 5 authors
Bitcoin is built on a blockchain, an immutable decentralised ledger that\nallows entities (users) to exchange Bitcoins in a pseudonymous manner. Bitcoins\nare associated with alpha-numeric addresses and are transferred via\ntransactions. Each transaction is composed of a set of input addresses\n(associated with unspent outputs received from previous transactions) and a set\nof output addresses (to which Bitcoins are transferred). Despite Bitcoin was\ndesigned with anonymity in mind, different heuristic approaches exist to detect\nwhich addresses in a specific transaction belong to the same entity. By\napplying these heuristics, we build an Address Correspondence Network: in this\nrepresentation, addresses are nodes are connected with edges if at least one\nheuristic detects them as belonging to the same entity. %addresses are nodes\nand edges are drawn between addresses detected as belonging to the same entity\nby at least one heuristic. %nodes represent addresses and edges model the\nlikelihood that two nodes belong to the same entity %In this network, connected\ncomponents represent sets of addresses controlled by the same entity. In this\npaper, we analyse for the first time the Address Correspondence Network and\nshow it is characterised by a complex topology, signalled by a broad, skewed\ndegree distribution and a power-law component size distribution. Using a\nlarge-scale dataset of addresses for which the controlling entities are known,\nwe show that a combination of external data coupled with standard community\ndetection algorithms can reliably identify entities. The complex nature of the\nAddress Correspondence Network reveals that usage patterns of individual\nentities create statistical regularities; and that these regularities can be\nleveraged to more accurately identify entities and gain a deeper understanding\nof the Bitcoin economy as a whole.\n
Natkamon Tovanich, Nicolas Soulié, Nicolas Heulot, Petra Isenberg
We demonstrate an interactive visualization tool to analyze Bitcoin mining pools. The tool allows analysts to see the evolution of mining pools distribution over time and relationships with external variables, i.e., Bitcoin statistics and news headlines. Moreover, we also display information about pool hopping among mining pools to help understand the internal dynamics of miners.
In this paper, we conduct a complex-network analysis of the Bitcoin network. In particular, we design a new sampling method namely random walk with flying-back (RWFB) to conduct effective data sampling. We then conduct a comprehensive analysis of the Bitcoin network in terms of the degree distribution, clustering coefficient, the shortest path length, the assortativity, and the rich-club coefficient. There are several important observations from the Bitcoin network, such as small- world phenomenon and non-rich-club effect. This work brings up an in-depth understanding of the current Bitcoin blockchain network and offers implications for future directions in malicious activity and fraud detection in cryptocurrency blockchain networks.
Xi He, Ketai He, Shenwen Lin, Jinglin Yang · 5 authors
Abstract Single heuristic method and incomplete heuristic conditions were difficult to cluster a large number of addresses comprehensively and accurately. Therefore, this paper analysed the associations between Bitcoin transactions and addresses and used six heuristic conditions to cluster addresses and entities. We proposed an improved change address detection algorithm and compared it with the original change address algorithm to prove the effectiveness of the improved algorithm. By adding conditional constraints, the identified change address was more accurate, and the convergence speed of the algorithm was accelerated. Our work presented the pseudo‐anonymity mechanism of the Bitcoin system, which could be used by the law enforcement agencies to track and crack down illegal transactions.
Lin Zhao, Sourav Sen Gupta, Arijit Khan, Robby Luo
With over 42 billion USD market capitalization (October 2020), Ethereum is the largest public blockchain that supports smart contracts. Recent works have modeled transactions, tokens, and other interactions in the Ethereum blockchain as static graphs to provide new observations and insights by conducting relevant graph analysis. Surprisingly, there is much less study on the evolution and temporal properties of these networks. In this paper, we investigate the evolutionary nature of Ethereum interaction networks from a temporal graphs perspective. We study the growth rate and model of four Ethereum blockchain networks, active lifespan and update rate of high-degree vertices. We detect anomalies based on temporal changes in global network properties, and forecast the survival of network communities in succeeding months leveraging on the relevant graph features and machine learning models.
Christoph Kinkeldey, Jean‐Daniel Fekete, Tanja Blascheck, Petra Isenberg
We present BitConduite, a visual analytics approach for explorative analysis of financial activity within the Bitcoin network, offering a view on transactions aggregated by entities, i.e., by individuals, companies, or other groups actively using Bitcoin. BitConduite makes Bitcoin data accessible to nontechnical experts through a guided workflow around entities analyzed according to several activity metrics. Analyses can be conducted at different scales, from large groups of entities down to single entities. BitConduite also enables analysts to cluster entities to identify groups of similar activities as well as to explore characteristics and temporal patterns of transactions. To assess the value of our approach, we collected feedback from domain experts.
We review probabilistic models known as majority dynamics (also known as threshold Voter Models) and discuss their possible applications for achieving consensus in cryptocurrency systems. In particular, we show that using this approach straightforwardly for practical consensus in Byzantine setting can be problematic and requires extensive further research. We then discuss the FPC consensus protocol which circumvents the problems mentioned above by using external randomness.
Unlike conventional cryptocurrencies, Islamic ones are new technologies backed by tangible assets and are characterised by their fundamental values. After the COVID-19 outbreak, cryptocurrency responses have shown different behaviour to stock market reactions. However, there is a lack of studies on the efficiency of Islamic and green cryptocurrencies during the pandemic. This paper attempts to analyse the behaviour of three typical families of cryptocurrencies (conventional, Islamic, and green) extracted according to their availability in daily frequencies during COVID-19. For this purpose, their efficiency levels are studied before and after the outbreak by employing multifractal detrended fluctuation analysis (MFDFA) to make the best predictions and strategies. The inefficiency of the cryptocurrencies is assessed through a magnitude of long-memory (MLM) efficiency index, and the impact of COVID-19 on their efficiency is evaluated. The primary results show that HelloGold was the most efficient market before the COVID-19 outbreak and that subsequently Ethereum has been the most efficient. In addition, the findings reveal that the cryptocurrency reactions are not similar and show more resilience in the Ethereum and Litecoin markets than in other cryptocurrency markets. The main contribution of this study is the evaluation of the impact of COVID-19 on the various classes of crypto money. This work has practical implications, as it provides new insights into trading opportunities and market reactions. Moreover, he work has theoretical implications based on its evaluation of three distinct models from different doctrine viewpoints.
Cüneyt Gürcan Akçora, Yulia R. Gel, Murat Kantarcıoğlu
Abstract Blockchain is an emerging technology that has enabled many applications, from cryptocurrencies to digital asset management and supply chains. Due to this surge of popularity, analyzing the data stored on blockchains poses a new critical challenge in data science. To assist data scientists in various analytic tasks for a blockchain, in this tutorial, we provide a systematic and comprehensive overview of the fundamental elements of blockchain network models. We discuss how we can abstract blockchain data as various types of networks and further use such associated network abstractions to reap important insights on blockchains' structure, organization, and functionality. This article is categorized under: Technologies > Data Preprocessing Application Areas > Business and Industry Fundamental Concepts of Data and Knowledge > Data Concepts Fundamental Concepts of Data and Knowledge > Knowledge Representation
Cüneyt Gürcan Akçora, Murat Kantarcıoğlu, Yulia R. Gel
Blockchain is an emerging technology that has enabled many applications, from\ncryptocurrencies to digital asset management and supply chains. Due to this\nsurge of popularity, analyzing the data stored on blockchains poses a new\ncritical challenge in data science.\n To assist data scientists in various analytic tasks on a blockchain, in this\ntutorial, we provide a systematic and comprehensive overview of the fundamental\nelements of blockchain network models. We discuss how we can abstract\nblockchain data as various types of networks and further use such associated\nnetwork abstractions to reap important insights on blockchains' structure,\norganization, and functionality.\n
CryptoKitties was the first widely recognized blockchain game. Players could own, breed, and trade kitties, which are the only prop in the game. The game gained explosive growth upon its release but quickly collapsed in a short time. This study analyzes its entire player activity history for the first time in literature and tries to find the reasons for the rise and fall of this first blockchain game mania. First, we extracted the five million transaction records among 100 thousand addresses involved in CryptoKitties in the past three years. Based on the numbers of addresses involved in the game each day, we divide the game progress into four stages: the primer, the rise, the fall, and the serenity. We construct a temporal kitty ownership transfer network and analyze the varying network parameters in the four stages. We find that a large number of players poured in during the 10th and 18th days since the game release and quickly exited in the following month. Since then, a few big players have gradually dominated the game, concentrating the game resources. Through further analysis, we find that the main reason for the rapid increase in the game popularity was the increase of public attention by media outlets, while the reasons for the rapid decline in the game popularity include the oversupply of kitties, the decreasing of player income, a widening gap between the rich and poor players, and the limitations of blockchain systems. Based on these observations, we advise on the further blockchain game design: (1) to finely control the production of props and avoid an oversupply, (2) to balance the gaming cost and revenue and protect the enjoyment of players, (3) to narrow down the gap between rich and poor and create an equal gaming community, (4) to consider the limitations of blockchain systems in their game designs.
Dániel Kondor, Nikola Bulatovic, József Stéger, István Csabai · 5 authors
Bitcoin and Ethereum transactions present some of the largest real-world complex networks that are publicly available for study, including a detailed picture of their time evolution. As such, they have received a considerable amount of attention from the network science community along with analyses from economic and cryptographic perspectives. Among these studies, in an analysis on the early instance of the Bitcoin network, we have shown the clear presence of the preferential attachment, or the “rich-get-richer” phenomenon. Now, we revisit this question, using a recent version of the Bitcoin network that has grown almost 100-fold since our original analysis. Furthermore, we additionally carry out a comparison with Ethereum, the second most important cryptocurrency. Our results show that preferential attachment continues to be a key factor in the evolution of both the Bitcoin and Ethereum transactoin networks. To facilitate further analysis, we publish a recent version of both transaction networks, and an efficient software implementation that is able to evaluate linking statistics necessary for learn about preferential attachment on networks with several hundred million edges.
Dániel Kondor, Nikola Bulatović, József Stéger, István Csabai · 5 authors
Bitcoin and Ethereum transactions present one of the largest real-world\ncomplex networks that are publicly available for study, including a detailed\npicture of their time evolution. As such, they have received a considerable\namount of attention from the network science community, beside analysis from an\neconomic or cryptography perspective. Among these studies, in an analysis on\nthe early instance of the Bitcoin network, we have shown the clear presence of\nthe preferential attachment, or "rich-get-richer" phenomenon. Now, we revisit\nthis question, using a recent version of the Bitcoin network that has grown\nalmost 100-fold since our original analysis. Furthermore, we additionally carry\nout a comparison with Ethereum, the second most important cryptocurrency. Our\nresults show that preferential attachment continues to be a key factor in the\nevolution of both the Bitcoin and Ethereum transactoin networks. To facilitate\nfurther analysis, we publish a recent version of both transaction networks, and\nan efficient software implementation that is able to evaluate linking\nstatistics necessary for learn about preferential attachment on networks with\nseveral hundred million edges.\n
Abstract In this study, we characterized the dynamics and analyzed the degree of synchronization of the time series of daily closing prices and volumes in US$ of three cryptocurrencies, Bitcoin, Ethereum, and Litecoin, over the period September 1,2015–March 31, 2020. Time series were first mapped into a complex network by the horizontal visibility algorithm in order to revel the structure of their temporal characters and dynamics. Then, the synchrony of the time series was investigated to determine the possibility that the cryptocurrencies under study co-bubble simultaneously. Findings reveal similar complex structures for the three virtual currencies in terms of number and internal composition of communities. To the aim of our analysis, such result proves that price and volume dynamics of the cryptocurrencies were characterized by cyclical patterns of similar wavelength and amplitude over the time period considered. Yet, the value of the slope parameter associated with the exponential distributions fitted to the data suggests a higher stability and predictability for Bitcoin and Litecoin than for Ethereum. The study of synchrony between the time series investigated displayed a different degree of synchronization between the three cryptocurrencies before and after a collapse event. These results could be of interest for investors who might prefer to switch from one cryptocurrency to another to exploit the potential opportunities of profit generated by the dynamics of price and volumes in the market of virtual currencies.
Alex Auvolat, Yérom-David Bromberg, Davide Frey, François Taı̈ani
Recent works have proposed new Byzantine consensus algorithms for blockchains based on epidemics, a design which enables highly scalable performance at a low cost. These methods however critically depend on a secure random peer sampling service: a service that provides a stream of random network nodes where no attacking entity can become over-represented. To ensure this security property, current epidemic platforms use a Proof-of-Stake system to select peer samples. However such a system limits the openness of the system as only nodes with significant stake can participate in the consensus, leading to an oligopoly situation. Moreover, this design introduces a complex interdependency between the consensus algorithm and the cryptocurrency built upon it. In this paper, we propose a radically different security design for the peer sampling service, based on the distribution of IP addresses to prevent Sybil attacks. We propose a new algorithm, $\scriptstyle{BASALT}$, that implements our design using a stubborn chaotic search to counter attackers' attempts at becoming over-represented. We show in theory and using Monte Carlo simulations that $\scriptstyle{BASALT}$ provides samples which are extremely close to the optimal distribution even in adversarial scenarios such as tentative Eclipse attacks. Live experiments on a production cryptocurrency platform confirm that the samples obtained using $\scriptstyle{BASALT}$ are equitably distributed amongst nodes, allowing for a system which is both open and where no single entity can gain excessive power.
Some Internet of Things (IoT) platforms use blockchain to transport data. The value proposition of IoT is the connection to the Internet of a myriad of devices that provide and exchange data to improve people’s lives and add value to industries. The blockchain technology transfers data and value in an immutable and decentralised fashion. Security, composed of both non-intentional and intentional risk management, is a fundamental design requirement for both IoT and blockchain. We study how blockchain answers some of the IoT security requirements with a focus on intentional risk. The review of a sample of security incidents impacting public blockchains confirm that identity and access management (IAM) is a key security requirement to build resilience against intentional risk. This fact is also applicable to IoT solutions built on a blockchain. We compare the two IoT platforms based on public permissionless distributed ledgers with the highest market capitalisation: IOTA, run on an alternative to a blockchain, which is a directed acyclic graph (DAG); and IoTeX, its contender, built on a blockchain. Our objective is to discover how we can create IAM resilience against intentional risk in these IoT platforms. For that, we turn to complex network theory: a tool to describe and compare systems with many participants. We conclude that IoTeX and possibly IOTA transaction networks are scale-free. As both platforms are vulnerable to attacks, they require resilience against intentional risk. In the case of IoTeX, DIoTA provides a resilient IAM solution. Furthermore, we suggest that resilience against intentional risk requires an IAM concept that transcends a single blockchain. Only with the interplay of edge and global ledgers can we obtain data integrity in a multi-vendor and multi-purpose IoT network.
Nicolò Vallarano, Matteo Bruno, Emiliano Marchese, Giuseppe Di Trapani · 8 authors
Exponential Random Graph Models (ERGMs) have gained increasing popularity over the years. Rooted into statistical physics, the ERGMs framework has been successfully employed for reconstructing networks, detecting statistically significant patterns in graphs, counting networked configurations with given properties. From a technical point of view, the ERGMs workflow is defined by two subsequent optimization steps: the first one concerns the maximization of Shannon entropy and leads to identify the functional form of the ensemble probability distribution that is maximally non-committal with respect to the missing information; the second one concerns the maximization of the likelihood function induced by this probability distribution and leads to its numerical determination. This second step translates into the resolution of a system of $O(N)$ non-linear, coupled equations (with $N$ being the total number of nodes of the network under analysis), a problem that is affected by three main issues, i.e. accuracy, speed and scalability. The present paper aims at addressing these problems by comparing the performance of three algorithms (i.e. Newton's method, a quasi-Newton method and a recently-proposed fixed-point recipe) in solving several ERGMs, defined by binary and weighted constraints in both a directed and an undirected fashion. While Newton's method performs best for relatively little networks, the fixed-point recipe is to be preferred when large configurations are considered, as it ensures convergence to the solution within seconds for networks with hundreds of thousands of nodes (e.g. the Internet, Bitcoin). We attach to the paper a Python code implementing the three aforementioned algorithms on all the ERGMs considered in the present work.
Smart contract risk can be defined as a financial risk of loss due to cyber attacks on or contagious failures of smart contracts. Its quantification is of paramount importance to technology platform providers as well as companies and individuals when considering the deployment of this new technology. That is why, as our primary contribution, we propose a structural framework of aggregate loss distribution for smart contract risk under the assumption of a tree-stars graph topology representing the network of interactions among smart contracts and their users. Up to our knowledge, there exist no theoretical frameworks or models of an aggregate loss distribution for smart contracts in this setting. To achieve our goal, we contextualize the problem in the probabilistic graph-theoretical framework using bond percolation models. We assume that the smart contract network topology is represented by a random tree graph of finite size, and that each smart contract is the center of a {random} star graph whose leaves represent the users of the smart contract. We allow for heterogeneous loss topology superimposed on this smart contract and user topology and provide analytical results and instructive numerical examples.