Byzantine is the liquidity infrastructure to simplify open participation in token economies.
Odaily News: Decentralized perpetual contract exchange Deepsigma has launched a real-time simulated trading platform covering 77 traditional financial markets, including U.S. stocks, stock indices, commodities, and U.S. Treasury yields. The platform is built on the Cypherium blockchain and is being advanced by a team of alumni from Goldman Sachs, Citadel Securities, Google, and Uber, supporting long and short exposure trading for the relevant assets.Deepsigma's perpetual contracts do not tokenize, custody, or physically deliver the underlying assets; instead, they track prices through external market data sources. The platform currently supports contracts on the S&P 500 Index, Dow Jones Industrial Average, Nasdaq Composite Index, Russell 2000 Index, Cboe Volatility Index, as well as crude oil, gold, silver, natural gas, and copper.The platform's risk engine employs multiple external price sources, mark prices, circuit breakers, partial liquidations, and an insurance fund, and uses a central limit order book and a clearing layer to handle margin, collateral, and settlement. Deepsigma is also developing a zero-knowledge proof-based decentralized identity framework and configuring off-chain AI analytics tools with unfunded execution permissions; the underlying Cypherium adopts a hybrid PoW and HotStuff Byzantine fault-tolerant consensus mechanism and holds 4 U.S. patents. (Bitcoin.com News)
Vitalik published an article titled “A Shallow Dive into Formal Verification,” introducing recent progress in applying formal verification to Ethereum’s cutting-edge research and development. The article states that developers can write code in Lean, EVM bytecode, or assembly language and verify its correctness via mathematically rigorous proofs that can be automatically checked—thereby improving both code efficiency and security. He notes that formal verification is especially suitable for complex yet well-defined-security systems such as STARKs, Byzantine Fault Tolerant (BFT) consensus, ZK-EVMs, and post-quantum signatures, and mentions related projects including Arklib, VCV-io, and evm-asm. The article also emphasizes that formal verification is not a panacea: it remains subject to limitations such as incorrect specification definitions, unverified code paths, hardware-level constraints, and side-channel attacks.
Odaily News: Decentralized perpetual contract exchange Deepsigma has launched a real-time simulated trading platform covering 77 traditional financial markets, including U.S. stocks, stock indices, commodities, and U.S. Treasury yields. The platform is built on the Cypherium blockchain and is being advanced by a team of alumni from Goldman Sachs, Citadel Securities, Google, and Uber, supporting long and short exposure trading for the relevant assets.Deepsigma's perpetual contracts do not tokenize, custody, or physically deliver the underlying assets; instead, they track prices through external market data sources. The platform currently supports contracts on the S&P 500 Index, Dow Jones Industrial Average, Nasdaq Composite Index, Russell 2000 Index, Cboe Volatility Index, as well as crude oil, gold, silver, natural gas, and copper.The platform's risk engine employs multiple external price sources, mark prices, circuit breakers, partial liquidations, and an insurance fund, and uses a central limit order book and a clearing layer to handle margin, collateral, and settlement. Deepsigma is also developing a zero-knowledge proof-based decentralized identity framework and configuring off-chain AI analytics tools with unfunded execution permissions; the underlying Cypherium adopts a hybrid PoW and HotStuff Byzantine fault-tolerant consensus mechanism and holds 4 U.S. patents. (Bitcoin.com News)
a16z Crypto published an article exploring the fundamental contradiction between blockchain “censorship resistance” and “low latency,” pointing out that any Byzantine Fault Tolerant (BFT) blockchain protocol with censorship resistance, where more than one-fifth of validators could be malicious, requires at least 5 rounds of communication for its optimal good-case latency, whereas traditional BFT consensus only requires a minimum of 3 rounds.The article notes that in traditional BFT protocols, the block proposer holds the power for both block construction and consensus progression, allowing them to censor by excluding specific transactions. This is also a major source of the MEV problem. To address this issue, Ethereum is researching FOCIL / EIP-7805, while Solana is exploring mechanisms like Constellation and MCP. The core idea behind these approaches is to have validators proactively collect "Inclusion Lists" of transactions that cannot be ignored before a block is formally proposed.a16z Crypto states that achieving censorship resistance requires two additional rounds of communication: first, user transactions must be broadcast to all validators, and then the validators need to confirm and write these into an inclusion list before the consensus process can begin. Therefore, in a partially synchronous network environment, there is no protocol design that can achieve both BFT and censorship resistance in just 4 rounds; 5 rounds represent the mathematical lower limit.The article emphasizes that while a censorship-resistant mechanism increases protocol latency, it can significantly reduce the "effective latency" users actually experience. In a system lacking censorship resistance, transactions may be indefinitely delayed due to validator censorship. Conversely, in a system with censorship resistance guarantees, transactions will be included in a block within a maximum of 5 rounds of communication, making transaction confirmation times more predictable.
Vitalik published an article titled “A Shallow Dive into Formal Verification,” introducing recent progress in applying formal verification to Ethereum’s cutting-edge research and development. The article states that developers can write code in Lean, EVM bytecode, or assembly language and verify its correctness via mathematically rigorous proofs that can be automatically checked—thereby improving both code efficiency and security. He notes that formal verification is especially suitable for complex yet well-defined-security systems such as STARKs, Byzantine Fault Tolerant (BFT) consensus, ZK-EVMs, and post-quantum signatures, and mentions related projects including Arklib, VCV-io, and evm-asm. The article also emphasizes that formal verification is not a panacea: it remains subject to limitations such as incorrect specification definitions, unverified code paths, hardware-level constraints, and side-channel attacks.