市值: $3.3687T -4.190%
成交额(24h): $171.1235B 4.910%
  • 市值: $3.3687T -4.190%
  • 成交额(24h): $171.1235B 4.910%
  • 恐惧与贪婪指数:
  • 市值: $3.3687T -4.190%
加密货币
话题
百科
资讯
加密话题
视频
热门新闻
加密货币
话题
百科
资讯
加密话题
视频
bitcoin
bitcoin

$107752.158786 USD

-3.13%

ethereum
ethereum

$2538.819788 USD

-6.33%

tether
tether

$1.000228 USD

0.02%

xrp
xrp

$2.327763 USD

-5.63%

bnb
bnb

$663.531188 USD

-3.73%

solana
solana

$174.740159 USD

-4.91%

usd-coin
usd-coin

$0.999844 USD

0.00%

dogecoin
dogecoin

$0.228146 USD

-9.29%

cardano
cardano

$0.753894 USD

-8.91%

tron
tron

$0.272649 USD

-0.60%

sui
sui

$3.647001 USD

-6.43%

hyperliquid
hyperliquid

$32.327324 USD

-8.84%

chainlink
chainlink

$15.639407 USD

-8.04%

avalanche
avalanche

$23.245911 USD

-9.67%

stellar
stellar

$0.289001 USD

-6.83%

加密货币新闻

SEI发布新的白皮书,描述了最新的Giga升级

2025/05/24 15:20

SEI发布了一份新的白皮书,描述了最新的Giga升级。大多数读者发现难以阅读的深入技术内容的17页。

SEI发布新的白皮书,描述了最新的Giga升级

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将数据存储在

免责声明:info@kdj.com

所提供的信息并非交易建议。根据本文提供的信息进行的任何投资,kdj.com不承担任何责任。加密货币具有高波动性,强烈建议您深入研究后,谨慎投资!

如您认为本网站上使用的内容侵犯了您的版权,请立即联系我们(info@kdj.com),我们将及时删除。

2025年05月24日 发表的其他文章