Next Article in Journal
Combining Artificial Intelligence with Physics-Based Methods for Probabilistic Renewable Energy Forecasting
Previous Article in Journal
Reducing Energy Requirements in the Production of Acrylic Acid: Simulation and Design of a Multitubular Reactor Train
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

When Is Blockchain Worth It? A Case Study of Carbon Trading

by
Fangyuan Zhao
* and
Wai Kin (Victor) Chan
*
Tsinghua-Berkeley Shenzhen Institute, Tsinghua University, Shenzhen 518052, China
*
Authors to whom correspondence should be addressed.
Submission received: 5 March 2020 / Revised: 28 March 2020 / Accepted: 9 April 2020 / Published: 16 April 2020
(This article belongs to the Section C: Energy Economics and Policy)

Abstract

:
Blockchain, as an emerging technology and a disruptive innovation, has attracted attention from both academia and industry. However, there are many potential risks associated with it, such as the technical risk, the legal risk and the privacy risk. A comprehensive risk analysis is crucial for cost-effective deployment of blockchain technology. Important adoption decisions, including when to deploy blockchain, how to plan the investment, how to transfer current businesses onto blockchain, and how to price the blockchain service depend on this risk analysis. Yet very little study exists concerning the blockchain adoption planning with risks analysis. This research presents a cost-and-risk analysis framework and an adoption planning method for the case of blockchain application in carbon trading. Design requirements implied by the analysis are inferred and the architecture of a novel hybrid blockchain system is proposed. The system leverages the advantages of blockchain technology and incorporates institutional risk control framework. The optimal adoption strategy of this system is derived through modelling of users’ and the organizer’s behavior.

1. Introduction

The concept of “chained blocks” was firstly proposed for solving the double-spending problem in Bitcoin, after which “blockchain” gradually emerged as a generic term. Blockchain is a distributed ledger technology (DLT) that connects different parties over the internet to provide a reliable record of transactions, without giving control to a third party. A blockchain is essentially a distributed database, with information replicated across many nodes through peer to peer communication and maintained jointly by the collective according to a consensus protocol. Data are encapsulated in “blocks”, which are chronologically ordered and cryptographically chained to form the immutable chain. Blockchain technology offers several desired properties: one point failure issue of centralized systems is eliminated through replication and distribution of data; transparent data shared directly among all nodes restrains data manipulation and monopoly; information on blockchain is temper-proof and traceable; and it is more resistant to technical failures and malicious attacks. In addition to facilitating transactions, blockchain technology evolved to power the smart contract, which is generally considered as the second generation of blockchain applications. Business logic or contract terms are coded in a smart contract, which is stored on a blockchain and executed by nodes when the predefined trigger happens. Therefore, smart contracts on blockchain are automatically executed and enforced, fostering collaboration between untrusted peers without requiring a central agency.
Due to these unprecedented advantages of blockchain technology, many entrepreneurs and governments are rushing into the adoption or promotion of the technology for fear of missing the opportunity or losing the competition. There are, however, various risks associated with the blockchain technology. Indeed, blockchain transforms business models from human-based to algorithm-based models, exposing firms to new risks regarding business continuity, data confidentiality, cyber attacks, technology failures and more (Deloitte, https://www2.deloitte.com/us/en/pages/advisory/articles/blockchain-risk-management.html). Adverse events and unforeseen risks could undermine all the benefits of blockchain. In the short history of blockchain, exchanges and wallets breaches, exploitation of smart contracts bugs and other incidents have occurred numerous times and caused enormous loss and panic. For example, millions of dollars were lost in the Mt. Gox and the DAO hacking events. Blockchain has also been abused by evildoers to commit crimes, such as the initial coin offering (ICO) scam, money laundry and trafficking. Frequent crimes and attacks are serious concerns to governments, and consequent strict regulations in some jurisdictions have hindered the development of blockchain technology. Therefore, it is imperative to analyze risks along with benefits when considering deployment of blockchain technology. Investment in incorporating blockchain technology is not worthwhile until the benefits overpass the risks. Successful integration of blockchain requires a thorough plan for timing, investment, adjustment, pricing and coordination of the legacy and blockchain systems. However, the blockchain adoption strategies based on risk analysis have not been fully developed.
In this paper, we focus on the case of blockchain application in carbon cap-and-trade scheme (CAT), to analyze risks and adoption planning of blockchain technology. In a CAT program, the right to emit greenhouse gases (GHG) is issued in the form of “carbon credits”. These credits are traded between regulated companies for compliance with the emission targets set by the regulator. The carbon market is an ideal testbed for blockchain technology for the following reasons: (1) the potential of blockchain technology for improving the CAT has been recognized and proposed by many researchers and policy makers; (2) carbon credits can be easily digitalized and represented on the network; (3) despite the lack of a physical form, carbon credits are associated with real emissions or emission reductions. If carbon trade is placed on blockchain, speculation and crimes on completely-virtual-blockchain-based assets can be partially avoided, as carbon credits are backed by physical activities.
The paper consists of several parts:
  • First, a comprehensive benefits and risks analysis of blockchain integration in CAT is conducted. The cost-and-risk structures of current CAT and a blockchain-based CAT are compared.
  • To effectively address newly introduced risks, we design an architecture of a novel hybrid blockchain system. It combines features of blockchain technology and approaches of traditional risk management. This designed architecture could be a primary prototype for deploying blockchain into regulated industries, where legal requirements are priority to business processes.
  • Given constructed cost-and-risk structure and designed blockchain architecture, we build a blockchain adoption model. The optimal timing, business shifting, investment, adjustment and pricing strategies are derived through system organizer’s and users’ optimization. The model provides a planning methodology for blockchain adoption.
  • Overall, this paper provides an integrated analysis, design and planning framework for blockchain adoption in the carbon trade and other industries.
This paper is arranged in the following manner: Section 2 reviews the related literature; Section 3 conducts cost and risk analysis of deploying blockchain to CAT; system design considerations and a hybrid blockchain-based CAT system are proposed in Section 4; adoption models of system organizer and users are constructed in Section 5; the optimal adoption trajectory and strategies are derived in Section 6; Section 7 concludes.

2. Related Literature

Most of research on blockchain focus on technical challenges and improvements [1,2,3], cryptocurrencies and related economic and legal issues [4,5,6,7], smart contracts [8,9,10], design of consensus protocols [11,12,13], and application of blockchain in different industries. Recently, there has been a surge of discovery on how blockchain could impact supply chains [14], healthcare [15,16], energy [17,18], payment [19], insurance [20,21], security [22,23,24,25,26], transportation [27], intellectual property [28], privacy protection [29,30], contract management [31,32] and more. Blockchain has also been proposed to be combined with other technologies, such as Internet of Things [33], big data [34], machine learning [35], and artificial intelligence [36]. Blockchain is even believed by technology enthusiasts to be an innovation as disruptive and transformative as the Internet has been [37,38,39,40].
Despite the extensive work exploring the application of blockchain technology to different industries and businesses, there is limited research on risks associated with blockchain deployment and its implications for system design. Studies related to blockchain risks mainly focused on cryptocurrencies [41,42] and technical risks [43,44]. Several articles [45,46,47] discussed implementation and design considerations of blockchain technology, including interoperability, cost, performance, security, confidentiality, operational capacity, regulatory and governance issues. Some researchers [48,49] analyzed blockchain adoption from a macro perspective of technology acceptance and innovation diffusion.
There is limited research on applying blockchain technology to carbon trade and energy certificates markets. Some early work focused on conceptualization and direct deployment of existed blockchain systems in emission trading. In [50], an anonymous Bitcoin-based emission trading system and five functions of it were conceptualized. Based on that work, a decentralized carbon emissions trading infrastructure (D-CEIT) was designed and compared to current carbon trading systems in [51]. SolarCoin was introduced in [52]. It is a blockchain system where solar electricity generation is rewarded with electricity-backed cryptocurrency and traded through the transparent consensus ledger. It is demonstrated that a 99% reduction of electricity usage could be realized through substituting the Proof of Work (PoW) with the Proof of Stake Time (PoST) consensus protocol. Robert Leonhard [53] focused on voluntary personal carbon trading systems and proposed a hypothetical carbon market on blockchain where individuals conducting emission reduction activities are issued with carbon credits by virtual associations comprised of climate scientists. Another conceptual model [54] is a smart contract-based carbon market, where companies voluntarily offset their emissions by funding carbon-offset projects vetted by universities. It identified some issues of blockchain-based carbon markets, including administrative costs, verification costs, legal liability, insider trading, tokens as securities, and cryptocurrency price volatility. The networking of carbon trading systems of different jurisdictions and the institutional framework was studied in [55], in which the “transaction unit” performs as the medium of inter-jurisdictions exchange.
Another direction is on experiments and case studies of blockchain application in carbon trading. In [56], the use of blockchain technology for peer to peer energy-based credits transactions was explored. By conducting an experiment on a microgrid of several solar energy-powered buildings within an eco-district of France, authors concluded that in spite of the distributed nature of blockchain, many real-world scenarios require a permission role, who is in charge of ensuring clear separation of duties and enforcing Chinese walls. The permission role can be managed by a central authority or system operators, consistent with the feature of consortium blockchain. In [57], the immutability and transparency of blockchain were utilized for building a reputation system to address management and fraud issues of the emission trading scheme (ETS). A case study was conducted on Multichain, an open blockchain platform and the proposed system is evaluated against conventional ETS. Some benefits of blockchain were concluded: transparency forces participants to conduct themselves in a responsible and accountable manner; information credibility helps in the monitoring and verification of credits source and ownership then protects the system from fraud and double counting issues; a certain level of privacy can be sustained. Drawbacks include redundant storage and possible resistance of the transition from participants. Two cases of applying blockchain technology to certificates trading were analyzed in [58]. It identified several benefits of introducing blockchain, including lower transaction cost, increased reliability, transparency and security.
Most of these research concerns benefits of blockchain for carbon trading, while studies about constraints and risks are rare, except for [59], which identified the administrative costs, unit quality and information asymmetry, and governance of mitigation commitments as the main constrains of Kyoto Protocol, where blockchain technology can play a role for improvement in Paris Agreement. They proposed some requirements and factors for integration of blockchain technology, including number of users, system throughput, security and privacy. To the best of our knowledge, analysis of potential risks and its implications for design considerations and adoption planning are yet to be fully explored in the area of blockchain application.

3. Cost and Risk Analysis of Blockchain Integration in CAT

In this section, we analyze how blockchain technology could transform the cost and risk structure of CATs. Issues of current CATs and how blockchain could mitigate them are analyzed and summarized in Table 1.
Despite the benefits that blockchain brings to emission trading scheme, myriad risks raise accordingly, especially in the nascent stage of blockchain technology. New risks associated with incorporation of blockchain include:
  • Legal risk
    Blockchain protocols might be inobservant to legislations and regulations; the property right of carbon credits on a blockchain need further legal enforcement; without a central authority, the legal liability of improper and erroneous operation of blockchain remains unclear; there are potentially illicit activities on blockchains, such as money laundering.
  • Technical risk
    Technical challenges, such as large-scale communication, big data storage, and imperfect encryption technologies hinders the performance of blockchain.
  • Protocol risk
    The implementation of arrangements of CAT programs relies on predefined blockchain protocols. All the terms and conditions of the cap-and-trade scheme should be applied and enforced consistently by the protocol. Any error in the protocol may get the system off the track or even against the initial purpose of the program. Carelessly designed protocols also incur problems of scalability, security and data integrity.
  • Cyber risk
    Insufficient encryptions are at risk from hackers; outside oracles-smart devices and production softwares are vulnerable to malicious attacks and malfunctions, resulting in corrupted data fed into the blockchain; the key pairs representing identities on blockchain can be stolen or destroyed.
  • Privacy risk
    If automatic carbon accounting is conducted, commercially sensitive data, such as production and operation data, are stored on blockchain, which impose information leakage risk.
  • Validation risk
    Risk of consortium blockchains can be incurred by wrongly selected malicious validation peers.
  • Market risk
    As a newborn technology, blockchain may be subject to resistance from users. Insufficient transactions on blockchain would harm the market liquidity.
The cost-and-risk structures of current CAT and blockchain-based CAT are summarized in Figure 1. The main costs and risks of a traditional CAT are listed in the second column. The changes of the costs and risks caused by the introduction of blockchain are listed in the third column. Blockchain offers an opportunity to reduce the administration cost of traditional carbon CATs, which is signaled by the small green arrow in Figure 1. Whereas, the transaction cost may be scaled up along with the increase of transactions, due to the scalability limit of blockchain. In Figure 1, the yellow arrow signifies possible higher transaction cost of a blockchain-based CAT, if the scalability issues is not appropriately handled. The larger green arrow in Figure 1 means the listed risks of traditional CAT systems, including the fraud, collusion, cyber attack, inefficacy and carbon leakage risks, can be mitigated by blockchain technology. However, blockchain introduces new risks, including the legal, technical, protocol, cyber, privacy, validation and market risks. The red arrow in Figure 1 means the increase of these risks. In summary, a blockchain-based CAT, compared to a traditional CAT, has lower administration cost, possibly higher transaction cost, lower traditional risks, and higher new risks.

4. Architecture Design for a Hybrid Blockchain System

Considering the transformed risk structure, we propose design requirements of a blockchain-based CAT system, and design the organizational architecture and main functionalities for the system.

4.1. Design Requirements

  • Risk management
    Based on the risk analysis in Section 3, risks of the blockchain-based system should be effectively controlled to guarantee the correct implementation of CATs. In centralized systems, intermediaries typically take on the risks, while on blockchain, risk management relies on predefined protocols. Unfortunately, not all the risks can be predicted and a flawless protocol does not exist. Blockchain technology itself at this stage is not able to handle exceptions. Therefore, a responsible party is needed to manage risks and to serve as the last resort.
  • Blockchain protocol
    The blockchain system essentially provides transaction service to carbon traders. System performance, including throughput, latency and scalability should be acceptable to users. These properties are determined by the consensus protocol to a large extent. Therefore, the protocol should be able to facilitate a large number of transactions with a low latency. In addition, the protocol should be energy-efficient, as the purpose of carbon cap-and-trade schemes is to reduce emissions and to address climate change. Therefore, the proof of work (PoW) protocol used by Bitcoin and many blockchains is not suitable. More efficient protocols, such as practical Byzantine fault tolerance (pBFT) and Ripple protocols are possible options.
  • Identity management
    A trading system should conform to applicable laws and regulations, such as the anti-money laundering (AML) and know-your-customer (KYC) legislation. Besides, credits allocation and compliance verification also require known identities of participants. Hence participants’ identities should be registered on the blockchain system, and kept invisible to other traders, unless the user reveals it on purpose.

4.2. Organizational Architecture

According to the requirements of identity management and risk control in carbon trading, a certain degree of central control, monitoring and safeguarding are necessary for the blockchain-based system. Therefore, a hybrid system combining the features of blockchain technology and institutional risk control would be appropriate. We design the three-tier organizational architecture for the hybrid blockchain system, as shown in Figure 2. With this structure, the immutability and reliability of blockchain technology are retained and risks are under control. There are three roles in this architecture:
  • Organizer: an overriding committee, takes charge of authorization, access control, audit, supervision, disputes settlement, and safeguard, but does not intervene the normal operation of the system. The committee consists of regulators, institutions and other appropriate members. It is an added layer to a typical blockchain for risk management.
  • Validators: verify transactions and maintain the blockchain ledger, providing service to carbon traders. Validators are elected by participants of the carbon CAT program, and can include academic institutions, non-governmental organizations (NGOs) and other professional agencies. They collectively verify data under the witness of all participants. If any validator conducts improper activities, it can be removed from the validation group through the majority vote by participants.
  • Users: carbon traders are system users as well as witnesses of the commitment, compliance, and punishment execution on the system.

4.3. Main Functionalities

Primary functionalities of a blockchain-based carbon trading system include:
  • User registration: The organizer validates identities and authorizes participants. A pair of keys (public key and private key) is assigned to an authorized user for accessing the system.
  • Initial allocation or auction: The organizer node broadcasts the emission cap of each participant, which is then recorded on the blockchain. Each participant can use her private key to decrypt the message and get the cap. The allocated or auctioned carbon credits are transferred from the organizer node to each user node.
  • Registration of certified emission reductions (CERs): Each emission reduction project is registered on the blockchain with a unique ID and all the related information for identification. GPS and satellites could be utilized as oracles for monitoring and inspecting projects. Blockchain provides a traceable and auditable record of emission reduction projects.
  • Transaction: The validation nodes are full nodes on the blockchain, storing complete blockchain ledger. They process and record transactions collectively. User nodes, as light nodes, do not need to store the ledger and can request information from validation nodes.
  • Emission accounting: Automatic emission accounting can be realized through outside oracles, such as IoT devices and production management systems, which connect to and upload emission-related data on blockchain.
  • Commitment enforcement: At the end of each compliance period, user nodes transfer their credits to the organizer node for commitment. Validation nodes examine the amount of committed credits according to the recorded cap, and execute pre-defined punishment.

5. Modelling of Blockchain Adoption in CATs

In this section, we model the adoption of the hybrid blockchain system proposed in Figure 2, from the perspectives of the organizer and of individual users (participating companies). The modelled scenario is as following:
Existing centralized carbon trading system is the legacy system and still operates. The organizer can develop and provide a blockchain-based carbon trading system to individuals. According to the cost-and-risk structures of traditional and blockchain-based CATs in Section 3, the legacy and the blockchain systems have different costs and risks. Each individual can decide the amount of transactions to put on each system. The organizer can impact individuals’ decisions through pricing two systems.

5.1. Individuals’ Model

Intuition: Individual users have carbon management goals and certain transaction demands to meet their goals. Facing two options—the legacy system and the blockchain system, individuals allocate their transactions on two systems. Both systems have registration fees and transactions fees, which are determined by the organizer and are known to individuals. The legacy system has been operated for a long time, so it is stable and predictable. The blockchain system offers potential benefits of lower transaction cost and risk, while it’s a newborn technology and people are not familiar with it. The market risk, particularly liquidity risk of the blockchain system might be high, if users hesitate to migrate onto it. Therefore, there is extra perceived risk of the blockchain system, dominated by the herd effect—individuals feel that the blockchain system is safer and more acceptable if more transactions are put on it.
At each period t during a fixed time horizon [ 1 , T ] , individuals’ model is shown in Figure 3. The model is explained in the following:
  • Conditions: Each individual i has a known transaction demand d i t . Registration and transaction fees of the legacy and blockchain systems, L t r , L t s , P t r and P t s are given by the organizer. The risk of the legacy system, r 1 is stable, including uncertainty due to verification and lack of transparency. The systematic risk of the blockchain system, r 2 ( t ) can be reduced overtime, and is known to individuals. The extra perceived risk of the blockchain system, r p can be mitigated if more transactions are put on it. The resulted perceived risk is measured by r p y t , where y t is the total amount of transactions on the blockchain system.
  • Decisions: An individual i allocates its transactions on the legacy system and the blockchain system with amount of x i t and y i t , respectively.
Table 2 list parameters and variables of individuals’ model.

5.2. Individual Optimization

At each period t during a fixed time horizon [ 1 , T ] , with transaction demand d i t , individual i allocates amount of transactions x i t and y i t , respectively, on the legacy and the blockchain systems. Individual i’s total cost H i t includes registration and transaction fees it needs to pay for two systems. Its total risk R i t includes the risk of the leagcy system x i t 2 r 1 , the systematci risk of the blockchain system y i t 2 r 2 ( t ) , and the perceived risk of the blockchain system y i t r p y t . Individual i’s disutility G i t is the summation of total cost and total risk. The cost function, risk function and disutility function of period t are defined in Equations (1).
H i t ( x i t , y i t ) = L t r 1 { x i t > 0 } + L t s x i t + P t r 1 { y i t > 0 } + P t s y i t R i t ( x i t , y i t ) = x i t 2 r 1 + y i t 2 r 2 ( t ) + y i t r p y t G i t ( x i t , y i t ) = H i ( x i t , y i t ) + R i ( x i t , y i t )
At period t, individual i’s optimization problem is to minimize its total disutility by allocating transactions on the legacy and the blockchain systems. Mathematically, the optimization problem of each individual can be written as:
min x i t , y i t G i t = L t r 1 { x i t > 0 } + L t s x i t + P t r 1 { y i t > 0 } + P t s y i t + x i t 2 r 1 + y i t 2 r 2 ( t ) + y i t r p y t s . t . x i t , y i t 0 x i t + y i t d i t
Proposition 1.
At each period t, there is a Nash Equilibrium of individuals’ behavior, given by ( y 1 t * , . . . , y m t t * ) : y i t * = ( 2 r 1 d i t + L t s P t s ) y t * 2 y t * r p 2 ( r 1 + r 2 ( t ) ) y t * 2 r p . The equilibrium total transaction amount on the blockchain system is y t * = 2 r 1 d t + m t ( L t s P t s ) + [ 2 r 1 d t + m t ( L t s P t s ) ] 2 8 r p ( m t 1 ) ( r 1 + r 2 ( t ) ) 4 ( r 1 + r 2 ( t ) ) . Required conditions for the Nash Equilibrium are: (1) Existence of y t * ; (2) Feasibility of y i t * : 0 < y i t * < d i t ; and (3) Optimality of y i t * : G i t ( y i t * ) < min ( G i t ( 0 ) , G i t ( d i t ) ) .
The derivation of Proposition 1 is shown in Appendix A. The required conditions are expressed explicitly in Equations (A5)–(A7) in Appendix A.
The equilibrium total transaction amount on the blockchain system y t * is resulted from the interactions among traders. However, it stays unaffected by individuals’ decisions, instead, it is determined by the total transaction demand d t , number of traders m t , the risks r 1 , r 2 ( t ) , r p and the transaction fee difference L t s P t s of two systems. More transactions will be put on the blockchain system, with a higher demand, or a higher price advantage of the blockchain system.
Under the equilibrium situation, trader i puts the amount of y i t * = ( 2 r 1 d i t + L t s P t s ) y t * 2 y t * r p 2 ( r 1 + r 2 ( t ) ) y t * 2 r p transactions on the blockchain system. User i would put more transactions on the blockchain system, with a higher demand d i t , the price advantage of the blockchain system L t s P t s , or the total transaction amount on the blockchain y t * . On the contrary, a higher fundamental perceived risk of the blockchain system r p would reduce their preference for the blockchain system.

5.3. Organizer’s Model

Intuition: The legacy system has steady operation cost and risk. The organizer needs to determine the time and investment for developing a blockchain-based carbon trading system. The average operation cost of the blockchain system scales up with the increase of transactions, due to the inherent replication feature and the scalability limit of blockchain technology. Risks of the blockchain system are classified as systematic risk and controllable risk. Controllable risk includes design risk and validation risk. Design risk is raised up by imperfect system configurations, regarding the consensus protocol, cyber security and privacy. Validation risk comes from the validation group of a consortium blockchain. Once the blockchain system is built, the organizer can invest in system update and infrastructure improvement. Updating the system lowers the average operation cost and the design risk. Based on the hybrid architecture designed in Section 4, transactions are processed by a collective of validation nodes. the organizer pays for the setup of the validation group, which impacts the validation risk. Given total transaction demand of all individuals, the organizer optimizes transaction amount on the legacy and the blockchain systems.
An overview of the organizer’s model at period t of the time horizon [ 1 , T ] is shown in Figure 4. The model is explained in the following:
Conditions:
  • The legacy system: c 1 is the average operational cost, including credits registration, transaction processing and clearing, and compliance validation; r 1 is the risk imposed by the fraud, collusion, cyber attack and other issues of the centralized system.
  • The blockchain system: c 2 ( t ) is the fundamental cost that remains unchanged unless exogenous technology breakthrough occur; r 2 ( t ) is the systematic risk, including regulatory and technical risk, which can only be mitigated by exogenous legislation improvement and technology innovation; r 3 is the basic design risk, which can be reduced by sound system design and infrastructure improvement; r 4 is the basic validation risk, which can be reduced by a better validation configuration.
  • Individuals’ demand: d t is the total transaction demand of all individuals. d t = i = 1 m t d i t
Decisions:
  • Organizer decides the investment I t for system update, including blockchain redesign and infrastructure (communication and computation) improvement. The effect of investment accumulates and mitigates the design risk r 3 to r 3 j = 1 t I j .
  • Organizer decides to spend V t for validation setup, which mitigates the validation risk r 4 to r 4 V t .
  • x t is the total transaction amount on the legacy system.
  • y t is the total transaction amount on the blockchain system.
Intermediate variables:
  • C t is the average operational cost of the blockchain system at period t. It includes cost of processing registration, and transaction clearing and settlement. To reflect the scalability issue of blockchain with the increase of transactions, we adopt a linear function of the fundamental cost c 2 ( t ) and transaction amount y t to measure the average operational cost: C t = c 2 ( t ) + 1 j = 1 t I j y t . The slope is reciprocal to total investment on the blockchain system, since system and infrastructure improvement could mitigate the scalability issue.
  • R t is the average comprehensive risk of the blockchain system at period t. R t = r 2 ( t ) + r 3 j = 1 t I j + r 4 V t . It is the summation of the systemic risk r 2 ( t ) , the design risk r 3 j = 1 t I j , and the validation risk r 4 V t .
Table 3 summarizes parameters and variables of the organizer’s model.

5.4. Social Optimization

The optimization problem of the organizer is to minimize total cost and risk of two systems within a fixed period [ 1 , T ] . At each period t ( 1 t T ):
The organizer determines investment I t on system update and V t on verification setup. Given total transaction demand d t , the organizer decides the amount of transactions should be put on the legacy and blockchain system, x t and y t . The total cost H t includes the investment on update I t and on validation setup V t and operational cost c 1 x t + C t y t of two systems. The total risk Q t includes the risk of the legacy system r 1 x t 2 and the risk of the blockchain system R t y t 2 . Social disutility S t is the summation of total cost and total risk. Organizer’s cost function H t , risk function Q t and disutility function S t at period t, and total disutility S of the optimization horizon [ 1 , T ] are defined in Equations (3).
H t ( x t , y t , I t , V t ) = c 1 x t + I t + V t + C t y t = c 1 x t + I t + V t + ( c 2 ( t ) + 1 j = 1 t I j y t ) y t Q t ( x t , y t , I t , V t ) = r 1 x t 2 + R t y t 2 = r 1 x t 2 + ( r 2 ( t ) + r 3 j = 1 t I j + r 4 V t ) y t 2 S t ( x t , y t , I t , V t ) = H t + Q t S ( x 1 , . . . x T , y 1 , y T , I 1 , I T , V 1 , V T ) = t = 1 T δ t S t ( x t , y t , I t , V t )
Mathematically, the optimization problem of the organizer is written as:
min x t , y t , I t , V t S = t = 1 T δ t [ c 1 x t + I t + V t + y t ( c 2 ( t ) + 1 j = 1 t I j y t ) + r 1 x t 2 + ( r 2 ( t ) + r 3 j = 1 t I j + r 4 V t ) y t 2 ] s . t . x t , y t , I t , V t 0 x t + y t d t for all t .
This is a multistage optimization problem. Assume that the optimal strategy is conducted in all periods, it can be solved backward from t = T to t = 1 , as shown in Appendix B.1. The solution is:
For 1 < t < T ,
M t = c 1 ( c 2 ( t ) + 2 r 4 + 2 1 δ r 3 + 1 ) y t * = 0 0 < d t < M t 2 r 1 , M t < 0 2 r 1 d t + M t 2 ( r 1 + r 2 ( t ) ) d t m a x ( M t 2 r 1 , M t 2 r 2 ( t ) ) d t 0 < d t < M t 2 r 2 ( t ) , M t > 0 I t * = r 3 + 1 1 δ y t * j = 1 t 1 I j = r 3 + 1 1 δ ( y t * y t 1 * ) V t * = r 4 y t *
For t = T ,
M T = c 1 ( c 2 ( T ) + 2 r 4 + 2 r 3 + 1 ) y T * = 0 0 < d T < M T 2 r 1 , M T < 0 2 r 1 d T + M T 2 ( r 1 + r 2 ( T ) ) d T m a x ( M T 2 r 1 , M T 2 r 2 ( T ) ) d T 0 < d T < M T 2 r 2 ( T ) , M T > 0 I T * = r 3 + 1 y T * j = 1 T 1 I j = r 3 + 1 ( y T * y T 1 * 1 δ ) V T * = r 4 y T *
In the optimal solution, we define an intermediate parameter M t , as in Equation (5). M t captures the difference between the cost of the legacy system and the overall fundamental cost and controllable risk of the blockchain system. Therefore, M t reflects the relative advantage of the blockchain system.
M t = c 1 ( c 2 ( t ) + 2 r 4 + 2 1 δ r 3 + 1 ) 1 t < T c 1 ( c 2 ( t ) + 2 r 4 + 2 r 3 + 1 ) t = T

6. Adoption and Pricing Strategies

6.1. Adoption Trajectory and Market Capacity

Basing on solutions to social optimization of each period in previous section, we can plot the optimal strategy for adopting blockchain technology:
(1) From t = 1 to t = t * 1 , if M t = c 1 ( c 2 ( t ) + 2 r 4 + 2 1 δ r 3 + 1 ) < 0 and d t M t 2 r 1 , the optimal solution is y t * = 0 , I t * = 0 , V t * = 0 . During this period, the blockchain system should not be developed.
(2) The timing for blockchain deployment t * satisfies d t > M t 2 r 1 , equivalent to 2 r 1 d t + c 1 > c 2 ( t ) + 2 r 4 + 2 1 δ r 3 + 1 . By assumption, c 2 ( t ) is non-increasing and d t is non-decreasing, thus all t > t * satisfy the inequality, meaning the system will not be shut off once launched.
(3) From t = t * to t = T 1 , M t = c 1 c 2 ( t ) 2 r 4 2 1 δ r 3 + 1 ,
y t * = 2 r 1 d t + M t 2 ( r 1 + r 2 ( t ) ) d t M t 2 r 2 ( t ) , M t > 0 ; d t M t 2 r 1 , M t 0 d t 0 < d t < M t 2 r 2 ( t ) , M t > 0 I t * = r 3 + 1 1 δ ( y t * y t 1 * ) V t * = r 4 y t *
(4) At the last period T, M T = c 1 c 2 ( T ) 2 r 4 2 r 3 + 1 , with feasibility assumptions (A22) in Appendix B.2,
y T * = 2 r 1 d T + M T 2 ( r 1 + r 2 ( T ) ) d T M T r 2 ( T ) d T d T < M T r 2 ( T ) I T * = r 3 + 1 ( y T * y T 1 * 1 δ ) V T * = r 4 y T *
From step (2) of this optimal adoption trajectory, Proposition 2 can be derived. It indicates that the timing for blockchain adoption depends on the transaction demand and the relative advantage of the blockchain system. The transaction demand d t * and cost advantage of blockchain c 1 c 2 ( t * ) should be large enough relative to the risks, r 3 and r 4 of the blockchain system.
Proposition 2.
Under the assumptions that c 2 ( t ) is non-increasing, and that d t is non-decreasing, the optimal time t * that the blockchain system should be developed satisfies: (1) 2 r 1 d t * 1 + c 1 c 2 ( t * 1 ) + 2 r 4 + 2 1 δ r 3 + 1 , and (2) 2 r 1 d t * + c 1 > c 2 ( t * ) + 2 r 4 + 2 1 δ r 3 + 1 .
Proposition 3.
The optimal adoption strategy is to keep the average operational cost and the overall controllable risk of the blockchain system unchanged by updating the system and setting up validation adaptively.
Proof of Proposition 3.
With the optimal adoption strategy in step (3), average operational cost of the blockchain system, including transaction cost and verification cost, C t + V t * y t * = c 2 ( t ) + y t * j = 1 t I j * + r 4 = c 2 ( t ) + 1 δ 1 + r 3 + r 4 is kept constant by investment and setting up verifiers unless technological innovations occur. In each period, the organizer should invest in system update at the scale in proportional to the increment of transaction on the blockchain system and set up verifiers in proportional to the expected transaction amount of this period, which in turns eliminates the increase impetus of average transaction cost triggered by the increase of transaction. Total controllable risk, including cyber risk and operation risk, ( r 3 j = 1 t I j * + r 4 V t * ) y t * 2 = r 3 1 δ r 3 + 1 + r 4 is also managed to remain unchanged by system update and validation setup. □
Proposition 4.
The capacity of the blockchain system is the maximum amount of transactions that should be put on the blockchain system under the optimal situation and current technology conditions. If the amount of transactions on the blockchain exceeds that capacity, the social optimality can not be reached. The capacity of the blockchain system is measured by c 1 c 2 ( t ) 2 r 4 2 1 δ r 3 + 1 2 r 2 ( t ) . When the blockchain system is cost-effective and safe ( c 2 ( t ) , r 2 ( t ) , r 3 , and r 4 are small enough), the capacity would be larger than the transaction demand d t . That is the time that the legacy system could be abolished and completely replaced by the blockchain system.
Proof of Proposition 4.
When the relative advantage of blockchain M t = c 1 ( c 2 ( t ) + 2 r 4 + 2 1 δ r 3 + 1 ) > 0 , the optimal amount on the blockchain:
y t * = 2 r 1 d t + M t 2 ( r 1 + r 2 ( t ) ) d t M t 2 r 2 ( t ) d t 0 < d t < M t 2 r 2 ( t )
The threshold is M t 2 r 2 ( t ) = c 1 ( c 2 ( t ) + 2 r 4 + 2 1 δ r 3 + 1 ) 2 r 2 ( t ) . If d t < c 1 ( c 2 ( t ) + 2 r 4 + 2 1 δ r 3 + 1 ) 2 r 2 ( t ) , all the transactions should be put on the blockchain system. While if d t c 1 ( c 2 ( t ) + 2 r 4 + 2 1 δ r 3 + 1 ) 2 r 2 ( t ) , 2 r 1 d t + c 1 2 c 2 ( t ) 2 r 4 2 1 δ r 3 + 1 2 ( r 1 + r 2 ( t ) ) transactions should be put on the blockchain system and the rest 2 r 2 ( t ) d t 2 c 1 + 2 c 2 ( t ) + 2 r 4 + 2 1 δ r 3 + 1 2 ( r 1 + r 2 ( t ) ) should be put on the legacy system. Therefore, the blockchain system capacity can be denoted by the threshold c 1 ( c 2 ( t ) + 2 r 4 + 2 1 δ r 3 + 1 ) 2 r 2 ( t ) . It increases with cost difference ( c 1 c 2 ( t ) ) and decreases with risk of the blockchain system r 2 ( t ) . If at some time t that the blockchain system is cheap and safe( c 2 ( t ) and r 2 ( t ) are small enough), such that d t < M t 2 r 2 ( t ) holds for all t > t , the legacy system can be abolished and completely replaced by the blockchain system. □

6.2. A Case Study of the Optimal Adoption Trajectory

A numerical case study of the adoption trajectory is conducted. Values of parameters and exogenous variables of the model are set according to Table 4. The setting conforms to model assumptions that c 2 and r 2 are non-increasing and d t is non-decreasing.
Figure 5 displays dynamics of exogenous situations and corresponding optimal strategies. Exogenous variables, blockchain technology cost and risk c 2 , r 2 are in blue and transaction demand d t is in yellow. Intermediate variables M t and blockchain system capacity y t are shown in green. Solutions of decision variables, optimal amount on the blockchain system y t * , optimal investment for the blockchain system update I t * and optimal investment on validation configuration V t * are represented in red. Other variables under optimal condition, including average operational cost of the blockchain system C t , total investment on blockchain t I t , and total risk of the blockchain system R t y t * , are shown in black.
From Figure 5, we can find following situations consistent with aforementioned Propositions: (1) From period 1 to 2, the optimal strategy is not developing the blockchain system and putting all transactions on the legacy system, due the high cost and risk of blockchain technology. (2) The blockchain system should be adopted at period 3, when the cost c 2 and risk r 2 of blockchain are mitigated and transaction demand d t is relatively high. This is the point that the blockchain technology is worth to be deployed. (3) After the launch of the blockchain system, from period 3 to period 7 transactions are allocated to both systems. The optimal amount on blockchain system y t * should not exceed its capacity y t . The capacity of the blockchain system increases with reducing cost and risk of blockchain technology. (4) At period 8 and 9, the capacity of the blockchain system overpasses the transaction demand, at which the legacy system should be idled but should not be abolished, in case a sudden increase in the transaction demand. (5) At period 10, the legacy system should be rebooted, since the transaction demand increases to be higher than the capacity of blockchain system. This reboot implies the necessity to retain the idling legacy system for several periods as a backup for the blockchain system. (6) After period 11, the blockchain technology is mature enough and the capacity of blockchain system is much higher than that of the transaction demand. The legacy system can be dissolved for cost saving. (7) the organizer should invest in system update and validation configuration in each period to improve the capacity of blockchain system for accommodating increasing transaction demand. The investment in update I t * is determined by the increase of transaction demand between two consecutive periods and the investment on validation V t * is determined by transaction demand of that period. (8) The average transaction cost on blockchain system C t decreases with the reducing cost c 2 and risk r 2 of blockchain technology. The scalability issue of blockchain should be eliminated by updating the system, without impacting the average transaction cost on blockchain system. (9) Total risk of the blockchain system R t y t * is also mitigated by the investment on system update, as it is much more flat and steady than the increasing transaction amount y t * on the blockchain.

6.3. Adjustment during the Adoption

If the aforementioned optimal trajectory of adoption is not followed in the beginning or the estimates of some variables, such as d t , c 2 ( t ) and r 2 ( t ) , deviate from true values, the strategy should be adjusted during the adoption process. This forms a new optimization problem. Since the investment in the blockchain system before the adjustment-time, denoted as I 0 is sunk cost, it should not be considered in the new optimization problem. While it still impacts the transaction cost and risk of the blockchain system.
If at time t = t a , the adjustment or re-planning is considered, the adjustment optimization problem is formulated as:
min x t , y t , I t , V t S = t = t a T δ t t a [ c 1 x t + I t + V t + y t ( c 2 ( t ) + 1 I 0 + j = t a t I j y t ) + r 1 x t 2 + ( r 2 ( t ) + r 3 I 0 + j = t a t I j + r 4 V t ) y t 2 ] s . t . x t , y t , I t , V t 0 x t + y t d t for all t .
As the multistage adoption optimization problem is solved backward one period before another, the adjustment optimization problem can be considered as a portion of that problem from t = T to t = t a , given I 0 = t = 1 t a 1 I t . Therefore, the adjustment algorithm can be derived from the solution of adoption optimization:
  • Start with t = T , run adoption optimization, get y t * and calculate r 3 + 1 1 δ y t * I 0 .
  • If r 3 + 1 1 δ y t * I 0 > 0 , go backward one period to t = t 1 and run (1) again.
  • If r 3 + 1 1 δ y t * I 0 0 , t + 1 is the re-investment point.
This derives Proposition 5.
Proposition 5.
The optimal re-investment point t r satisfies r 3 + 1 1 δ y t r 1 * I 0 and r 3 + 1 1 δ y t r * > I 0 .
Before the optimal re-investment point, additional investment on the blockchain system is not needed since the existing investment is too large, deviating from the optimal value. After this point, more investment is required to improve the capacity of the blockchain system and to accommodate increasing demand. If r 3 + 1 1 δ y t * > I 0 holds for all adjustment periods t t a , it implies the previous investment in the blockchain system is smaller than the ideal value and additional investment is required immediately at the adjustment start time t a .
The solution to adjustment optimization is shown in Appendix C. The adjustment algorithm provides a method for re-planning or correcting the adoption strategy. If the optimal trajectory is not followed previously or estimates of key features turn out to be inaccurate, this algorithm can be used to adjust adoption strategy accordingly.

6.4. Pricing

The organizer needs to decide the registration fee L t r and transaction fee L t s of the legacy system, and the registration fee P t r and transaction fee P t s of the blockchain system. In the period of t < t * , the blockchain system should not be built, pricing is not considered.
Proposition 6.
Carbon traders’ decisions are impacted by the difference of transaction fees of the legacy system and the blockchain system L t r P t r . Through differentiated pricing, the organizer can guide individuals to behave in the social optimal manner.
Proof of Proposition 6.
Recall Proposition 1: under equilibrium conditions of individuals’ optimization, total transaction amount on the blockchain system, y t * satisfies Equation (7). Given parameters m t , d t , r 1 , r 2 ( t ) and r p , y t * is determined by the difference of transaction fees of the legacy system and the blockchain system L t r P t r . Therefore, the organizer can influence individuals’ decision by controlling L t r P t r .
2 ( r 1 + r 2 ( t ) ) y t * + m t ( P t s L t s ) 2 r 1 d t + r p ( m t 1 ) y t * = 0
Recall social optimal adoption trajectory in Section 6.1. During period t * < t < T , under equilibrium conditions of Proposition 1, the social optimal transaction amount on the blockchain system y t * * is re-presented in Equation (8).
y t * * = 2 r 1 d t + c 1 c 2 ( t ) 2 r 4 2 1 δ r 3 + 1 2 ( r 1 + r 2 ( t ) )
To achieve social optimality through pricing, let individual optimality y t * in Equation (7) equal to social optimality y t * * in Equation (8):
m t ( L t s P t s ) = c 1 ( c 2 ( t ) + 2 r 4 + 2 1 δ r 3 + 1 ) + r p ( m t 1 ) y t * *
From Equation (9), we can find that the optimal price advantage of the blockchain system L t s P t s is negatively related to y t * * . The larger is y t * * , the smaller the price difference should be. This can be explained by the perceived risk r p y t * * . Increase of transactions on the blockchain system reduces the perceived risk, therefore, the target amount of transactions on the blockchain can be directed even the transaction fee is higher.
Recall the relative advantage of blockchain system, M t = c 1 ( c 2 ( t ) + 2 r 4 + 2 1 δ r 3 + 1 ) . Plug M t in Equation (9), we can get:
m t ( L t s P t s ) = M t + 2 r p ( r 1 + r 2 ) ( m t 1 ) 2 r 1 d t + M t
The price advantage of the blockchain system L t s P t s is positively related to the systematic risk r 2 ( t ) and the fundamental perceived risk r p of the blockchain system. It signifies that the blockchain system should be priced cheaper to lead enough transactions on the system, when its systematic risk and perceived risk are relatively high. The price advantage of the blockchain system L t s P t s is not monotonous in terms of the relative advantage of blockchain system M t . With the decreasing of the fundamental cost of the blockchain system c 2 ( t ) , the relative advantage of blockchain system M t increases, while the price advantage of the blockchain system L t s P t s firstly decreases then increases. This is due to the optimal capacity of the blockchain system, which has been presented in Proposition 4. As the amount of transactions on the blockchain system reaches its capacity, the transaction fee of the blockchain should be priced higher to limit the increasing of transactions, for mitigating its scalability issue.
Since the organizer does not have complete information about each trader’s transaction demand, it can only estimate the demand of the majority and conduct pricing strategy accordingly. Trading behaviors of participants with higher or lower demand than the average cancel out to a certain extent. Therefore, the pricing strategy can affect major players in the market and guides the mainstream.

7. Conclusions

In the case of carbon trade, we discuss both benefits and risks that blockchain technology would bring. Integration of blockchain not only potentially improve the efficiency and effectiveness, but also changes the cost and risk structure of carbon markets. New legal, technical, protocol and other risks will be imposed, and should be managed appropriately for the functional and secure operation. Combining risk control requirements and features of blockchain technology, a hybrid blockchain-based carbon trading system and an associated organizational framework are designed. To apply blockchain to commercial applications, we believe that a consortium blockchain is more appropriate and an agency or a committee obligated to risk control and disputes resolution is currently indispensable.
The adoption model of the organizer shows that the blockchain system should be developed at the point that the technology is mature enough, when the fundamental cost and systematic risks are adequately low. Transactions should be gradually shifted from the legacy system to the blockchain system, with the decrease of cost and risks of the blockchain system. Additional investment on update and validation configuration is required to maintain certain average cost of the blockchain system, due to its scalability issue with the increase of transaction amount. The investment strategy can be adjusted during the adoption process according to its effects and transaction demand. The legacy system could be completely replaced by the blockchain system, when blockchain technology evolves to have superior performance and controllable risks. Combining adoption models of the organizer and of carbon traders, we prove that the organizer can impact traders’ choices and achieve the optimal business shift trajectory through differentiated pricing of the transaction fees of the legacy system and the blockchain system.
This research provides a framework for cost-effective analysis and technology update planning of deploying blockchain in various industries. It may rise attention of firms and governments to consider blockchain from both sides and help them make more rational decisions about whether, when and how to incorporate blockchain technology into existing businesses. It is worth noting that benefit and risk analysis of introducing blockchain technology is distinctive to various use cases, asking for understanding of both the technology and the businesses.

Author Contributions

Conceptualization, F.Z.; methodology, F.Z.; formal analysis, F.Z.; validation, W.K.C.; writing—original draft preparation, F.Z.; writing–review and editing, F.Z. and W.K.C.; supervision, W.K.C. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Acknowledgments

The authors thank Xin Guo at University of California, Berkeley for valuable support on the model formulation and language editing.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
DLTDistributed ledger technology
ICOInitial coin offering
CATCap-and-trade scheme
CERCertified emission reduction
GHGGreenhouse gas
MRVMonitoring, reporting and verification
KYCKnow-your-customer
AMLAnti-money laundering
pBFTPractical Byzantine Fault Tolerance

Appendix A. Individuals’ Optimization

min x i t , y i t G i t = L t r 1 { x i t > 0 } + L t s x i t + P t r 1 { y i t > 0 } + P t s y i t + x i t 2 r 1 + y i t 2 r 2 ( t ) + y i t r p y t s . t . x i t , y i t 0 x i t + y i t d i t
G i t = G i t 1 = L t r + L t s d i t + r 1 d i t 2 w h e n y i t = 0 G i t 2 = L t r + L t s ( d i t y i t ) + P t r + P t s y i t + ( d i t y i t ) 2 r 1 + y i t 2 r 2 ( t ) + y i t r p y t w h e n 0 < y i t < d i t G i t 3 = P t r + P t s d i t + d i t 2 r 2 ( t ) + d i t r p y i t + d i t w h e n y i t = d i t
We firstly deal with min G i t 2 :
min G i t 2 = L t r + L t s ( d i t y i t ) + P t r + P t s y i t + ( d i t y i t ) 2 r 1 + y i t 2 r 2 ( t ) + y i t r p y t s . t . 0 < y i t < d i t
Take first derivative,
d G i t 2 d y i t = 2 ( r 1 + r 2 ( t ) ) y i t + P t s L t s 2 r 1 d i t + r p y t y i t y t 2 Let d G i t 2 d y i t = 0 y i t = y i t where 2 ( r 1 + r 2 ( t ) ) y i t + P t s L t s 2 r 1 d i t + r p y t y i t y t 2 = 0
Let f ( y i t ) = 2 ( r 1 + r 2 ( t ) ) y i t + P t s L t s 2 r 1 d i t + r p y i t ( y i t + y i t ) 2 , then f ( y i t ) = 2 ( r 1 + r 2 ( t ) ) 2 r p y i t ( y i t + y i t ) 3 , and f ( y i t ) is increasing in ( 0 , + ) as shown in Figure A1.
Figure A1. f ( y i t ) .
Figure A1. f ( y i t ) .
Energies 13 01980 g0a1
All possible situations are discussed in the following:
(1) If f ( 0 ) = 2 ( r 1 + r 2 ( t ) ) 2 r p y i t 2 0 , f ( y i t ) is increasing in ( 0 , + ) . f ( 0 ) = P t s L t s 2 r 1 d i t + r p y i t .
(1.1) If f ( 0 ) 0 , G i t increases in ( 0 , + ) .
(1.2) If f ( 0 ) < 0 , G i t is decreasing in ( 0 , y i t ) and increasing in [ y i t , + ) , where y i t is the only positive solution to f ( y i t ) = 0
(2) If f ( 0 ) = 2 ( r 1 + r 2 ( t ) ) 2 r p y i t 2 < 0 ,
f ( y i t 0 ) = 0 r 1 + r 2 = r p y i t ( y i t 0 + y i t ) 3 y i t 0 = r p y i t r 1 + r 2 3 y i t
f ( y i t ) decreases in ( 0 , y i t 0 ) and increases in [ y i t 0 , + ) .
f ( y i t 0 ) = 2 ( r 1 + r 2 ( t ) ) y i t 0 + P t s L t s 2 r 1 d i t + ( r 1 + r 2 ( t ) ) ( y i t 0 + y i t ) = 3 ( r 1 + r 2 ( t ) ) y i t 0 + ( r 1 + r 2 ( t ) ) y i t + P t s L t s 2 r 1 d i t = 3 ( r 1 + r 2 ( t ) ) r p y i t r 1 + r 2 3 2 ( r 1 + r 2 ( t ) ) y i t + P t s L t s 2 r 1 d i t
(2.1) If f ( y i t 0 ) 0 , G i t increases in ( 0 , + ) .
(2.2) If f ( y i t 0 ) < 0 , f ( 0 ) 0 , G i t is decreasing in ( 0 , y i t ) and increasing in [ y i t , + ) , where y i t is the only positive solution to f ( y i t ) = 0
(2.3) If f ( y i t 0 ) < 0 , f ( 0 ) > 0 , G i t is increasing in ( 0 , y i t 1 ) , decreasing in ( y i t 1 , y i t ) and increasing in [ y i t , + ) , where y i t 1 and y i t are two positive solutions to f ( y i t ) = 0 and y i t 1 < y i t
Summarize all above conditions, the solution to min G i t 2 , y i t satisfies:
(1) If r 1 + r 2 ( t ) r p y i t 2 0 P t s L t s 2 r 1 d i t + r p y i t < 0 y i t = y i t if y i t < d i t d i t if y i t d i t where y i t is the only positive solution to f ( y i t ) = 0 .
(2) If r 1 + r 2 ( t ) r p y i t 2 < 0 f ( y i t 0 ) < 0 P t s L t s 2 r 1 d i t + r p y i t 0 y i t = y i t if y i t < d i t d i t if y i t d i t where y i t is the only positive solution to f ( y i t ) = 0 .
(3) If r 1 + r 2 ( t ) r p y i t 2 < 0 f ( y i t 0 ) < 0 P t s L t s 2 r 1 d i t + r p y i t > 0 y i t = y i t if y i t < d i t , G i t ( y i t ) G i t ( 0 ) d i t if y i t d i t , G i t ( 0 ) G i t ( d i t ) 0 Otherwise where y i t is the larger positive solution to f ( y i t ) = 0 .
(4) Under other conditions, there is no positive solution to f ( y i t ) = 0 . y i t = 0 .
G i t 2 ( y i t ) is compared with G i t 1 and G i t 3 to determine the solution to min G i t , and min G i t = min ( G i t 1 , G i t 3 , G i t 2 ( y i t ) ) . Since G i t 2 ( 0 ) > G i t 1 and G i t 2 ( d i t ) > G i t 3 , the solution to min G i t , y i t * equals to 0 , d i t or y i t , where y i t is the only(or larger) positive solution to d G i t 2 d y i t = 0 .
y i t * = 0 if y i t not exists , G i t 1 < G i t 3 ; 0 < y i t < d i t , G i t 1 < min ( G i t 2 ( y i t ) , G i t 3 ) ; y i t > d i t , G i t 1 < G i t 3 y i t if 0 < y i t < d i t and G i t 2 ( y i t ) < min ( G i t 1 , G i t 3 ) d i t if y i t not exists , G i t 3 < G i t 1 ; 0 < y i t < d i t , G i t 3 < min ( G i t 2 ( y i t ) , G i t 1 ) ; y i t d i t , G i t 3 < G i t 1
Assume that for all i, y i t * = y i t , where y i t satisfies Equation (A1):
2 ( r 1 + r 2 ( t ) ) y i t + P t s L t s 2 r 1 d i t + r p y i t * ( y i t * + y i t ) 2 = 0
Take summation of Equation (A1), y t * = i = 1 m t y i t * is the only or larger solution to Equation (A2):
2 ( r 1 + r 2 ( t ) ) y t * + m t ( P t s L t s ) 2 r 1 d t + r p ( m t 1 ) y t * = 0
y t * = 2 r 1 d t + m t ( L t s P t s ) + [ 2 r 1 d t + m t ( L t s P t s ) ] 2 8 r p ( m t 1 ) ( r 1 + r 2 ( t ) ) 4 ( r 1 + r 2 ( t ) )
Plug Equation (A3) back to Equation (A1), we can get Equation (A4):
y i t * = ( 2 r 1 d i t + L t s P t s ) y t * 2 y t * r p 2 ( r 1 + r 2 ( t ) ) y t * 2 r p
The feasibility is guaranteed with following conditions:
(1) Existence of y t * :
[ 2 r 1 d t + m t ( L t s P t s ) ] 2 8 r p ( m t 1 ) ( r 1 + r 2 ( t ) ) 0
(2) Feasibility of y i t * : 0 < y i t * < d i t
[ 2 ( r 1 + r 2 ) y t * 2 r p ] [ 2 r 1 d i t + ( L t s P t s ) y t * r p ] > 0 ( 2 r 2 d i t L t s + P t s ) y t * 2 + r p ( y t * d i t ) > 0
(3) Optimality of y i t * : G i t 2 ( y i t * ) < min ( G i t 1 , G i t 3 )
r p y i t * ( y t * y i t * 1 ) y t * P t r > 0 ( r 1 + r 2 ( t ) ) y i t * 2 ( 2 r 1 d i t + L t s P t s ) y i t * + r p ( y t * y i t * ) ( y i t * d i t ) y t * ( y t * y i t * + d i t ) + ( r 1 + r 2 ( t ) ) d i t 2 + ( L t s P t s ) d i t + L t r < 0
Given these conditions, there is a Nash Equilibrium for all traders in each period t, given by ( y 1 t * , , y m t t * ) :
y i t * = ( 2 r 1 d i t + L t s P t s ) y t * 2 y t * r p 2 ( r 1 + r 2 ( t ) ) y t * 2 r p , y t * = 2 r 1 d t + m t ( L t s P t s ) + [ 2 r 1 d t + m t ( L t s P t s ) ] 2 8 r p ( m t 1 ) ( r 1 + r 2 ( t ) ) 4 ( r 1 + r 2 ( t ) )

Appendix B. Social Optimization

Appendix B.1. Multistage Optimization

min x t , y t , I t , V t S = t = 1 T δ t [ c 1 x t + I t + V t + y t ( c 2 ( t ) + 1 j = 1 t I j y t ) + r 1 x t 2 + ( r 2 ( t ) + r 3 j = 1 t I j + r 4 V t ) y t 2 ] s . t . x t , y t , I t , V t 0 x t + y t d t for all t .
Equivalent to:
min y t , I t , V t S = t = 1 T δ t [ I t + V t + c 1 ( d t y t ) + y t ( c 2 ( t ) + 1 j = 1 t I j y t ) + r 1 ( d t y t ) 2 + ( r 2 ( t ) + r 3 j = 1 t I j + r 4 V t ) y t 2 ] s . t . 0 y t d t I t , V t 0 for all t .
Take first partial derivative,
S y t = δ t [ 2 ( r 1 + r 2 ( t ) + r 3 + 1 j = 1 t I j + r 4 V t ) y t 2 r 1 d t + c 2 ( t ) c 1 ] S I t = δ t ( r 3 + 1 ) i = t T δ i y i 2 ( j = 1 i I j ) 2 S V t = δ t r 4 y t 2 V t 2
This multistage optimization problem is solved backward from t = T to t = 1 .
At t = T , j = 1 T 1 I j is given and I t = I t * for all t < T :
S I T = δ T ( r 3 + 1 ) δ T y T 2 ( j = 1 T I j ) 2 = 0 j = 1 T I j = r 3 + 1 y T
S V T = δ T δ T r 4 y T 2 V T 2 = 0 V T = r 4 y T
S y T = δ T [ 2 ( r 1 + r 2 ( T ) + r 3 + 1 j = 1 T I j + r 4 V T ) y T 2 r 1 d T + c 2 ( T ) c 1 ] = 0
Plug Equations (A9) and (A10) in Equation (A11),
y T = 2 r 1 d T + c 1 c 2 ( T ) 2 r 4 2 r 3 + 1 2 ( r 1 + r 2 ( T ) )
Let M T = c 1 ( c 2 ( T ) + 2 r 4 + 2 r 3 + 1 ) .
If y T > d T , meaning d T < c 1 c 2 ( T ) 2 r 4 2 r 3 + 1 2 r 2 ( T ) = M T 2 r 2 ( T ) , y T * = d T .
If y T < 0 , meaning d T < c 2 ( T ) c 1 + 2 r 4 + 2 r 3 + 1 2 r 1 = M T 2 r 1 , y T * = 0 .
If M T > 0 ,
y T * = y T d T M T 2 r 2 ( T ) d T 0 < d T < M t 2 r 2 ( T )
If M T 0 ,
y T * = 0 0 < d T < M T 2 r 1 y T d T M T 2 r 1
Therefore,
y T * = 0 0 < d T < M T 2 r 1 , M T < 0 2 r 1 d T + M T 2 ( r 1 + r 2 ( T ) ) d T m a x ( M T 2 r 1 , M T 2 r 2 ( T ) ) d T 0 < d T < M T 2 r 2 ( T ) , M T > 0 , I T * = r 3 + 1 y T * j = 1 T 1 I j , V T * = r 4 y T *
If the optimal strategy is followed from t = 1 through t = T 1 , I T * 0 is guaranteed with the monotonicity assumptions of variables in Section 5. This will be proved in Appendix B.2.
At t = T 1 , j = 1 T 2 I j is given and I t = I t * for all t < T 1 :
S I T 1 = δ T 1 ( r 3 + 1 ) δ T 1 y T 1 2 ( j = 1 T 1 I j ) 2 ( r 3 + 1 ) δ T y T 2 ( j = 1 T I j ) 2 = 0
S V T 1 = δ T 1 δ T 1 r 4 y T 1 2 V T 1 2 = 0 V T 1 = r 4 y T 1
S y T 1 = δ T 1 [ 2 ( r 1 + r 2 ( T 1 ) + r 3 + 1 j = 1 T 1 I j + r 4 V T 1 ) y T 1 2 r 1 d T 1 + c 2 ( T 1 ) c 1 ] = 0
Plug Equation (A9) in Equation (A12),
y T 1 j = 1 T 1 I j = 1 δ r 3 + 1
Plug Equations (A13) and (A15) in Equation (A14),
y T 1 = 2 r 1 d T 1 + c 1 c 2 ( T 1 ) 2 r 4 2 1 δ r 3 + 1 2 ( r 1 + r 2 ( T 1 ) )
Let M T 1 = c 1 ( c 2 ( T 1 ) + 2 r 4 + 2 1 δ r 3 + 1 ) .
If y T 1 > d T 1 , meaning d T 1 < c 1 c 2 ( T 1 ) 2 r 4 2 1 δ r 3 + 1 2 r 2 ( T 1 ) = M T 1 2 r 2 ( T 1 ) , y T 1 * = d T 1 .
If y T 1 < 0 , meaning d T 1 < c 2 ( T 1 ) c 1 + 2 r 4 + 2 1 δ r 3 + 1 r 1 = M T 1 2 r 1 , y T 1 * = 0 .
y T 1 * = 0 d T 1 < M T 1 2 r 1 , M T 1 0 2 r 1 d T 1 + M T 1 2 ( r 1 + r 2 ( T 1 ) ) d T 1 max ( M T 1 2 r 1 , M T 1 2 r 2 ( T 1 ) ) d T 1 d T 1 < M T 1 2 r 2 ( T 1 ) , M T 1 > 0 , I T 1 * = r 3 + 1 1 δ y T 1 * j = 1 T 2 I j , V T 1 * = r 4 y T 1 *
Similar to t = T , I T 1 * 0 is guaranteed with with the monotonicity assumptions, if optimal strategy is conducted previously.
At t = T 2 , j = 1 T 3 I j is given and I t = I t * for all t < T 2 :
S I T 2 = δ T 2 ( r 3 + 1 ) δ T 2 y T 2 2 ( j = 1 T 2 I j ) 2 ( r 3 + 1 ) δ T 1 y T 1 2 ( j = 1 T 1 I j ) 2 ( r 3 + 1 ) δ T y T 2 ( j = 1 T I j ) 2 = 0
S V T 2 = δ T 2 δ T 2 r 4 y T 2 2 V T 2 2 = 0 V T 2 = r 4 y T 2
S y T 2 = δ T 2 [ 2 ( r 1 + r 2 ( T 2 ) + r 3 + 1 j = 1 T 2 I j + r 4 V T 2 ) y T 2 2 r 1 d T 2 + c 2 ( T 2 ) c 1 ] = 0
Plug Equation (A12) in Equation (A17),
y T 2 j = 1 T 2 I j = 1 δ r 3 + 1
Plug Equations (A18) and (A20) in Equation (A19),
y T 2 = 2 r 1 d T 2 + c 1 c 2 ( T 2 ) 2 r 4 2 1 δ r 3 + 1 2 ( r 1 + r 2 ( T 2 ) )
Let M T 2 = c 1 ( c 2 ( T 2 ) + 2 r 4 + 2 1 δ r 3 + 1 ) .
If y T 2 > d T 2 , meaning d T 2 < c 1 c 2 ( T 2 ) 2 r 4 2 1 δ r 3 + 1 2 r 2 ( T 2 ) = M T 2 2 r 2 ( T 2 ) , y T 2 * = d T 2 .
If y T 2 < 0 , meaning d T 2 < c 2 ( T 2 ) c 1 + 2 r 4 + 2 1 δ r 3 + 1 2 r 1 = M T 2 2 r 1 , y T 2 * = 0 .
y T 2 * = 0 d T 2 < M T 2 2 r 1 , M T 2 0 2 r 1 d T + M T 2 2 ( r 1 + r 2 ( T 2 ) ) d T 2 max ( M T 2 2 r 1 , M T 2 2 r 2 ( T 2 ) ) d T 2 d T 2 < M T 2 2 r 2 ( T 2 ) , M T 2 > 0 , I T 2 * = r 3 + 1 1 δ y T 2 * j = 1 T 3 I j , V T 2 * = r 4 y T 1 *
Similar to t = T 1 , I T 2 * 0 is guaranteed with with the monotonicity assumptions, if optimal strategy is conducted previously.
Run this optimization method one period before another, we can go from t = T all the way to t = 1 .
At t = 1 , let M 1 = c 1 ( c 2 ( 1 ) + 2 r 4 + 2 1 δ r 3 + 1 ) ,
y 1 * = 0 d 1 < M 1 2 r 1 , M 1 0 2 r 1 d 1 + M 1 2 ( r 1 + r 2 ( 1 ) ) d 1 max ( M 1 2 r 1 , M 1 2 r 2 ( 1 ) ) d 1 d 1 < M 1 2 r 2 ( 1 ) , M 1 > 0 , I 1 * = r 3 + 1 1 δ y 1 * , V 1 * = r 4 y 1 *
Assume the optimal strategy is conducted in all periods from t = 1 to t = T , the solution to the multistage optimization problem is as following:
For t < T , let M t = c 1 ( c 2 ( t ) + 2 r 4 + 2 1 δ r 3 + 1 )
y t * = 0 0 < d t < M t 2 r 1 , M t 0 2 r 1 d t + M t 2 ( r 1 + r 2 ( t ) ) d t m a x ( M t 2 r 1 , M t 2 r 2 ( t ) ) d t 0 < d t < M t 2 r 2 ( t ) , M t > 0 I t * = r 3 + 1 1 δ y t * j = 1 t 1 I j = r 3 + 1 1 δ ( y t * y t 1 * ) V t * = r 4 y t *
For t = T , let M T = c 1 ( c 2 ( T ) + 2 r 4 + 2 r 3 + 1 )
y T * = 0 0 < d T < M T 2 r 1 , M T < 0 2 r 1 d T + M T 2 ( r 1 + r 2 ( T ) ) d T m a x ( M T 2 r 1 , M T 2 r 2 ( T ) ) d T 0 < d T < M T 2 r 2 ( T ) , M T > 0 I T * = r 3 + 1 y T * j = 1 T 1 I j = r 3 + 1 ( y T * y T 1 * 1 δ ) V T * = r 4 y T *

Appendix B.2. Feasibility of the Solution

The feasibility of this solution is examined in this part.
(1) For t < T , y t * = min ( d t , ( 2 r 1 d t + M t 2 ( r 1 + r 2 ( t ) ) ) + ) , where M t = c 1 ( c 2 ( t ) + 2 r 4 + 2 1 δ r 3 + 1 ) . Since d t is non-decreasing and c 2 ( t ) and r 2 ( t ) are non-increasing overtime, y t * is non-decreasing.
I t * = r 3 + 1 1 δ y t * j = 1 t 1 I j = r 3 + 1 1 δ ( y t * y t 1 * ) 0 . So I t * is always feasible if the solution is followed from the beginning t = 1 .
(2) For t = T , y T * = min ( d T , ( 2 r 1 d T + M T 2 ( r 1 + r 2 ( T ) ) ) + ) , where M T = c 1 ( c 2 ( T ) + 2 r 4 + 2 ( r 3 + 1 + 1 r 3 + 1 ) ) . I T * = r 3 + 1 y T * r 3 + 1 1 δ y T 1 * . To keep it feasible, we assume that y T * y T 1 * 1 δ 0 , implying
1 δ m i n ( d T , ( 2 r 1 d T + M T 2 ( r 1 + r 2 ( T ) ) ) + ) m i n ( d T 1 , ( 2 r 1 d T 1 + M T 1 2 ( r 1 + r 2 ( T 1 ) ) ) + )

Appendix C. Adjustment Optimization

(1) Before the re-investment point t < t r , I t = 0 , the optimization can be simplified to:
min y t , I t , V t S t = V t + c 1 ( d t y t ) + y t ( c 2 ( t ) + 1 I 0 y t ) + r 1 ( d t y t ) 2 + ( r 2 ( t ) + r 3 I 0 + r 4 V t ) y t 2 s . t . 0 y t d t V t 0
Take first partial derivative,
S t y t = 2 ( r 1 + r 2 ( t ) + r 3 + 1 I 0 + r 4 V t ) y t 2 r 1 d t + c 2 ( t ) c 1 S t V t = 1 r 4 y t 2 V t 2
Let two equations in (A23) equal to 0, we have:
y t = 2 r 1 d t + c 1 c 2 ( t ) 2 r 4 2 ( r 1 + r 2 ( t ) + r 3 + 1 I 0 )
Let N t = c 1 ( c 2 ( t ) + 2 r 4 ) ,
y t * = 0 0 < d t < N t 2 r 1 , N t < 0 2 r 1 d t + N t 2 ( r 1 + r 2 ( t ) ) d t m a x ( N t 2 r 1 , N t 2 r 2 ( t ) ) d t 0 < d t < N t 2 r 2 ( t ) , N t > 0 , I t * = 0 , V t * = r 4 y t *
(2) After the re-investment point t t r , the optimization is similar to that of adoption optimization. Let M t = c 1 ( c 2 ( t ) + 2 r 4 + 2 1 δ r 3 + 1 ) ,
y t * = 0 0 < d t < M t 2 r 1 , M t 0 2 r 1 d t + M t 2 ( r 1 + r 2 ( t ) ) d t m a x ( M t 2 r 1 , M t 2 r 2 ( t ) ) d t 0 < d t < M t 2 r 2 ( t ) , M t > 0 V t * = r 4 y t * I t * = r 3 + 1 1 δ y t * I 0 j = t r 1 t 1 I j for t t r = r 3 + 1 1 δ ( y t * y t 1 * ) for t > t r

References

  1. Lin, I.C.; Liao, T.C. A Survey of Blockchain Security Issues and Challenges. IJ Netw. Secur. 2017, 19, 653–659. [Google Scholar]
  2. Karame, G. On the security and scalability of bitcoin’s blockchain. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, 24 October 2016; pp. 1861–1862. [Google Scholar]
  3. Herrera-Joancomartí, J.; Pérez-Solà, C. Privacy in bitcoin transactions: New challenges from blockchain scalability solutions. In International Conference on Modeling Decisions for Artificial Intelligence; Springer: Berlin, Germany, 2016; pp. 26–44. [Google Scholar]
  4. Fry, J.; Cheah, E.T. Negative bubbles and shocks in cryptocurrency markets. Int. Rev. Financ. Anal. 2016, 47, 343–352. [Google Scholar] [CrossRef]
  5. Dyhrberg, A.H. Hedging capabilities of bitcoin. Is it the virtual gold? Financ. Res. Lett. 2016, 16, 139–144. [Google Scholar] [CrossRef] [Green Version]
  6. Briere, M.; Oosterlinck, K.; Szafarz, A. Virtual currency, tangible return: Portfolio diversification with bitcoin. J. Asset Manag. 2015, 16, 365–373. [Google Scholar] [CrossRef]
  7. Gump, A.; Leonard, C. Blockchain: Regulating the future of finance. Int. Financ. Law Rev. 2016, 35, 1. [Google Scholar]
  8. Luu, L.; Chu, D.H.; Olickel, H.; Saxena, P.; Hobor, A. Making smart contracts smarter. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, 24–26 October 2016; pp. 254–269. [Google Scholar]
  9. Idelberger, F.; Governatori, G.; Riveret, R.; Sartor, G. Evaluation of logic-based smart contracts for blockchain systems. In International Symposium on Rules and Rule Markup Languages for the Semantic Web; Springer: Berlin, Germany, 2016; pp. 167–183. [Google Scholar]
  10. Kosba, A.; Miller, A.; Shi, E.; Wen, Z.; Papamanthou, C. Hawk: The blockchain model of cryptography and privacy-preserving smart contracts. In 2016 IEEE Symposium on Security and Privacy (SP); IEEE: Piscataway, NJ, USA, 2016; pp. 839–858. [Google Scholar]
  11. Milutinovic, M.; He, W.; Wu, H.; Kanwal, M. Proof of luck: An efficient blockchain consensus protocol. In Proceedings of the 1st Workshop on System Software for Trusted Execution, Trento, Italy, 12–16 December 2016; pp. 1–6. [Google Scholar]
  12. Chalaemwongwan, N.; Kurutach, W. State of the art and challenges facing consensus protocols on blockchain. In 2018 International Conference on Information Networking (ICOIN); IEEE: Piscataway, NJ, USA, 2018; pp. 957–962. [Google Scholar]
  13. Pass, R.; Seeman, L.; Shelat, A. Analysis of the blockchain protocol in asynchronous networks. In Annual International Conference on the Theory and Applications of Cryptographic Techniques; Springer: Berlin, Germany, 2017; pp. 643–673. [Google Scholar]
  14. Korpela, K.; Hallikas, J.; Dahlberg, T. Digital supply chain transformation toward blockchain integration. In Proceedings of the 50th Hawaii International Conference on System Sciences, Waikoloa Village, HI, USA, 4–7 January 2017. [Google Scholar]
  15. Yue, X.; Wang, H.; Jin, D.; Li, M.; Jiang, W. Healthcare data gateways: Found healthcare intelligence on blockchain with novel privacy risk control. J. Med. Syst. 2016, 40, 218. [Google Scholar] [CrossRef]
  16. Peterson, K.; Deeduvanu, R.; Kanjamala, P.; Boles, K. A blockchain-based approach to health information exchange networks. In Proceedings of the NIST Workshop Blockchain Healthcare, Gaithersburg, MD, USA, 26–27 September 2016; Volume 1, pp. 1–10. [Google Scholar]
  17. Aitzhan, N.Z.; Svetinovic, D. Security and privacy in decentralized energy trading through multi-signatures, blockchain and anonymous messaging streams. IEEE Trans. Dependable Secur. Comput. 2016, 15, 840–852. [Google Scholar] [CrossRef]
  18. Pop, C.; Cioara, T.; Antal, M.; Anghel, I.; Salomie, I.; Bertoncini, M. Blockchain based decentralized management of demand response programs in smart energy grids. Sensors 2018, 18, 162. [Google Scholar] [CrossRef] [Green Version]
  19. Peter, H.; Moser, A. Blockchain-applications in banking & payment transactions: Results of a survey. Eur. Financ. Syst. 2017, 141–149. [Google Scholar]
  20. Gatteschi, V.; Lamberti, F.; Demartini, C.; Pranteda, C.; Santamaría, V. Blockchain and smart contracts for insurance: Is the technology mature enough? Future Int. 2018, 10, 20. [Google Scholar] [CrossRef] [Green Version]
  21. Lamberti, F.; Gatteschi, V.; Demartini, C.; Pelissier, M.; Gomez, A.; Santamaria, V. Blockchains can work for car insurance: Using smart contracts and sensors to provide on-demand coverage. IEEE Consum. Electron. Mag. 2018, 7, 72–81. [Google Scholar] [CrossRef]
  22. Mainelli, M.; Milne, A. The Impact and Potential of Blockchain on the Securities Transaction Lifecycle. SWIFT Institute Working Paper No. 2015-007. Available at SSRN 2777404. 2016. Available online: https://papers.ssrn.com/sol3/papers.cfm?abstract_id=2777404 (accessed on 1 March 2020).
  23. Lee, L. New kids on the blockchain: How bitcoin’s technology could reinvent the stock market. Hastings Bus. LJ 2015, 12, 81. [Google Scholar] [CrossRef] [Green Version]
  24. Santo, A.; Minowa, I.; Hosaka, G.; Hayakawa, S.; Kondo, M.; Ichiki, S.; Kaneko, Y. Applicability of Distributed Ledger Technology to Capital Market Infrastructure; Japan Exchange Group: Tokyo, Japan, 2016. [Google Scholar]
  25. Pinna, A.; Ruttenberg, W. Distributed Ledger Technologies in Securities Post-Trading Revolution or Evolution? ECB Occasional Paper 28 April 2016. Available online: https://papers.ssrn.com/sol3/papers.cfm?abstract_id=2770340 (accessed on 1 March 2020).
  26. Benos, E.; Garratt, R.; Gurrola-Perez, P. The Economics of Distributed Ledger Technology for Securities Settlement. Available at SSRN 3023779. 2017. Available online: https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3023779 (accessed on 1 March 2020).
  27. Yuan, Y.; Wang, F.Y. Towards blockchain-based intelligent transportation systems. In Proceedings of the 2016 IEEE 19th International Conference on Intelligent Transportation Systems (ITSC), Rio de Janeiro, Brazil, 1–4 November 2016; pp. 2663–2668. [Google Scholar]
  28. Xu, R.; Zhang, L.; Zhao, H.; Peng, Y. Design of network media’s digital rights management scheme based on blockchain technology. In Proceedings of the 2017 IEEE 13th International Symposium on Autonomous Decentralized System (ISADS), Bangkok, Thailand, 22–24 March 2017; pp. 128–133. [Google Scholar]
  29. Zyskind, G.; Nathan, O. Decentralizing privacy: Using blockchain to protect personal data. In 2015 IEEE Security and Privacy Workshops; IEEE: Piscataway, NJ, USA, 2015; pp. 180–184. [Google Scholar]
  30. Dorri, A.; Kanhere, S.S.; Jurdak, R.; Gauravaram, P. Blockchain for IoT security and privacy: The case study of a smart home. In Proceedings of the 2017 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops), Kona, HI, USA, 13–17 March 2017; pp. 618–623. [Google Scholar]
  31. Weber, I.; Xu, X.; Riveret, R.; Governatori, G.; Ponomarev, A.; Mendling, J. Untrusted business process monitoring and execution using blockchain. In International Conference on Business Process Management; Springer: Berlin, Germany, 2016; pp. 329–347. [Google Scholar]
  32. Governatori, G.; Idelberger, F.; Milosevic, Z.; Riveret, R.; Sartor, G.; Xu, X. On legal contracts, imperative and declarative smart contracts, and blockchain systems. Artif. Intell. Law 2018, 26, 377–409. [Google Scholar] [CrossRef]
  33. Rifi, N.; Rachkidi, E.; Agoulmine, N.; Taher, N.C. Towards using blockchain technology for IoT data access protection. In Proceedings of the 2017 IEEE 17th International Conference on Ubiquitous Wireless Broadband (ICUWB), Salamanca, Spain, 12–15 September 2017; pp. 1–5. [Google Scholar]
  34. Chen, J.; Xue, Y. Bootstrapping a blockchain based ecosystem for big data exchange. In Proceedings of the 2017 IEEE International Congress on Big Data (Bigdata Congress), Honolulu, HI, USA, 25–30 June 2017; pp. 460–463. [Google Scholar]
  35. Outchakoucht, A.; Hamza, E.; Leroy, J.P. Dynamic access control policy based on blockchain and machine learning for the internet of things. Int. J. Adv. Comput. Sci. Appl. 2017, 8, 417–424. [Google Scholar] [CrossRef]
  36. Dinh, T.N.; Thai, M.T. Ai and blockchain: A disruptive integration. Computer 2018, 51, 48–53. [Google Scholar] [CrossRef]
  37. Walch, A. The bitcoin blockchain as financial market infrastructure: A consideration of operational risk. NYUJ Legis. Pub. Pol’y 2015, 18, 837. [Google Scholar]
  38. Davidson, S.; De Filippi, P.; Potts, J. Economics of Blockchain. Available at SSRN 2744751. 2016. Available online: https://papers.ssrn.com/sol3/papers.cfm?abstract_id=2744751 (accessed on 1 March 2020).
  39. McWaters, R.J.; Galaski, R.; Chatterjee, S. The Future of Financial Infrastructure: An Ambitious Look at How Blockchain Can Reshape Financial Services; World Economic Forum: Cologny, Switzerland, 2016; Volume 49. [Google Scholar]
  40. Adams, R.; Parry, G.; Godsiff, P.; Ward, P. The future of money and further applications of the blockchain. Strateg. Chang. 2017, 26, 417–422. [Google Scholar] [CrossRef]
  41. Moore, T.; Christin, N. Beware the middleman: Empirical analysis of Bitcoin-exchange risk. In International Conference on Financial Cryptography and Data Security; Springer: Berlin, Germany, 2013; pp. 25–33. [Google Scholar]
  42. Möser, M.; Böhme, R.; Breuker, D. Towards risk scoring of Bitcoin transactions. In International Conference on Financial Cryptography and Data Security; Springer: Berlin, Germany, 2014; pp. 16–32. [Google Scholar]
  43. Li, X.; Jiang, P.; Chen, T.; Luo, X.; Wen, Q. A survey on the security of blockchain systems. Future Gener. Comput. Syst. 2017, 107, 841–853. [Google Scholar] [CrossRef] [Green Version]
  44. Moubarak, J.; Filiol, E.; Chamoun, M. On blockchain security and relevant attacks. In Proceedings of the 2018 IEEE Middle East and North Africa Communications Conference (MENACOMM), Jounieh, Lebanon, 18–20 April 2018; pp. 1–6. [Google Scholar]
  45. Mills, D.C.; Wang, K.; Malone, B.; Ravi, A.; Marquardt, J.; Badev, A.I.; Brezinski, T.; Fahy, L.; Liao, K.; Kargenian, V.; et al. Distributed Ledger Technology in Payments, Clearing, and Settlement. FEDS Working Paper No2016-095. Available at SSRN 2881204. 2016. Available online: https://papers.ssrn.com/sol3/papers.cfm?abstract_id=2881204 (accessed on 1 March 2020).
  46. Staples, M.; Chen, S.; Falamaki, S.; Ponomarev, A.; Rimba, P.; Tran, A.; Weber, I.; Xu, X.; Zhu, J. Risks and Opportunities for Systems Using Blockchain and Smart Contracts; Data61; CSIRO: Sydney, Australia, 2017. [Google Scholar]
  47. Xu, X.; Weber, I.; Staples, M.; Zhu, L.; Bosch, J.; Bass, L.; Pautasso, C.; Rimba, P. A taxonomy of blockchain-based systems for architecture design. In Proceedings of the 2017 IEEE International Conference on Software Architecture (ICSA), Gothenburg, Sweden, 5–7 April 2017; pp. 243–252. [Google Scholar]
  48. Lakhani, K.R.; Iansiti, M. The Truth About Blockchain. Harv. Bus.Rev. 2017, 95, 118–127. [Google Scholar]
  49. Folkinshteyn, D.; Lennon, M. Braving Bitcoin: A technology acceptance model (TAM) analysis. J. Inf. Technol. Case Appl. Res. 2016, 18, 220–249. [Google Scholar] [CrossRef]
  50. Alkawasmi, E.; Arnautovic, E.; Svetinovic, D. Requirements Model for a High-Privacy Decentralized Carbon Emissions Trading Platform. In Proceedings of the 2012 IEEE International Conference on Green Computing and Communications, Nagapattinam, Tamil Nadu, India, 30–31 March 2012; pp. 450–453. [Google Scholar]
  51. Al Kawasmi, E.; Arnautovic, E.; Svetinovic, D. Bitcoin-based decentralized carbon emissions trading infrastructure model. Syst. Eng. 2015, 18, 115–130. [Google Scholar] [CrossRef]
  52. Johnson, L.; Isam, A.; Gogerty, N.; Zitoli, J. Connecting the Blockchain to the Sun to Save the Planet. Available at SSRN 2702639. 2015. Available online: https://papers.ssrn.com/sol3/papers.cfm?abstract_id=2702639 (accessed on 1 March 2020).
  53. Leonhard, R. Developing the Crypto Carbon Credit on Ethereum’s Blockchain. Available at SSRN 3000472. 2017. Available online: https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3000472 (accessed on 1 March 2020).
  54. Leonhard, R. Forget Paris: Building a Carbon Market in the US Using Blockchain-Based Smart Contracts. Available at SSRN 3082450. 2017. Available online: https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3082450 (accessed on 1 March 2020).
  55. Macinante, J.D. A Conceptual Model for Networking of Carbon Markets on Distributed Ledger Technology Architecture. Carbon Clim. Law Rev. 2017, 11, 243–260. [Google Scholar] [CrossRef]
  56. Imbault, F.; Swiatek, M.; De Beaufort, R.; Plana, R. The green blockchain: Managing decentralized energy production and consumption. In Proceedings of the 2017 IEEE International Conference on Environment and Electrical Engineering and 2017 IEEE Industrial and Commercial Power Systems Europe (EEEIC/I&CPS Europe), Milan, Italy, 6–9 June 2017; pp. 1–5. [Google Scholar]
  57. Khaqqi, K.N.; Sikorski, J.J.; Hadinoto, K.; Kraft, M. Incorporating seller/buyer reputation-based system in blockchain-enabled emission trading application. Appl. Energy 2018, 209, 8–19. [Google Scholar] [CrossRef]
  58. Khatoon, A.; Verma, P.; Southernwood, J.; Massey, B.; Corcoran, P. Blockchain in Energy Efficiency: Potential Applications and Benefits. Energies 2019, 12, 3317. [Google Scholar] [CrossRef] [Green Version]
  59. Franke, L.A.; Schletz, M.; Salomo, S. Designing a Blockchain Model for the Paris Agreement’s Carbon Market Mechanism. Sustainability 2020, 12, 1068. [Google Scholar] [CrossRef] [Green Version]
  60. Martin, P.; Walters, R. Fraud risk and the visibility of carbon. Int. J. Crime Justice Soc. Democr. 2013, 2, 27–42. [Google Scholar] [CrossRef]
  61. Frunza, M.C. Fraud and Carbon Markets: The Carbon Connection; Routledge: Abingdon-on-Thames, UK, 2013. [Google Scholar]
  62. Lohmann, L. Regulation as corruption in the carbon offset markets. In Upsetting the Offset: The Political Economy of Carbon Markets; Mayfly Books: London, UK, 2009; pp. 175–192. [Google Scholar]
  63. Aakre, S.; Hovi, J. Emission trading: Participation enforcement determines the need for compliance enforcement. Eur. Union Politics 2010, 11, 427–445. [Google Scholar] [CrossRef]
  64. Frunza, M.C. Aftermath of the VAT fraud on carbon emissions markets. J. Financ. Crime 2013, 20, 222–236. [Google Scholar] [CrossRef]
  65. Di Maria, C.; Van der Werf, E. Carbon leakage revisited: Unilateral climate policy with directed technical change. Environ. Resour. Econ. 2008, 39, 55–74. [Google Scholar] [CrossRef]
  66. Aichele, R.; Felbermayr, G. Kyoto and carbon leakage: An empirical analysis of the carbon content of bilateral trade. Rev. Econ. Stat. 2015, 97, 104–115. [Google Scholar] [CrossRef] [Green Version]
Figure 1. Cost and risk structure of current and blockchain-based CATs.
Figure 1. Cost and risk structure of current and blockchain-based CATs.
Energies 13 01980 g001
Figure 2. An overview of the organizational architecture.
Figure 2. An overview of the organizational architecture.
Energies 13 01980 g002
Figure 3. Individuals’ model.
Figure 3. Individuals’ model.
Energies 13 01980 g003
Figure 4. Organizer’s model.
Figure 4. Organizer’s model.
Energies 13 01980 g004
Figure 5. Adoption Trajectory.
Figure 5. Adoption Trajectory.
Energies 13 01980 g005
Table 1. Problems of current cap and trade schemes (CATs) and blockchain’s potential
Table 1. Problems of current cap and trade schemes (CATs) and blockchain’s potential
Problems of Current CATsBlockchain’s Potential
The implementation, including credits registration, transaction settlement, emission verification and compliance inspection, requires complex administration and extensive manual intervention.Transactions are automatically processed on blockchain according to pre-defined protocols. If connected to IoT devices and production management systems, blockchain can access real-time emission data and would be able to automate carbon accounting process. Both could significantly improve the efficiency and reduce the administration cost. On the other hand, blockchain suffers from the scalability problem with the increase of transactions, which puts upward pressure on the transaction cost.
The monitoring, reporting and verification (MRV) mechanism in CATs is not only cumbersome but also vulnerable to fraud claims [60,61] and double accounting problems. The hidden data also raise trust issues among participants.Blockchain prevents double accounting and fraud claims to a certain extent, by providing an immutable and auditable record.
A centralized registration agency is susceptible to hacking and corruption [62].Blockchain avoids one point failure and improves the security through information and verification decentralization. If appropriately designed, privacy and transparency can be controlled flexibly, constructing trust among regulated companies and making the system more attractive to them.
Many CAT schemes lack an effective punishment mechanism or it is poorly executed, diminishing the effectiveness of carbon markets [63].As smart contracts on blockchain are automatically executed, rules of CATs can be encoded in the algorithm and punishment can be enforced, ensuring the effectiveness and authority of the trading scheme.
Regional carbon markets are operated in more than 50 jurisdictions. Information silos are exploited for value added tax fraud [64] and carbon leakage [65,66].Cross-chain technology of blockchain provides opportunity for networking of carbon markets of different nations and regions or of different types of credits.
Table 2. Notations of variables and parameters of individuals’model
Table 2. Notations of variables and parameters of individuals’model
NotationsMeaning
m t Number of individuals in carbon market at period t.
d i t The transaction demand of individual i at period t. It is assumed non-decreasing over time t.
Decision variables
x i t Amount of transactions that individual i put on the legacy system.
y i t Amount of transactions that individual i put on the blockchain system.
Legacy system
L t r Registration fee of the legacy system at period t, given by the organizer.
L t s Transaction fee of the legacy system at period t, given by the organizer.
r 1 Risk of the legacy system.
Blockchain system
P t r Registration fee of the blockchain system at period t, given by the organizer.
P t s Transaction fee of the blockchain system at period t, given by the organizer.
r 2 ( t ) The systematic risk of the blockchain system.
r p Basic perceived risk of the blockchain system, can be mitigated by more transactions to r p y t .
Table 3. Notations of variables and parameters of the organizer’s model.
Table 3. Notations of variables and parameters of the organizer’s model.
NotationsMeaning
δ A discount factor between periods. 0 < δ < 1 .
d t Total transaction demand of all traders at period t.
Legacy system
c 1 Average operational cost of the legacy system.
r 1 Risk of the legacy system.
Blockchain system
c 2 ( t ) The fundamental operational cost of the blockchain system at period t. Non-increasing over time.
r 2 ( t ) The systematic risk of the blockchain system at period t. Non-increasing over time.
r 3 The basic design risk of the blockchain system.
r 4 The basic validation risk of the blockchain system.
Decision variables
x t Amount of transactions on the legacy system at period t.
y t Amount of transactions on the blockchain system at period t.
I t Investment on blockchain system update at period t.
V t Investment on validation setup at period t.
Intermediate variables
C t Average operational cost of the blockchain system at period t. C t = c 2 ( t ) + 1 j = 1 t I j y t .
R t Average comprehensive risk of the blockchain system at period t. R t = r 2 ( t ) + r 3 j = 1 t I j + r 4 V t
Table 4. Values settings of parameters and exogenous variables
Table 4. Values settings of parameters and exogenous variables
Parameters/VariablesValue
t15
r 1 0.15
r 3 , r 4 0.25
δ 0.6875
c 1 41.5
c 2 [50, 50, 40, 40, 32, 32, 32, 25, 25, 25, 18, 18, 17, 17, 16]
r 2 [0.25, 0.25, 0.25, 0.2, 0.2, 0.2, 0.16, 0.15, 0.15, 0.15, 0.14, 0.13, 0.11, 0.11, 0.11]
d t [20, 20, 30, 38, 38, 44, 44, 45, 50, 60, 61, 62, 63, 65, 65]

Share and Cite

MDPI and ACS Style

Zhao, F.; Chan, W.K. When Is Blockchain Worth It? A Case Study of Carbon Trading. Energies 2020, 13, 1980. https://0-doi-org.brum.beds.ac.uk/10.3390/en13081980

AMA Style

Zhao F, Chan WK. When Is Blockchain Worth It? A Case Study of Carbon Trading. Energies. 2020; 13(8):1980. https://0-doi-org.brum.beds.ac.uk/10.3390/en13081980

Chicago/Turabian Style

Zhao, Fangyuan, and Wai Kin (Victor) Chan. 2020. "When Is Blockchain Worth It? A Case Study of Carbon Trading" Energies 13, no. 8: 1980. https://0-doi-org.brum.beds.ac.uk/10.3390/en13081980

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop