ASAkira Sakurai

Akira Sakurai

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Akira Sakurai has a total of 3 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A Fully Local Last-Generated Rule in a Blockchain

    by Akira Sakurai, Kazuyuki Shudo

    An effective method for suppressing intentional forks in a blockchain is the last-generated rule, which selects the most recent chain as the main chain in the event of a chain tie. This rule helps invalidate blocks that are withheld by adversaries for a certain period. However, existing last-generated rules face an issue in that their application to the system is not fully localized. In conservative cryptocurrency systems such as Bitcoin, it is desirable for methods to be applied in a fully local manner. In this paper, we propose a locally applicable last-generated rule. Our method is straightforward and is based on a relative time reference. By conservatively setting the upper bound on the clock skew ΔOi to 54 s, we show through simulation experiments that our proposed method reduces the proportion γ of honest miners following the adversary during chain ties by more than 76% in Bitcoin compared to the existing local method, i.e., the random rule.

  • Open Access

    Model-Based Calculation Method of Mining Fairness in Blockchain

    by Akira Sakurai, Kazuyuki Shudo

    Mining fairness in blockchain refers to equality between the computational resources invested in mining and the block rewards received. There exists a dilemma wherein increasing the transaction processing capacity of a blockchain compromises mining fairness, thereby undermining its decentralization. This dilemma remains unresolved despite methods such as the greedy heaviest observed subtree (GHOST) protocol, indicating that mining fairness is an inherent bottleneck in the transaction processing capacity of the blockchain system. However, despite its significance, existing analyses neglect the impact of blockchain forks, resulting in imprecise evaluations and limited insights. To address this issue, we propose a method for calculating mining fairness that explicitly captures the influence of forks. First, we approximate a complex blockchain network using a simple mathematical model, assuming that no more than two blocks are generated per round. Within this model, we quantitatively determine local mining fairness and derive several measures of global mining fairness based on local mining fairness. Subsequently, we validated by blockchain network simulations that our calculation method computes mining fairness in networks much more accurately than existing methods. The proposed method facilitates a rigorous evaluation of trade-offs between scalability and decentralization by offering a clear, quantitative framework for measuring and comparing reward distribution among miners. Consequently, it is expected to provide valuable insights for future mining fairness research and the design of next-generation blockchain systems.


  • Open Access

    Tie-Breaking Rule Based on Partial Proof of Work in a Blockchain

    by Akira Sakurai, Kazuyuki Shudo

    In the area of blockchain, numerous methods have been proposed for suppressing intentional forks by attackers more effectively than the random rule. However, all of them, except for the random rule, require major updates such as hard forks or soft forks, rely on a trusted third party, or assume strong synchrony. Hence, it is challenging to apply these methods to existing systems such as Bitcoin. To address these issues, we propose another countermeasure that can be easily applied to existing proof of work blockchain systems. Our method is a tie-breaking rule that uses partial proof ofwork, which does not function as a block, as a time standard with finer granularity. By using the characteristic of partial proof of work, the proposed method enables miners to choose the last-generated block in a chain tie, which suppresses intentional forks by attackers. Only weak synchrony, which is already met by existing systems such as Bitcoin, is required for effective functioning. We evaluated the proposed method through detailed analyses that are lacking in existing works. In networks that adopt our method, the proportion of the attacker hashrate necessary for selfish mining was approximately 0.31479 or higher, which is remarkably close to the optimal value of 1/3, regardless of the block propagation capability of the attacker. Furthermore, we demonstrated through extended selfish mining that the impact of Match against pre-generated block, which is a concern in all last-generated rules, can be mitigated with appropriate parameter settings.


  • Open Access

    A Formulation of the Trilemma in Proof of Work Blockchain

    by Taishi Nakai, Akira Sakurai, Shiori Hironaka, Kazuyuki Shudo

    The blockchain trilemma, introduced in 2017 on a blog post authored by Vitalik Buterin, one of Ethereum’s co-founders, asserts that achieving decentralization, scalability, and security simultaneously within a blockchain is unattainable. While this concept has garnered empirical support through extensive analyses of blockchain performance, it remains unproven theoretically. In this study, we establish a formula representing the trilemma within a Proof of Work blockchain and validate it through theoretical and experimental analyses. Additionally, we explore the correlation between a formula term denoting decentralization and established decentralization indices, finding a strong correlation with the Herfindahl–Hirschman Index. Moreover, our analysis reveals that strategies to enhance trilemma properties within the trilemma’s constraints can be classified into two distinct categories. The first strategy is to reduce the block header or transaction size. The second strategy is to optimize the propagation time per byte between nodes.