Dijkstra vs Bellman-Ford — Two Ways to Compute Shortest Paths
Dijkstra and Bellman-Ford both relax edges to find shortest paths. They differ in negative weights, complexity, cycle detection and routing use.
2026, Oct 05 — 21 minute read
Dijkstra and Bellman-Ford both relax edges to find shortest paths. They differ in negative weights, complexity, cycle detection and routing use.
2026, Oct 05 — 21 minute read
How CCM (NIST SP 800-38C) combines CBC-MAC and counter mode under one AES key: B0 formatting, counter blocks, MAC length bounds and nonce rules.
2026, Oct 05 — 30 minute read
Which parts of the Zama protocol resist a quantum adversary and which do not: TFHE and the threshold MPC stand on lattices and information theory, ML-KEM already ships in production, and the gap is one pairing-based proof plus the host chain's signatures.
2026, Oct 02 — 15 minute read
Reading eprint 2023/815 against zama-ai/threshold-fhe: the Switch-n-Squash trick, the two-uniform flooding analysis, and six places where the Rust implementation and the paper do not say the same thing.
2026, Oct 02 — 15 minute read
Why a tokenised EU money market fund falls under the MMF Regulation, not MiCA, and how dealing price, gates, holder checks and the support ban apply to it.
2026, Oct 01 — 23 minute read
How Tendermint decides a block in propose, prevote and precommit steps, locks values for safety, and terminates through validValue and gossip.
2026, Oct 01 — 24 minute read
How EU LVNAV money market funds keep a stable price, how the 10 bp, 20 bp and 30 % rules behaved in 2020 and 2022, and what the 2023 and 2026 reviews concluded.
2026, Oct 01 — 21 minute read