SEI發布新的白皮書，描述了最新的Giga升級

SEI發布了一份新的白皮書，描述了最新的Giga升級。大多數讀者發現難以閱讀的深入技術內容的17頁。

The latest Giga upgrade from Sei is a significant step in advancing the capabilities of blockchain technology. This article, compiled by Felix, from PANews, provides a clear and concise summary of the main points discussed in Pavel Paramonov's, Founder of Hazeflow, article on the topic.

SEI的最新GIGA升級是提高區塊鏈技術能力的重要一步。本文由Felix撰寫，由Panews編寫，提供了有關Hazeflow的創始人Pavel Paramonov中討論的主要要點的清晰簡潔的摘要，有關該主題的文章。

The article highlights how Giga introduces asynchronous block generation, a multi-proposer model with Autobahn, and parallel execution to enhance performance at different levels.

本文強調了GIGA如何引入異步塊生成，這是一種具有Autobahn的多端播模型，並並行執行以提高不同級別的性能。

At the heart of Giga lies an interesting take on an idea. Usually, people think about a list of transactions. If we know the initial state of the chain and the transactions are applied in the same order by all honest nodes, they will come to the same final state.

Giga的核心是一個有趣的想法。通常，人們會考慮交易清單。如果我們知道鏈的初始狀態和交易是按照所有誠實節點以相同的順序應用的，那麼它們將達到相同的最終狀態。

In this case, the result depends only on the initial state and the order of transactions. This means that we only need to agree on the order of transactions in a block. Each node can independently compute the final state.

在這種情況下，結果僅取決於初始狀態和交易順序。這意味著我們只需要就塊中的交易順序達成共識。每個節點可以獨立計算最終狀態。

Now, an important detail is that execution and consensus (generation) are done in parallel. While a node is performing computations on one block, it is also receiving other blocks.

現在，一個重要的細節是並行執行和共識（生成）。當一個節點在一個塊上執行計算時，它也正在接收其他塊。

Thus, we can say that blocks are actually executed in total order (not in parallel) and the block generation process itself does happen in "parallel" with consensus. But for any given block, these processes are completely asynchronous.

因此，我們可以說，塊實際上是按總順序執行的（不是並行執行），並且塊生成過程本身確實在“並行”中進行了共識。但是對於任何給定的塊，這些過程都是完全不同步的。

Obviously, it seems impossible to perform consensus and execute the same block at the same time. Therefore, when executing block n, the node will receive block n+1 to proceed to the next step.

顯然，似乎不可能同時執行共識並執行相同的塊。因此，當執行塊n時，節點將接收塊n+1以繼續下一步。

If the consensus becomes skewed (e.g. 1/3 of the nodes in the network act maliciously), the chain will halt, similar to a standard BFT protocol.

如果共識變得偏斜（例如，網絡中的節點的1/3），鏈將停止，類似於標準的BFT協議。

Transactions that fail to execute within a block do not invalidate the block, but simply remain in a failed state, because generation and execution are separate, and the final state of the current block is committed in subsequent blocks.

無法在塊內執行的交易不會使塊無效，而只是保持在失敗狀態，因為發電和執行是分開的，並且當前塊的最終狀態在隨後的塊中實現。

How Is The Multi-Proposer Model Implemented and What Is Autobahn ?

如何實施多求和器模型，什麼是Autobahn？

The consensus protocol itself is called "Autobahn" (like the German Autobahn with no speed limit). Autobahn decouples data availability from transaction ordering, and it has an interesting model behind it.

共識協議本身稱為“ Autobahn”（就像沒有速度限制的德國自動賽車一樣）。 Autobahn將數據的可用性從交易訂購中分離出來，並且背後有一個有趣的模型。

Just like any lane on a highway, there are multiple lanes and each node has its own lane. Nodes use these lanes to make proposals about the ordering of transactions. A proposal is just an ordered collection of transactions.

就像高速公路上的任何車道一樣，有多個車道，每個節點都有自己的車道。節點使用這些車道來就交易的順序提出建議。提案只是有序的交易集。

Autobahn sometimes performs a "tipcut" operation, which aggregates multiple proposals to finalize the order of transactions.

Autobahn有時會執行“ Tipcut”操作，該操作匯總了多個建議以最終確定交易順序。

Proposers have an incentive to wait to publish blocks and publish a single block when possible, but the execution time limit for each block (similar to the gas limit) changes this dynamic slightly.

提議者有動力等待發布塊並在可能的情況下發佈單個塊，但是每個塊的執行時間限制（類似於氣體限制）稍微改變了這一動態。

A proposal on a channel is usually equivalent to one block, which means that when a tipcut occurs, multiple blocks will be cut off at the same time.

通道上的建議通常等效於一個塊，這意味著當發生小費時，將同時切斷多個塊。

After that, the leader of the slot sends the Tipcut to other nodes to complete the sorting. In fact, when a node votes on a single Tipcut, it is already preparing for the next Tipcut.

之後，插槽的負責人將小費發送到其他節點以完成分類。實際上，當節點對單個提示進行投票時，它已經為下一個提示做準備。

Nodes that missed batches can obtain them asynchronously from the validators listed in the PoA: this is the essence of why data availability is needed.

錯過批處理的節點可以從POA中列出的驗證器中獲得異步：這就是為什麼需要數據可用性的本質。

Under synchronous conditions, if the leader is correct, Autobahn completes the proposal confirmation in two rounds of communication. If the leader fails, the mechanism elects a new leader to maintain the progress.

在同步條件下，如果領導者正確，Autobahn將在兩輪溝通中完成建議確認。如果領導者失敗，該機制將選出一個新的領導者來維持進步。

The next tip-cut proposal can actually start during the commit phase of the current tip-cut, thus reducing latency since execution happens in parallel with generation.

下一個提示切割建議實際上可以在當前尖端切割的提交階段開始，從而降低了延遲，因為執行與生成並行。

In fact, the entire model is a multi-proposer model, where many nodes can make proposals for their block ordering at the same time. Each validator proposes its own blocks and receives proof (PoA) that the network owns these blocks, which helps improve the throughput and overall efficiency of the network.

實際上，整個模型是一個多求和器模型，許多節點可以同時為其塊排序提出建議。每個驗證者都提出了自己的塊，並收到了網絡擁有這些塊的證據（POA），這有助於提高網絡的吞吐量和整體效率。

Parallel Execution And Its Applicability

並行執行及其適用性

As mentioned, the block execution process and consensus happen in parallel, even though the blocks themselves are actually executed sequentially. You might be wondering if this constitutes true parallel execution.

如前所述，即使塊本身實際上是順序執行的，塊執行過程和共識並行進行。您可能想知道這是否構成真正的並行執行。

The answer is both yes and no.

答案既是肯定的又是。

Although blocks are executed one after the other, transactions within a block can be executed in parallel if the transactions do not modify (write to) the same state and the result of one transaction does not affect another transaction.

儘管塊是一個接一個地執行的，但是如果交易不修改（寫入）同一狀態，並且一個交易的結果不會影響另一筆交易，則可以並行執行一個塊內的事務。

In short, their execution paths should not depend on each other. Giga has no memory pool and transactions are included by nodes immediately.

簡而言之，他們的執行路徑不應彼此依賴。 GIGA沒有內存池，節點立即包含交易。

There may also be situations where there are high-frequency conflicts, in which case the system switches to processing transactions one at a time to ensure that transactions can move forward.

在某些情況下，存在高頻衝突，在這種情況下，系統一次切換到一個處理交易，以確保交易可以向前發展。

To put it simply, parallel execution distributes transactions across multiple cores, allowing transactions that do not interfere with each other to run simultaneously.

簡而言之，並行執行會在多個內核上分佈交易，從而允許交易不會互相干擾可以同時運行。

Storage Issues and Optimization

存儲問題和優化

Due to the large volume of transactions, data needs to be both secure and easily accessible, so its storage method should be slightly different from traditional blockchain storage. Giga stores data in

由於交易的數量很大，因此數據需要安全且易於訪問，因此其存儲方法應與傳統的區塊鏈存儲略有不同。 GIGA將數據存儲在