Selectively Disabling HTTP/1.0 and HTTP/1.1
https://www.reddit.com/r/programming/comments/1qp7yqj/selectively_disabling_http10_and_http11/
submitted by /u/self (https://www.reddit.com/user/self)
[link] (https://markmcb.com/web/selectively_disabling_http_1/) [comments] (https://www.reddit.com/r/programming/comments/1qp7yqj/selectively_disabling_http10_and_http11/)
https://www.reddit.com/r/programming/comments/1qp7yqj/selectively_disabling_http10_and_http11/
submitted by /u/self (https://www.reddit.com/user/self)
[link] (https://markmcb.com/web/selectively_disabling_http_1/) [comments] (https://www.reddit.com/r/programming/comments/1qp7yqj/selectively_disabling_http10_and_http11/)
Cloudflare claimed they implemented Matrix on Cloudflare workers. They didn't
https://www.reddit.com/r/programming/comments/1qp836e/cloudflare_claimed_they_implemented_matrix_on/
submitted by /u/f311a (https://www.reddit.com/user/f311a)
[link] (https://tech.lgbt/@JadedBlueEyes/115967791152135761) [comments] (https://www.reddit.com/r/programming/comments/1qp836e/cloudflare_claimed_they_implemented_matrix_on/)
https://www.reddit.com/r/programming/comments/1qp836e/cloudflare_claimed_they_implemented_matrix_on/
submitted by /u/f311a (https://www.reddit.com/user/f311a)
[link] (https://tech.lgbt/@JadedBlueEyes/115967791152135761) [comments] (https://www.reddit.com/r/programming/comments/1qp836e/cloudflare_claimed_they_implemented_matrix_on/)
Agentic Memory Poisoning: How Long-Term AI Context Can Be Weaponized
https://www.reddit.com/r/programming/comments/1qp94gs/agentic_memory_poisoning_how_longterm_ai_context/
submitted by /u/JadeLuxe (https://www.reddit.com/user/JadeLuxe)
[link] (https://instatunnel.my/blog/agentic-memory-poisoning-how-long-term-ai-context-can-be-weaponized) [comments] (https://www.reddit.com/r/programming/comments/1qp94gs/agentic_memory_poisoning_how_longterm_ai_context/)
https://www.reddit.com/r/programming/comments/1qp94gs/agentic_memory_poisoning_how_longterm_ai_context/
submitted by /u/JadeLuxe (https://www.reddit.com/user/JadeLuxe)
[link] (https://instatunnel.my/blog/agentic-memory-poisoning-how-long-term-ai-context-can-be-weaponized) [comments] (https://www.reddit.com/r/programming/comments/1qp94gs/agentic_memory_poisoning_how_longterm_ai_context/)
Whatsapp rewrote its media handler to rust (160k c++ to 90k rust)
https://www.reddit.com/r/programming/comments/1qpdiio/whatsapp_rewrote_its_media_handler_to_rust_160k_c/
submitted by /u/NYPuppy (https://www.reddit.com/user/NYPuppy)
[link] (https://engineering.fb.com/2026/01/27/security/rust-at-scale-security-whatsapp/) [comments] (https://www.reddit.com/r/programming/comments/1qpdiio/whatsapp_rewrote_its_media_handler_to_rust_160k_c/)
https://www.reddit.com/r/programming/comments/1qpdiio/whatsapp_rewrote_its_media_handler_to_rust_160k_c/
submitted by /u/NYPuppy (https://www.reddit.com/user/NYPuppy)
[link] (https://engineering.fb.com/2026/01/27/security/rust-at-scale-security-whatsapp/) [comments] (https://www.reddit.com/r/programming/comments/1qpdiio/whatsapp_rewrote_its_media_handler_to_rust_160k_c/)
Microsoft forced me to switch to Linux
https://www.reddit.com/r/programming/comments/1qpfz0l/microsoft_forced_me_to_switch_to_linux/
submitted by /u/Dear-Economics-315 (https://www.reddit.com/user/Dear-Economics-315)
[link] (https://www.himthe.dev/blog/microsoft-to-linux) [comments] (https://www.reddit.com/r/programming/comments/1qpfz0l/microsoft_forced_me_to_switch_to_linux/)
https://www.reddit.com/r/programming/comments/1qpfz0l/microsoft_forced_me_to_switch_to_linux/
submitted by /u/Dear-Economics-315 (https://www.reddit.com/user/Dear-Economics-315)
[link] (https://www.himthe.dev/blog/microsoft-to-linux) [comments] (https://www.reddit.com/r/programming/comments/1qpfz0l/microsoft_forced_me_to_switch_to_linux/)
Simple analogy to understand forward proxy vs reverse proxy
https://www.reddit.com/r/programming/comments/1qpg40g/simple_analogy_to_understand_forward_proxy_vs/
submitted by /u/Comfortable-Fan-580 (https://www.reddit.com/user/Comfortable-Fan-580)
[link] (https://pradyumnachippigiri.substack.com/p/client-side-proxy-vs-server-side) [comments] (https://www.reddit.com/r/programming/comments/1qpg40g/simple_analogy_to_understand_forward_proxy_vs/)
https://www.reddit.com/r/programming/comments/1qpg40g/simple_analogy_to_understand_forward_proxy_vs/
submitted by /u/Comfortable-Fan-580 (https://www.reddit.com/user/Comfortable-Fan-580)
[link] (https://pradyumnachippigiri.substack.com/p/client-side-proxy-vs-server-side) [comments] (https://www.reddit.com/r/programming/comments/1qpg40g/simple_analogy_to_understand_forward_proxy_vs/)
Walkthrough of X's algorithm that decides what you see
https://www.reddit.com/r/programming/comments/1qpharr/walkthrough_of_xs_algorithm_that_decides_what_you/
<!-- SC_OFF -->X open-sourced the algorithm behind the For You feed on January 20th (https://github.com/xai-org/x-algorithm). Candidate Retrieval Two sources feed the pipeline: Thunder: an in-memory service holding the last 48 hours of tweets in a DashMap (concurrent HashMap), indexed by author. It serves in-network posts from accounts you follow via gRPC. Phoenix: a two-tower neural network for discovery. User tower is a Grok transformer with mean pooling. Candidate tower is a 2-layer MLP with SiLU. Both L2-normalize, so retrieval is just a dot product over precomputed corpus embeddings. Scoring Phoenix scores all candidates in a single transformer forward pass, predicting 18 engagement probabilities per post - like, reply, retweet, share, block, mute, report, dwell, video completion, etc. To batch efficiently without candidates influencing each other's scores, they use a custom attention mask. Each candidate attends to the user context and itself, but cross-candidate attention is zeroed out. A WeightedScorer combines the 18 predictions into one number. Positive signals (likes, replies, shares) add to the score. Negative signals (blocks, mutes, reports) subtract. Then two adjustments: Author diversity - exponential decay so one author can't dominate your feed. A floor parameter (e.g. 0.3) ensures later posts still have some weight. Out-of-network penalty 0 posts from unfollowed accounts are multiplied by a weight (e.g. 0.7). Filtering 10 pre-filters run before scoring (dedup, age limit, muted keywords, block lists, previously seen posts via Bloom filter). After scoring, a visibility filter queries an external safety service and a conversation dedup filter keeps only the highest-scored post per thread. <!-- SC_ON --> submitted by /u/noninertialframe96 (https://www.reddit.com/user/noninertialframe96)
[link] (https://codepointer.substack.com/p/x-algorithm-how-x-decides-what-550) [comments] (https://www.reddit.com/r/programming/comments/1qpharr/walkthrough_of_xs_algorithm_that_decides_what_you/)
https://www.reddit.com/r/programming/comments/1qpharr/walkthrough_of_xs_algorithm_that_decides_what_you/
<!-- SC_OFF -->X open-sourced the algorithm behind the For You feed on January 20th (https://github.com/xai-org/x-algorithm). Candidate Retrieval Two sources feed the pipeline: Thunder: an in-memory service holding the last 48 hours of tweets in a DashMap (concurrent HashMap), indexed by author. It serves in-network posts from accounts you follow via gRPC. Phoenix: a two-tower neural network for discovery. User tower is a Grok transformer with mean pooling. Candidate tower is a 2-layer MLP with SiLU. Both L2-normalize, so retrieval is just a dot product over precomputed corpus embeddings. Scoring Phoenix scores all candidates in a single transformer forward pass, predicting 18 engagement probabilities per post - like, reply, retweet, share, block, mute, report, dwell, video completion, etc. To batch efficiently without candidates influencing each other's scores, they use a custom attention mask. Each candidate attends to the user context and itself, but cross-candidate attention is zeroed out. A WeightedScorer combines the 18 predictions into one number. Positive signals (likes, replies, shares) add to the score. Negative signals (blocks, mutes, reports) subtract. Then two adjustments: Author diversity - exponential decay so one author can't dominate your feed. A floor parameter (e.g. 0.3) ensures later posts still have some weight. Out-of-network penalty 0 posts from unfollowed accounts are multiplied by a weight (e.g. 0.7). Filtering 10 pre-filters run before scoring (dedup, age limit, muted keywords, block lists, previously seen posts via Bloom filter). After scoring, a visibility filter queries an external safety service and a conversation dedup filter keeps only the highest-scored post per thread. <!-- SC_ON --> submitted by /u/noninertialframe96 (https://www.reddit.com/user/noninertialframe96)
[link] (https://codepointer.substack.com/p/x-algorithm-how-x-decides-what-550) [comments] (https://www.reddit.com/r/programming/comments/1qpharr/walkthrough_of_xs_algorithm_that_decides_what_you/)
[Video] Code Comments - Cain On Games
https://www.reddit.com/r/programming/comments/1qpi3ut/video_code_comments_cain_on_games/
submitted by /u/levodelellis (https://www.reddit.com/user/levodelellis)
[link] (https://www.youtube.com/watch?v=GYp00o-sewY) [comments] (https://www.reddit.com/r/programming/comments/1qpi3ut/video_code_comments_cain_on_games/)
https://www.reddit.com/r/programming/comments/1qpi3ut/video_code_comments_cain_on_games/
submitted by /u/levodelellis (https://www.reddit.com/user/levodelellis)
[link] (https://www.youtube.com/watch?v=GYp00o-sewY) [comments] (https://www.reddit.com/r/programming/comments/1qpi3ut/video_code_comments_cain_on_games/)
Locale-sensitive text handling (minimal reproducible example)
https://www.reddit.com/r/programming/comments/1qpjaj5/localesensitive_text_handling_minimal/
<!-- SC_OFF -->Text handling must not depend on the system locale unless explicitly intended. Some APIs silently change behavior based on system language. This causes unintended results. Minimal reproducible example under Turkish locale: "FILE".ToLower() == "fıle" Reverse casing example: "file".ToUpper() == "FİLE" This artifact exists to help developers detect locale-sensitive failures early. Use as reference or for testing. (You may download the .txt version of this post from the given link) <!-- SC_ON --> submitted by /u/BoloFan05 (https://www.reddit.com/user/BoloFan05)
[link] (https://drive.google.com/file/d/1Rgyxfzmw-rfchVi2oShJHHQ8YpMUqlgT/view?usp=sharing) [comments] (https://www.reddit.com/r/programming/comments/1qpjaj5/localesensitive_text_handling_minimal/)
https://www.reddit.com/r/programming/comments/1qpjaj5/localesensitive_text_handling_minimal/
<!-- SC_OFF -->Text handling must not depend on the system locale unless explicitly intended. Some APIs silently change behavior based on system language. This causes unintended results. Minimal reproducible example under Turkish locale: "FILE".ToLower() == "fıle" Reverse casing example: "file".ToUpper() == "FİLE" This artifact exists to help developers detect locale-sensitive failures early. Use as reference or for testing. (You may download the .txt version of this post from the given link) <!-- SC_ON --> submitted by /u/BoloFan05 (https://www.reddit.com/user/BoloFan05)
[link] (https://drive.google.com/file/d/1Rgyxfzmw-rfchVi2oShJHHQ8YpMUqlgT/view?usp=sharing) [comments] (https://www.reddit.com/r/programming/comments/1qpjaj5/localesensitive_text_handling_minimal/)
We analyzed 6 real-world frameworks across 6 languages — here’s what coupling, cycles, and dependency structure look like at scale
https://www.reddit.com/r/programming/comments/1qpkt35/we_analyzed_6_realworld_frameworks_across_6/
<!-- SC_OFF -->We recently ran a structural dependency analysis on six production open-source frameworks, each written in a different language: Tokio (Rust) Fastify (JavaScript) Flask (Python) Prometheus (Go) Gson (Java) Supermemory (TypeScript) The goal was to look at structural characteristics using actual dependency data, rather than intuition or anecdote. Specifically, we measured: Dependency coupling Circular dependency patterns File count and SLOC Class and function density All results are from directly from the current GitHub main repository commits as of this week. The data at a glance Framework Language Files SLOC Classes Functions Coupling Cycles Tokio Rust 763 92k 759 2,490 1.3 0 Fastify JavaScript 277 70k 5 254 1.2 3 Flask Python 83 10k 69 520 2.1 1 Prometheus Go 400 73k 1,365 6,522 3.3 0 Gson Java 261 36k 743 2,820 3.8 10 Supermemory TypeScript 453 77k 49 917 4.3 0 Notes “Classes” in Go reflect structs/types; in Rust they reflect impl/type-level constructs. Coupling is measured as average dependency fan-out per parsed file. Full raw outputs are published for independent inspection (link below). Key takeaways from this set: 1. Size does not equal structural complexity Tokio (Rust) was the largest codebase analyzed (~92k SLOC across 763 files), yet it maintained: Very low coupling (1.3) Clear and consistent dependency direction This challenges the assumption that large systems inevitably degrade into tightly coupled “balls of mud.” 2. Cycles tend to cluster, rather than spread Where circular dependencies appeared, they were highly localized, typically involving a small group of closely related files rather than spanning large portions of the graph. Examples: Flask (Python) showed a single detected cycle confined to a narrow integration boundary. Gson (Java) exhibited multiple cycles, but these clustered around generic adapters and shared utility layers. No project showed evidence of cycles propagating broadly across architectural layers. This suggests that in well-structured systems, cycles — when they exist — tend to be contained, limiting their blast radius and cognitive overhead, even if edge-case cycles exist outside static analysis coverage. 3. Language-specific structural patterns emerge Some consistent trends showed up: Java (Gson)
Higher coupling and more cycles, driven largely by generic type adapters and deeper inheritance hierarchies
(743 classes and 2,820 functions across 261 files). Go (Prometheus)
Clean dependency directionality overall, with complexity concentrated in core orchestration and service layers.
High function density without widespread structural entanglement. TypeScript (Supermemory)
Higher coupling reflects coordination overhead in a large SDK-style architecture — notably without broad cycle propagation. 4. Class and function density explain where complexity lives Scale metrics describe how much code exists, but class and function density reveal how responsibility and coordination are structured. For example: Gson’s higher coupling aligns with its class density and reliance on generic coordination layers. Tokio’s low coupling holds despite its size, aligning with Rust’s crate-centric approach to enforcing explicit module boundaries. Smaller repositories can still accumulate disproportionate structural complexity when dependency direction isn’t actively constrained. Why we did this When onboarding to a large, unfamiliar repository or planning a refactor, lines of code alone are a noisy signal, and mental models, tribal knowledge, and architectural documentation often lag behind reality. Structural indicators like: Dependency fan-in / fan-out Coupling density Cycle concentration tend to correlate more directly with the effort
https://www.reddit.com/r/programming/comments/1qpkt35/we_analyzed_6_realworld_frameworks_across_6/
<!-- SC_OFF -->We recently ran a structural dependency analysis on six production open-source frameworks, each written in a different language: Tokio (Rust) Fastify (JavaScript) Flask (Python) Prometheus (Go) Gson (Java) Supermemory (TypeScript) The goal was to look at structural characteristics using actual dependency data, rather than intuition or anecdote. Specifically, we measured: Dependency coupling Circular dependency patterns File count and SLOC Class and function density All results are from directly from the current GitHub main repository commits as of this week. The data at a glance Framework Language Files SLOC Classes Functions Coupling Cycles Tokio Rust 763 92k 759 2,490 1.3 0 Fastify JavaScript 277 70k 5 254 1.2 3 Flask Python 83 10k 69 520 2.1 1 Prometheus Go 400 73k 1,365 6,522 3.3 0 Gson Java 261 36k 743 2,820 3.8 10 Supermemory TypeScript 453 77k 49 917 4.3 0 Notes “Classes” in Go reflect structs/types; in Rust they reflect impl/type-level constructs. Coupling is measured as average dependency fan-out per parsed file. Full raw outputs are published for independent inspection (link below). Key takeaways from this set: 1. Size does not equal structural complexity Tokio (Rust) was the largest codebase analyzed (~92k SLOC across 763 files), yet it maintained: Very low coupling (1.3) Clear and consistent dependency direction This challenges the assumption that large systems inevitably degrade into tightly coupled “balls of mud.” 2. Cycles tend to cluster, rather than spread Where circular dependencies appeared, they were highly localized, typically involving a small group of closely related files rather than spanning large portions of the graph. Examples: Flask (Python) showed a single detected cycle confined to a narrow integration boundary. Gson (Java) exhibited multiple cycles, but these clustered around generic adapters and shared utility layers. No project showed evidence of cycles propagating broadly across architectural layers. This suggests that in well-structured systems, cycles — when they exist — tend to be contained, limiting their blast radius and cognitive overhead, even if edge-case cycles exist outside static analysis coverage. 3. Language-specific structural patterns emerge Some consistent trends showed up: Java (Gson)
Higher coupling and more cycles, driven largely by generic type adapters and deeper inheritance hierarchies
(743 classes and 2,820 functions across 261 files). Go (Prometheus)
Clean dependency directionality overall, with complexity concentrated in core orchestration and service layers.
High function density without widespread structural entanglement. TypeScript (Supermemory)
Higher coupling reflects coordination overhead in a large SDK-style architecture — notably without broad cycle propagation. 4. Class and function density explain where complexity lives Scale metrics describe how much code exists, but class and function density reveal how responsibility and coordination are structured. For example: Gson’s higher coupling aligns with its class density and reliance on generic coordination layers. Tokio’s low coupling holds despite its size, aligning with Rust’s crate-centric approach to enforcing explicit module boundaries. Smaller repositories can still accumulate disproportionate structural complexity when dependency direction isn’t actively constrained. Why we did this When onboarding to a large, unfamiliar repository or planning a refactor, lines of code alone are a noisy signal, and mental models, tribal knowledge, and architectural documentation often lag behind reality. Structural indicators like: Dependency fan-in / fan-out Coupling density Cycle concentration tend to correlate more directly with the effort
required to reason about, change, and safely extend a system. We’ve published the complete raw analysis outputs in the provided link: The outputs are static JSON artifacts (dependency graphs, metrics, and summaries) served directly by the public frontend. If this kind of structural information would be useful for a specific open-source repository, feel free to share a GitHub link. I’m happy to run the same analysis and provide the resulting static JSON (both readable and compressed) as a commit to the repo, if that is acceptable. Would love to hear how others approach this type of assessment in practice or what you might think of the analysis outputs. <!-- SC_ON --> submitted by /u/BaseDue9532 (https://www.reddit.com/user/BaseDue9532)
[link] (https://pvizgenerator.com/test-cases) [comments] (https://www.reddit.com/r/programming/comments/1qpkt35/we_analyzed_6_realworld_frameworks_across_6/)
[link] (https://pvizgenerator.com/test-cases) [comments] (https://www.reddit.com/r/programming/comments/1qpkt35/we_analyzed_6_realworld_frameworks_across_6/)
Shrinking a language detection model to under 10 KB
https://www.reddit.com/r/programming/comments/1qpoyqh/shrinking_a_language_detection_model_to_under_10/
submitted by /u/bubble_boi (https://www.reddit.com/user/bubble_boi)
[link] (https://david-gilbertson.medium.com/shrinking-a-language-detection-model-to-under-10-kb-b729bc25fd28?sk=0272ee69728b2cb9cd29218b411995d7) [comments] (https://www.reddit.com/r/programming/comments/1qpoyqh/shrinking_a_language_detection_model_to_under_10/)
https://www.reddit.com/r/programming/comments/1qpoyqh/shrinking_a_language_detection_model_to_under_10/
submitted by /u/bubble_boi (https://www.reddit.com/user/bubble_boi)
[link] (https://david-gilbertson.medium.com/shrinking-a-language-detection-model-to-under-10-kb-b729bc25fd28?sk=0272ee69728b2cb9cd29218b411995d7) [comments] (https://www.reddit.com/r/programming/comments/1qpoyqh/shrinking_a_language_detection_model_to_under_10/)
After two years of vibecoding, I'm back to writing by hand
https://www.reddit.com/r/programming/comments/1qpp9vp/after_two_years_of_vibecoding_im_back_to_writing/
submitted by /u/waozen (https://www.reddit.com/user/waozen)
[link] (https://atmoio.substack.com/p/after-two-years-of-vibecoding-im) [comments] (https://www.reddit.com/r/programming/comments/1qpp9vp/after_two_years_of_vibecoding_im_back_to_writing/)
https://www.reddit.com/r/programming/comments/1qpp9vp/after_two_years_of_vibecoding_im_back_to_writing/
submitted by /u/waozen (https://www.reddit.com/user/waozen)
[link] (https://atmoio.substack.com/p/after-two-years-of-vibecoding-im) [comments] (https://www.reddit.com/r/programming/comments/1qpp9vp/after_two_years_of_vibecoding_im_back_to_writing/)
Cache is king, a roadmap
https://www.reddit.com/r/programming/comments/1qps2yb/cache_is_king_a_roadmap/
submitted by /u/ReverseBlade (https://www.reddit.com/user/ReverseBlade)
[link] (https://nemorize.com/roadmaps/cache-is-king) [comments] (https://www.reddit.com/r/programming/comments/1qps2yb/cache_is_king_a_roadmap/)
https://www.reddit.com/r/programming/comments/1qps2yb/cache_is_king_a_roadmap/
submitted by /u/ReverseBlade (https://www.reddit.com/user/ReverseBlade)
[link] (https://nemorize.com/roadmaps/cache-is-king) [comments] (https://www.reddit.com/r/programming/comments/1qps2yb/cache_is_king_a_roadmap/)
AT&T Had iTunes in 1998. Here's Why They Killed It. (Companion to "The Other Father of MP3"
https://www.reddit.com/r/programming/comments/1qpsw4m/att_had_itunes_in_1998_heres_why_they_killed_it/
<!-- SC_OFF -->Recently I posted "The Other Father of MP3" about James Johnston, the Bell Labs engineer whose contributions to perceptual audio coding were written out of history. Several commenters asked what happened on the business side; how AT&T managed to have the technology that became iTunes and still lose. This is that story. Howie Singer and Larry Miller built a2b Music inside AT&T using Johnston's AAC codec. They had label deals, a working download service, and a portable player three years before the iPod. They tried to spin it out. AT&T killed the spin-out in May 1999. Two weeks later, Napster launched. Based on interviews with Singer (now teaching at NYU, formerly Chief of Strategic Technology at Warner Music for 10 years) and Miller (inaugural director of the Sony Audio Institute at NYU). The tech was ready. The market wasn't. And the permission culture of a century-old telephone monopoly couldn't move at internet speed. <!-- SC_ON --> submitted by /u/Traditional_Rise_609 (https://www.reddit.com/user/Traditional_Rise_609)
[link] (https://roguesgalleryprog.substack.com/p/the-a2b-spin-out-that-never-happened) [comments] (https://www.reddit.com/r/programming/comments/1qpsw4m/att_had_itunes_in_1998_heres_why_they_killed_it/)
https://www.reddit.com/r/programming/comments/1qpsw4m/att_had_itunes_in_1998_heres_why_they_killed_it/
<!-- SC_OFF -->Recently I posted "The Other Father of MP3" about James Johnston, the Bell Labs engineer whose contributions to perceptual audio coding were written out of history. Several commenters asked what happened on the business side; how AT&T managed to have the technology that became iTunes and still lose. This is that story. Howie Singer and Larry Miller built a2b Music inside AT&T using Johnston's AAC codec. They had label deals, a working download service, and a portable player three years before the iPod. They tried to spin it out. AT&T killed the spin-out in May 1999. Two weeks later, Napster launched. Based on interviews with Singer (now teaching at NYU, formerly Chief of Strategic Technology at Warner Music for 10 years) and Miller (inaugural director of the Sony Audio Institute at NYU). The tech was ready. The market wasn't. And the permission culture of a century-old telephone monopoly couldn't move at internet speed. <!-- SC_ON --> submitted by /u/Traditional_Rise_609 (https://www.reddit.com/user/Traditional_Rise_609)
[link] (https://roguesgalleryprog.substack.com/p/the-a2b-spin-out-that-never-happened) [comments] (https://www.reddit.com/r/programming/comments/1qpsw4m/att_had_itunes_in_1998_heres_why_they_killed_it/)
40ns causal consistency by replacing consensus with algebra
https://www.reddit.com/r/programming/comments/1qpysme/40ns_causal_consistency_by_replacing_consensus/
<!-- SC_OFF -->Distributed systems usually pay milliseconds for correctness because they define correctness as execution order. This project takes a different stance: correctness is a property of algebra, not time. If operations commute, you don’t need coordination. If they don’t, the system tells you at admission time, in nanoseconds. Cuttlefish is a coordination-free state kernel that enforces strict invariants with causal consistency at ~40ns end-to-end (L1-cache scale), zero consensus, zero locks, zero heap in the hot path. Here, state transitions are immutable facts forming a DAG. Every invariant is pure algebra. The way casualty is tracked, is by using 512 bit bloom vector clocks which happen to hit a sub nano second 700ps dominance check. Non-commutativity is detected immediately, but if an invariant is commutative (abelian group/semilattice /monoid), admission requires no coordination. Here are some numbers for context(single core, Ryzen 7, Linux 6.x): Full causal + invariant admission: ~40ns
kernel admit with no deps: ~13ns
Durable admission (io_uring WAL): ~5ns For reference: etcd / Cockroach pay 1–50ms for linearizable writes. What this is: A low-level kernel for building databases, ledgers, replicated state machines Strict invariants without consensus when algebra allows it Bit-deterministic, allocation-free, SIMD-friendly Rust This is grounded in CALM, CRDT theory, and Bloom clocks, but engineered aggressively for modern CPUs (cache lines, branchless code, io_uring). Repo: https://github.com/abokhalill/cuttlefish I'm looking for feedback from people who’ve built consensus systems, CRDTs, or storage engines and think this is either right, or just bs. <!-- SC_ON --> submitted by /u/AdministrativeAsk305 (https://www.reddit.com/user/AdministrativeAsk305)
[link] (https://github.com/abokhalill/cuttlefish) [comments] (https://www.reddit.com/r/programming/comments/1qpysme/40ns_causal_consistency_by_replacing_consensus/)
https://www.reddit.com/r/programming/comments/1qpysme/40ns_causal_consistency_by_replacing_consensus/
<!-- SC_OFF -->Distributed systems usually pay milliseconds for correctness because they define correctness as execution order. This project takes a different stance: correctness is a property of algebra, not time. If operations commute, you don’t need coordination. If they don’t, the system tells you at admission time, in nanoseconds. Cuttlefish is a coordination-free state kernel that enforces strict invariants with causal consistency at ~40ns end-to-end (L1-cache scale), zero consensus, zero locks, zero heap in the hot path. Here, state transitions are immutable facts forming a DAG. Every invariant is pure algebra. The way casualty is tracked, is by using 512 bit bloom vector clocks which happen to hit a sub nano second 700ps dominance check. Non-commutativity is detected immediately, but if an invariant is commutative (abelian group/semilattice /monoid), admission requires no coordination. Here are some numbers for context(single core, Ryzen 7, Linux 6.x): Full causal + invariant admission: ~40ns
kernel admit with no deps: ~13ns
Durable admission (io_uring WAL): ~5ns For reference: etcd / Cockroach pay 1–50ms for linearizable writes. What this is: A low-level kernel for building databases, ledgers, replicated state machines Strict invariants without consensus when algebra allows it Bit-deterministic, allocation-free, SIMD-friendly Rust This is grounded in CALM, CRDT theory, and Bloom clocks, but engineered aggressively for modern CPUs (cache lines, branchless code, io_uring). Repo: https://github.com/abokhalill/cuttlefish I'm looking for feedback from people who’ve built consensus systems, CRDTs, or storage engines and think this is either right, or just bs. <!-- SC_ON --> submitted by /u/AdministrativeAsk305 (https://www.reddit.com/user/AdministrativeAsk305)
[link] (https://github.com/abokhalill/cuttlefish) [comments] (https://www.reddit.com/r/programming/comments/1qpysme/40ns_causal_consistency_by_replacing_consensus/)
Apple to Soon Take Up to 30% Cut From All Patreon Creators in iOS App
https://www.reddit.com/r/programming/comments/1qq2wru/apple_to_soon_take_up_to_30_cut_from_all_patreon/
submitted by /u/Dear-Economics-315 (https://www.reddit.com/user/Dear-Economics-315)
[link] (https://www.macrumors.com/2026/01/28/patreon-apple-tax/) [comments] (https://www.reddit.com/r/programming/comments/1qq2wru/apple_to_soon_take_up_to_30_cut_from_all_patreon/)
https://www.reddit.com/r/programming/comments/1qq2wru/apple_to_soon_take_up_to_30_cut_from_all_patreon/
submitted by /u/Dear-Economics-315 (https://www.reddit.com/user/Dear-Economics-315)
[link] (https://www.macrumors.com/2026/01/28/patreon-apple-tax/) [comments] (https://www.reddit.com/r/programming/comments/1qq2wru/apple_to_soon_take_up_to_30_cut_from_all_patreon/)
Resiliency in System Design: What It Actually Means
https://www.reddit.com/r/programming/comments/1qq3mx4/resiliency_in_system_design_what_it_actually_means/
submitted by /u/trolleid (https://www.reddit.com/user/trolleid)
[link] (https://lukasniessen.medium.com/resiliency-in-system-design-what-it-actually-means-2bc72713ebf5) [comments] (https://www.reddit.com/r/programming/comments/1qq3mx4/resiliency_in_system_design_what_it_actually_means/)
https://www.reddit.com/r/programming/comments/1qq3mx4/resiliency_in_system_design_what_it_actually_means/
submitted by /u/trolleid (https://www.reddit.com/user/trolleid)
[link] (https://lukasniessen.medium.com/resiliency-in-system-design-what-it-actually-means-2bc72713ebf5) [comments] (https://www.reddit.com/r/programming/comments/1qq3mx4/resiliency_in_system_design_what_it_actually_means/)
TypeScript inventor Anders Hejlsberg calls AI "a big regurgitator of stuff someone else has done" but still sees it changing the way software dev is done and reshaping programming tools
https://www.reddit.com/r/programming/comments/1qq3pss/typescript_inventor_anders_hejlsberg_calls_ai_a/
submitted by /u/onlyconnect (https://www.reddit.com/user/onlyconnect)
[link] (https://devclass.com/2026/01/28/typescript-inventor-anders-hejlsberg-ai-is-a-big-regurgitator-of-stuff-someone-has-done/) [comments] (https://www.reddit.com/r/programming/comments/1qq3pss/typescript_inventor_anders_hejlsberg_calls_ai_a/)
https://www.reddit.com/r/programming/comments/1qq3pss/typescript_inventor_anders_hejlsberg_calls_ai_a/
submitted by /u/onlyconnect (https://www.reddit.com/user/onlyconnect)
[link] (https://devclass.com/2026/01/28/typescript-inventor-anders-hejlsberg-ai-is-a-big-regurgitator-of-stuff-someone-has-done/) [comments] (https://www.reddit.com/r/programming/comments/1qq3pss/typescript_inventor_anders_hejlsberg_calls_ai_a/)
“When a measure becomes a target, it ceases to be a good measure” — Goodhart’s law
https://www.reddit.com/r/programming/comments/1qq4qp4/when_a_measure_becomes_a_target_it_ceases_to_be_a/
submitted by /u/dmp0x7c5 (https://www.reddit.com/user/dmp0x7c5)
[link] (https://l.perspectiveship.com/re-cobra) [comments] (https://www.reddit.com/r/programming/comments/1qq4qp4/when_a_measure_becomes_a_target_it_ceases_to_be_a/)
https://www.reddit.com/r/programming/comments/1qq4qp4/when_a_measure_becomes_a_target_it_ceases_to_be_a/
submitted by /u/dmp0x7c5 (https://www.reddit.com/user/dmp0x7c5)
[link] (https://l.perspectiveship.com/re-cobra) [comments] (https://www.reddit.com/r/programming/comments/1qq4qp4/when_a_measure_becomes_a_target_it_ceases_to_be_a/)
The Sovereign Tech Fund Invests in Scala
https://www.reddit.com/r/programming/comments/1qq7hzq/the_sovereign_tech_fund_invests_in_scala/
submitted by /u/jr_thompson (https://www.reddit.com/user/jr_thompson)
[link] (https://www.scala-lang.org/blog/2026/01/27/sta-invests-in-scala.html) [comments] (https://www.reddit.com/r/programming/comments/1qq7hzq/the_sovereign_tech_fund_invests_in_scala/)
https://www.reddit.com/r/programming/comments/1qq7hzq/the_sovereign_tech_fund_invests_in_scala/
submitted by /u/jr_thompson (https://www.reddit.com/user/jr_thompson)
[link] (https://www.scala-lang.org/blog/2026/01/27/sta-invests-in-scala.html) [comments] (https://www.reddit.com/r/programming/comments/1qq7hzq/the_sovereign_tech_fund_invests_in_scala/)