Telegram (AI) YouTube Facebook X
Ру
ZKsync Unveils Atlas Upgrade with 30,000 TPS

ZKsync Unveils Atlas Upgrade with 30,000 TPS

ZKsync introduces Atlas upgrade for ZK Stack, enhancing blockchain transition for companies.

The team behind the L2 solution ZKsync has introduced the Atlas upgrade for the ZK Stack. This update aims to accelerate and simplify the transition of companies and institutions to blockchain technology.

The feature includes a new high-performance sequencer with a throughput of 25,000 to 30,000 transactions per second. The upgrade is fully compatible with Ethereum-based applications.

Atlas also integrates a new proof system called Airbender, which provides transaction confirmations in less than a second and accelerates settlements between different blockchains.

According to developers from Matter Labs, these features will help organizations create systems that combine private control with compatibility with global markets. The upgrade is aimed at supporting payments, tokenized assets, and cross-border settlements.

Atlas will also expand opportunities for developers by supporting various types of virtual machines. This architecture ensures that the application code matches exactly what is verified on the network, enhancing reliability and transparency for businesses.

“ZKsync is the foundation for a new era of financial infrastructure. In it, companies can operate on-chain with the same sovereignty and flexibility as in their internal systems, but with the unbreakable guarantees provided by cryptography,” said Matter Labs CEO and co-founder Alex Gluchowski.

Back in April, security experts from the L2 network identified a compromise of an administrative account. Later, the ZKsync team reached an agreement with the hacker for the return of $5 million.

Подписывайтесь на ForkLog в социальных сетях

Telegram (основной канал) Facebook X
Нашли ошибку в тексте? Выделите ее и нажмите CTRL+ENTER

Рассылки ForkLog: держите руку на пульсе биткоин-индустрии!

We use cookies to improve the quality of our service.

By using this website, you agree to the Privacy policy.

OK