Merge pull request #116 from gosh-sh/acki_nacki_8

fixed Abstract and Introduction

docs/acki-nacki/overview.md

@@ -4,13 +4,13 @@
 
 ## **Abstract**
 
-**We introduce an efficient asynchronous proof-of-stake protocol that ensures rapid finality and high throughput via parallel processing.** This protocol exceeds the Byzantine fault tolerance of existing systems like Nakamoto and BFT models by implementing a probabilistic approach that requires **only two communication steps** for consensus and maintains subquadratic message complexity. Despite trading deterministic consensus for probabilistic methods, we argue that the effective use of randomness and socio-economic principles in our blockchain design eliminates any significant compromise. Our protocol distinguishes itself by using a **consensus committee, randomly selected for each block**, to verify executions, while a deterministic Leader facilitates block propagation, optimizing both security and efficiency.
+We propose an **asynchronous, highly effective proof-of-stake protocol optimized for fast finality, while allowing for high throughputs via execution parallelization.** It is a probabilistic protocol that achieves higher Byzantine fault tolerance than Nakamoto, BFT (including Hotstuff and AptosBFT), Solana, and other modern consensus protocols. **Our protocol reaches consensus in two communication steps** and has a total number of messages that are subquadratic to the number of nodes, with probabilistic, dynamically adjusted safety guarantees. We trade off deterministic consensus with theoretical constraints on message complexity and the number of Byzantine agreements, with probabilistic algorithms overtaking these boundaries. We further claim that because of the use of randomness and socioeconomics in blockchain designs, no real trade-off is actually present. One of the key ingredients of our approach is **separating the verification of execution by a consensus committee from the attestation of block propagation by network participants**. Our **consensus committee is randomly selected for each block** and is not predetermined, while the Leader is deterministic.
 
 ### **Introduction**
 
-Public blockchains primarily serve financial uses, such as value storage, transfer, and decentralized finance, with users accepting transaction fees. However, mass adoption is hindered by their inability to support the user experience expected from contemporary software, including free transactions for freemium models and slow user interfaces due to block finalization delays. These inefficiencies stem from inherent performance limitations in transaction throughput and finality times, required for stringent state validation. Private blockchains also struggle in enterprise settings due to their complex maintenance and high computational costs.
+Current public blockchains are almost exclusively used for financial applications, be it for the store and transfer of value or decentralized finance. Users are ready to pay gas and transaction fees when transacting in value. The primary reason for this user experience inefficiency is the inherent lack of performance in both transaction execution throughput and time to finality, due to strict requirements on state validation. 
 
-We introduce an efficient, scalable blockchain protocol designed for extensive parallel processing and rapid finality, aiming to match cluster cloud databases' performance without sacrificing security. This paper is structured as follows: a background and literature review, a detailed description of our protocol, an analysis of its security and efficiency, concluding with our findings.
+We present a highly efficient, scalable, and practical blockchain protocol optimized for heavy parallelization and extremely fast finality times. **The goal of the protocol is to produce performance comparable to cluster cloud databases without compromising security.**
 
 ## **Background**
 

site/acki-nacki/overview/index.html

@@ -1814,10 +1814,10 @@ <h1>Overview</h1>
 <p><img alt="" src="../../images/acki_nacki_2.jpg" /></p>
 <p><strong><em>watch the event</em></strong> <a href="https://www.ackinacki.com/" target="_blank"><strong>here</strong></a></p>
 <h2 id="abstract"><strong>Abstract</strong></h2>
-<p><strong>We introduce an efficient asynchronous proof-of-stake protocol that ensures rapid finality and high throughput via parallel processing.</strong> This protocol exceeds the Byzantine fault tolerance of existing systems like Nakamoto and BFT models by implementing a probabilistic approach that requires <strong>only two communication steps</strong> for consensus and maintains subquadratic message complexity. Despite trading deterministic consensus for probabilistic methods, we argue that the effective use of randomness and socio-economic principles in our blockchain design eliminates any significant compromise. Our protocol distinguishes itself by using a <strong>consensus committee, randomly selected for each block</strong>, to verify executions, while a deterministic Leader facilitates block propagation, optimizing both security and efficiency.</p>
+<p>We propose an <strong>asynchronous, highly effective proof-of-stake protocol optimized for fast finality, while allowing for high throughputs via execution parallelization.</strong> It is a probabilistic protocol that achieves higher Byzantine fault tolerance than Nakamoto, BFT (including Hotstuff and AptosBFT), Solana, and other modern consensus protocols. <strong>Our protocol reaches consensus in two communication steps</strong> and has a total number of messages that are subquadratic to the number of nodes, with probabilistic, dynamically adjusted safety guarantees. We trade off deterministic consensus with theoretical constraints on message complexity and the number of Byzantine agreements, with probabilistic algorithms overtaking these boundaries. We further claim that because of the use of randomness and socioeconomics in blockchain designs, no real trade-off is actually present. One of the key ingredients of our approach is <strong>separating the verification of execution by a consensus committee from the attestation of block propagation by network participants</strong>. Our <strong>consensus committee is randomly selected for each block</strong> and is not predetermined, while the Leader is deterministic.</p>
 <h3 id="introduction"><strong>Introduction</strong></h3>
-<p>Public blockchains primarily serve financial uses, such as value storage, transfer, and decentralized finance, with users accepting transaction fees. However, mass adoption is hindered by their inability to support the user experience expected from contemporary software, including free transactions for freemium models and slow user interfaces due to block finalization delays. These inefficiencies stem from inherent performance limitations in transaction throughput and finality times, required for stringent state validation. Private blockchains also struggle in enterprise settings due to their complex maintenance and high computational costs.</p>
-<p>We introduce an efficient, scalable blockchain protocol designed for extensive parallel processing and rapid finality, aiming to match cluster cloud databases' performance without sacrificing security. This paper is structured as follows: a background and literature review, a detailed description of our protocol, an analysis of its security and efficiency, concluding with our findings.</p>
+<p>Current public blockchains are almost exclusively used for financial applications, be it for the store and transfer of value or decentralized finance. Users are ready to pay gas and transaction fees when transacting in value. The primary reason for this user experience inefficiency is the inherent lack of performance in both transaction execution throughput and time to finality, due to strict requirements on state validation. </p>
+<p>We present a highly efficient, scalable, and practical blockchain protocol optimized for heavy parallelization and extremely fast finality times. <strong>The goal of the protocol is to produce performance comparable to cluster cloud databases without compromising security.</strong></p>
 <h2 id="background"><strong>Background</strong></h2>
 <p>Consensus protocols in computer science are categorized into probabilistic and deterministic. Since 1978, deterministic protocols have evolved, leading to pBFT's creation for varied applications without addressing decentralized money's double spending challenge.</p>
 <h3 id="bitcoin"><strong>Bitcoin</strong></h3>