从 K-beauty 到 K-tech，韩国真的很会把体验感做成一种产业！ 既有很强的生活美学，又有很硬的科技产业。 比如海力士代表的半导体产业，是 AI 时代背后的基础设施，更不用提韩国的审美了，这里可是输送爱豆最多的地方～ 和本地朋友了解到，如果在海力士上班或者就业，在相亲市场非常受欢迎。 科技实力，原来也是一种硬通货！咱也要当科技新贵🤓 OKX 也是一样，大家看到的是产品入口，交易、Wallet、链上体验，但更深一层，是帮用户更快连接全球趋势，资产和机会，7x24H可交易～ 来韩国大家真的忍不住聊海力士啊，不约而同的打开咱们的APP，行情、公司、概况、动态、咨询、交易、策略…一目了然，在交易前了解更多信息，再去做判断🖤 一起玩真的好开心，爱你们～

📢 Monad 中文 Space ｜ Metropolis 全球黑客松参赛指南和 Idea 分析 本周四将举行一场中文官方 Twitter Space，由 Monad DevRel 拆解参赛规则、报名流程以及更适合在 Monad 上落地的 Idea 方向。 时间：9月10日 20:00（GMT+8） 主讲： @BoxMrChen｜DevRel @Monad Monad 官方为期六周的全球黑客松⸺Metropolis -超过 $250,000 美元奖池 -四大官方赛道 + 赞助方额外 bounty -六周开发期，10 月 13 日截止提交 -优秀团队有机会进入后续 residency 与生态支持 定好⏰，准时参加！ 欢迎华语开发者、创业者与社区伙伴一起上线提问、分享 Idea

GM Taibei

busy day 在无人问津的角落，monad上的meme正在暴涨

Category Labs is proud to introduce Cadence, our multiple-concurrent-proposers (MCP) consensus protocol that matches the optimal good-case latency of single-leader consensus while supporting arbitrarily short block intervals. When combined with BTX, our design for encrypted mempools, this represents a significant step towards solving the problem of MEV at the protocol level. In nearly every blockchain today, a single party ends up in control of each block: it decides which transactions get in, and can reorder them at will. MCP is the natural fix, but most recent designs pay for it with a separate aggregation phase, adding two extra communication rounds per block. Cadence makes the proposers part of consensus itself. Its fast path finalizes in an optimal three communication rounds, even when proposers are offline. Cadence also offers speculative finality, similar to MonadBFT, after just two rounds, revertible only if a proposer provably equivocated. In a simulation using estimated network delays between Monad mainnet's 200 globally distributed validators, finalization takes 219 ms on average, speculative finality 167 ms. Cadence pushes pipelining to the extreme: each block is proposed and finalized in its own independent consensus instance, without waiting on preceding blocks. The block interval then becomes a protocol parameter that can be arbitrarily small. At our initial target of 100 ms, a transaction waits on average just 50 ms to enter a proposal, and oracle prices, liquidations, and auctions can update every 100 ms. Cadence dynamically throttles the opening of new instances to bound the number of outstanding slots even during periods of network instability. When the network is healthy (under synchrony), a transaction included by an honest proposer can be neither dropped nor deferred (short-term censorship resistance), and no proposer can see the others' proposals in time to react (hiding). We prove both, together with safety and liveness under partial synchrony at the optimal 3f+1 fault bound. The Cadence protocol is modular: each module is simple on its own, and any of them can be swapped out without touching the rest. Cadence also builds on components already being deployed: proposals are disseminated as erasure-coded chunks over Deterministic RaptorCast, now rolling out on Monad, and validators vote on proposal digests, so voting does not wait for the full data to arrive. Start with the interactive tutorial: category.xyz/cadence. Full paper: arxiv.org/abs/2607.02275. Joint work by Kushal Babel, Fatima Elsheimy, Lioba Heimbach, Mohammad Mussadiq Jalalzai, Tobias Klenze, Jovan Komatovic, Jason Milionis, Mike Setrin, and Victor Shoup.

💡(4/5) COMMUNITY SKILLS - Meet Monad Hold M to meet @monad in one tap. Track live Monad stats, right at your fingertips. That’s the Agentic Keyboard @openacti1