Analysis of Variance of Searching Time for Serial Concatenation of Graph-Clique based Cryptocurrency Mining

Cryptocurrency involves the search for a solution to a computationally difficult problem when conducting transactions. This is called mining, and by its nature, the time required for mining can vary significantly. This is undesirable from a security perspective. Existing research has proposed mining using graph cliques and methods for linking multiple mines with the aim of reducing the variance in mining time. In this study, we evaluated and implemented the possibility of further reducing the variance of mining time by combining the existing studies. The results showed that the combination of the two methods was more effective than conventional mining and existing research to achieve small variance.