THE LEDGER

Archive

186 RESULTS · PAGE 14 OF 16 · ONE LINE PER STORY, NUMBERED

PAGE 14
N°0299ZK TechLongfellow ZK Draft Defines a Parameter-Hash Contract for Identity ProofsGoogle’s August 12 Longfellow ZK Internet-Draft gives identity-protocol builders a clearer integration boundary: proofs are tied to explicit circuit parameters, field choices, transcripts, and circuit hashes. The opportunity is interoperability; the engineering risk is treating a draft format as a frozen standard.—2 MINN°0297Internet ComputerICP’s icp.net URL Change: Identity and Security ImplicationsICP’s move toward icp.net changes more than the address developers copy into documentation. It affects Internet Identity continuity, custom-domain setup, and the security assumptions around frontend assets.—2 MINN°0296RustRust 1.98 Adds Runtime Symbol and c_void FFI LintsRust 1.98 adds compiler lints for malformed core runtime symbols and misuse of c_void in return positions, giving low-level and FFI-heavy projects an earlier failure signal.—2 MINN°0295ZK TechRISC Zero zkVM sys_read Vulnerability: What Developers Must RebuildRISC Zero’s August 27 releases address a critical guest-memory vulnerability in `sys_read`. The proof system itself is unchanged, but developers must rebuild affected guests and refresh their image IDs.—2 MINN°0294Chain FusionSOL RPC v1.3.0 Fixes Solana getBlock Response Sizing on ICPThe latest tagged SOL RPC canister release fixes how getBlock handles response_size_estimate, a small change with practical consequences for ICP Chain Fusion developers working with Solana data.—1 MINN°0293RustRust Nightly Tests Splat for Safer C++ FFI Overload BindingsRust’s new nightly `splat` experiment targets a practical FFI problem: calling overloaded foreign functions without renaming every overload or wrapping arguments in tuples. Its real significance is interoperability maintenance, not a promise that ordinary Rust will soon gain C++-style overloading.—2 MINN°0292ZK TechOpenVM Pairing Bug Exposes a Critical ZK Proof-Soundness LessonA critical OpenVM advisory shows how an unchecked algebraic hint in a guest pairing library could make invalid pairing checks pass. For ZK developers, the lesson is broader than upgrading: every optimization that moves logic outside the circuit needs an explicit soundness argument.—2 MINN°0291Chain FusionChain Fusion Signing Costs Become an Availability BoundaryA fresh ICP developer discussion highlights a practical Chain Fusion risk: sponsored signing is also a shared availability dependency. The fix begins with explicit cycle budgets, allowance monitoring, and a clear separation between user authorization and native-chain settlement.—2 MINN°0290Internet ComputerMops v3 Pins the Motoko Toolchain and Changes ICP CIMops v3 makes Motoko projects pin their compiler and supporting tools, extends lockfile integrity to GitHub dependencies, and introduces an explicit --locked CI path. The upgrade improves reproducibility, but it also breaks dfx-based workflows.—2 MINN°0287Chain FusionSolana’s 350ms Slots Change the ICP Chain Fusion Design BudgetSolana’s August 24 move to 350-millisecond mainnet slots sharpens a known Chain Fusion constraint: ICP canisters must reach agreement across replicated HTTPS outcalls while Solana state changes rapidly.—2 MINN°0281ZK TechIBM’s GAPP Explained: A New Route to Cheaper ZK Proof AggregationIBM researchers presented GAPP at CRYPTO 2026, a generic framework for aggregating many polynomial-protocol instances into one compact proof. Its reported PLONK results point to a practical path for reducing prover overhead, while the work remains a research contribution rather than a production release.—2 MINN°0280Chain FusionICP MULTI/DEX Finding Exposes the 40B Instruction LimitA public evaluation of DFINITY’s MULTI/DEX prototype reports that its liquidation sweep can exceed ICP’s single-message instruction limit as the loan set grows. The finding turns a familiar Chain Fusion promise—autonomous, timer-driven cross-chain finance—into a concrete engineering question: can safety-critical maintenance work remain bounded and observable?—2 MIN