k-Root-n: An Efficient Algorithm for Avoiding Short Term Double-Spending Alongside Distributed Ledger Technologies such as Blockchain

Round 1

Reviewer 1 Report

In this article, the author proposed an algorithm called 'k-root-n' that avoids double-spending in the short term. Combined with the primary algorithm that reaches the global ledger consensus, the k-root-n algorithm can reduce the lag time and improve efficiency. Though it is a probabilistic algorithm, the k-root-n algorithm is a possible approach and its method could inspire other researchers. In my opinion, this article is qualified to be published after adding some figures or modifying Figure 2 to describe the k-root-n algorithm more elaborately.

Author Response

Many thanks for taking the time to read my paper and for your thoughtful and encouraging feedback. I have added a new Figure 1 as you suggested to clarify the overall concept.  I have also re-edited the entire text for clarity. I hope you like this improved version.

Reviewer 2 Report

According to me the paper need further improvements and work in order to improve the quality of presentation and better illustrate the proposed contribution.

The paper presents an interesting topic but some issues should be addressed before the manuscript can be accepted for publication:

Abstract and the overall presentation and description should be improved in order to allow the reader to easily follow and understand the idea, approach and contribution It is not clear the contribution compared with the state of the art. Improved are required to clarify this aspects The aim is to introduce a scalable low-latency algorithm. It is not clear how to measure and evaluate scalability and low-latency of the proposed approach. How the results can support the approach ? 

Author Response

Thank you so much for taking the time to read my paper and provide thoughtful feedback!

Abstract and the overall presentation and description should be improved in order to allow the reader to easily follow and understand the idea, approach and contribution

I have added a new Figure 1 to help explain the overall concept. I have also edited the entire paper for clarity.  Hope this helps.

It is not clear the contribution compared with the state of the art.

I discuss the state of the art particularly in lines 41-52. Hopefully, I have clarified that no other approach to my knowledge provides security with O(√n) complexity without singling out more trusted nodes.

Improved are required to clarify this aspects The aim is to introduce a scalable low-latency algorithm. It is not clear how to measure and evaluate scalability and low-latency of the proposed approach. How the results can support the approach ? 

I illustrate the scalability of the algorithm in practical terms starting line 144. I discuss the complexity more formally in section 7 starting on line 426.

Sorry that you don't like my English.  I am actually British and write a lot in English, which is my mother tongue.  Anyway, I have had the paper professionally proofread, and hope you find the language acceptable now. 

Thanks again for your feedback and I hope you like this improved version.

Round 2

Reviewer 2 Report

The updated manuscript addresses the presented issues and according to me can be accepted for publication.