3 citations · 6 across the 10 of their papers we have counts for
10 papers
Near-Tight Theoretical Bounds for Incentive Compatibility in Bitcoin Mining
Akira Sakurai, Taishi Nakai, Kazuyuki Shudo
When is honest Bitcoin mining rational? This question is central to the incentive design of proof-of-work blockchains. Sapirshtein et al. computationally derived near-tight lower a…
On the Incentive Compatibility of Block Propagation in Bitcoin
Fumichika Maeda, Akira Sakurai, Taishi Nakai +1
Bitcoin is permissionless and does not rely on any central administrator, which gives it strong censorship resistance. At the same time, it is important to incentivize miners to be…
The Rich Get Richer in Bitcoin Mining Induced by Blockchain Forks
Akira Sakurai, Kazuyuki Shudo
Bitcoin is a representative decentralized currency system. For the security of Bitcoin, fairness in the distribution of mining rewards plays a crucial role in preventing the concen…
Comparing User Activity on X and Mastodon
Shiori Hironaka, Mitsuo Yoshida, Kazuyuki Shudo
The "Fediverse", a federation of decentralized social media servers, has emerged after a decade in which centralized platforms like X (formerly Twitter) have dominated the landscap…
FiberPool: Leveraging Multiple Blockchains for Decentralized Pooled Mining
Akira Sakurai, Kazuyuki Shudo
The security of blockchain systems based on Proof of Work relies on mining. However, mining suffers from unstable revenue, prompting many miners to form cooperative mining pools. M…
A Fully Local Last-Generated Rule in a Blockchain
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.…
Clustering Coefficient Reflecting Pairwise Relationships within Hyperedges
Rikuya Miyashita, Shiori Hironaka, Kazuyuki Shudo
Hypergraphs are generalizations of simple graphs that allow for the representation of complex group interactions beyond pairwise relationships. Clustering coefficients quantify loc…
Estimation of Graph Features Based on Random Walks Using Neighbors' Properties
Tsuyoshi Hasegawa, Shiori Hironaka, Kazuyuki Shudo
Using random walks for sampling has proven advantageous in assessing the characteristics of large and unknown social networks. Several algorithms based on random walks have been in…
Model-Based Calculation Method of Mining Fairness in Blockchain
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 th…
Tie-Breaking Rule Based on Partial Proof of Work in a Blockchain
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 fo…