Async and Finaliser Deadlocks
https://www.reddit.com/r/programming/comments/1ova8wi/async_and_finaliser_deadlocks/

submitted by /u/Xaneris47 (https://www.reddit.com/user/Xaneris47)
[link] (https://tratt.net/laurie/blog/2025/async_and_finaliser_deadlocks.html) [comments] (https://www.reddit.com/r/programming/comments/1ova8wi/async_and_finaliser_deadlocks/)

Visual Studio 2026 is now generally available
https://www.reddit.com/r/programming/comments/1ovbpnd/visual_studio_2026_is_now_generally_available/

submitted by /u/mariuz (https://www.reddit.com/user/mariuz)
[link] (https://devblogs.microsoft.com/visualstudio/visual-studio-2026-is-here-faster-smarter-and-a-hit-with-early-adopters/) [comments] (https://www.reddit.com/r/programming/comments/1ovbpnd/visual_studio_2026_is_now_generally_available/)

The Forty-Year Programmer
https://www.reddit.com/r/programming/comments/1ovc9y2/the_fortyyear_programmer/

submitted by /u/mooreds (https://www.reddit.com/user/mooreds)
[link] (https://codefol.io/posts/the-forty-year-programmer/) [comments] (https://www.reddit.com/r/programming/comments/1ovc9y2/the_fortyyear_programmer/)

Fun-reliable side-channels for cross-container communication
https://www.reddit.com/r/programming/comments/1ovcdim/funreliable_sidechannels_for_crosscontainer/

submitted by /u/N1ghtCod3r (https://www.reddit.com/user/N1ghtCod3r)
[link] (https://h4x0r.org/funreliable/) [comments] (https://www.reddit.com/r/programming/comments/1ovcdim/funreliable_sidechannels_for_crosscontainer/)

VS Code 1.106 out with new icons, Agents view w/ Codex, diff selection fixes
https://www.reddit.com/r/programming/comments/1ovcrks/vs_code_1106_out_with_new_icons_agents_view_w/

submitted by /u/connor4312 (https://www.reddit.com/user/connor4312)
[link] (https://code.visualstudio.com/updates/v1_106) [comments] (https://www.reddit.com/r/programming/comments/1ovcrks/vs_code_1106_out_with_new_icons_agents_view_w/)

Comparing Integers and Doubles
https://www.reddit.com/r/programming/comments/1ovd2yz/comparing_integers_and_doubles/

submitted by /u/TheCrush0r (https://www.reddit.com/user/TheCrush0r)
[link] (https://databasearchitects.blogspot.com/2025/11/comparing-integers-and-doubles.html) [comments] (https://www.reddit.com/r/programming/comments/1ovd2yz/comparing_integers_and_doubles/)

Sacred Fig Architecture (FIG): an adaptive, feedback-driven alternative to Hexagonal — thoughts?
https://www.reddit.com/r/programming/comments/1ovdngg/sacred_fig_architecture_fig_an_adaptive/

<!-- SC_OFF -->Hey everyone, I’ve been working on Sacred Fig Architecture (FIG) — an evolution of Hexagonal that treats a system like a living tree: Trunk = pure domain core Roots = infrastructure adapters Branches = UI/API surfaces Canopy = composition & feature gating Aerial Roots = built-in telemetry/feedback that adapts policies at runtime Key idea: keep the domain pure and testable, but make feedback a first-class layer so the system can adjust (e.g., throttle workers, change caching strategy) without piercing domain boundaries. The repo has a whitepaper, diagrams, and a minimal example to try the layering and contracts. Repo: github.com/sanjuoo7live/sacred-fig-architecture (http://github.com/sanjuoo7live/sacred-fig-architecture) What I’d love feedback on: Does the Aerial Roots layer (feedback → canopy policy) feel like a clean way to add adaptation without contaminating the domain? Are the channel contracts (typed boundaries) enough to keep Branches/Roots from drifting into Trunk concerns? Would you adopt this as an architectural model/pattern alongside Hexagonal/Clean, or is it overkill unless you need runtime policy adaptation? Anything obvious missing in the minimal example or the guardrail docs (invariants/promotion policy)? Curious where this breaks, and where it shines. Tear it apart! 🌳 <!-- SC_ON --> submitted by /u/Resident-Escape-7959 (https://www.reddit.com/user/Resident-Escape-7959)
[link] (http://github.com/sanjuoo7live/sacred-fig-architecture) [comments] (https://www.reddit.com/r/programming/comments/1ovdngg/sacred_fig_architecture_fig_an_adaptive/)

Apache NetBeans 28 Released
https://www.reddit.com/r/programming/comments/1ovdt0s/apache_netbeans_28_released/

submitted by /u/BlueGoliath (https://www.reddit.com/user/BlueGoliath)
[link] (https://lists.apache.org/thread/qg7j1mt5qbpcnhz3bl4c1ns66nfocj5v) [comments] (https://www.reddit.com/r/programming/comments/1ovdt0s/apache_netbeans_28_released/)

SWT Evolve: Drop-in Modern Renderer for SWT -- No Migrations, Web-Ready
https://www.reddit.com/r/programming/comments/1ovenf6/swt_evolve_dropin_modern_renderer_for_swt_no/

submitted by /u/Chromium_Engine96 (https://www.reddit.com/user/Chromium_Engine96)
[link] (https://www.equo.dev/blog/swt-evolve) [comments] (https://www.reddit.com/r/programming/comments/1ovenf6/swt_evolve_dropin_modern_renderer_for_swt_no/)

Day 15: Gradients and Gradient Descent
https://www.reddit.com/r/programming/comments/1ovjarm/day_15_gradients_and_gradient_descent/

<!-- SC_OFF -->What We’ll Build Today Implement a basic gradient descent algorithm from scratch Train a simple AI model to predict house prices using gradient descent Visualize how AI systems “learn” by following gradients downhill Why This Matters: The Secret Behind Every AI System <!-- SC_ON --> submitted by /u/Extra_Ear_10 (https://www.reddit.com/user/Extra_Ear_10)
[link] (https://aieworks.substack.com/p/day-15-gradients-and-gradient-descent) [comments] (https://www.reddit.com/r/programming/comments/1ovjarm/day_15_gradients_and_gradient_descent/)

NALTH.JS The Security‑First Web Framework You Should Be Using
https://www.reddit.com/r/programming/comments/1ovq9yw/nalthjs_the_securityfirst_web_framework_you/

submitted by /u/Evening-Direction-71 (https://www.reddit.com/user/Evening-Direction-71)
[link] (https://medium.com/@nalikiru/nalth-js-the-security-first-web-framework-you-should-be-using-3d9323d80335) [comments] (https://www.reddit.com/r/programming/comments/1ovq9yw/nalthjs_the_securityfirst_web_framework_you/)

LZAV 5.0: Improved compression ratio across a wide range of data types, at similar performance. Improved compression ratio by up to 5% for data smaller than 256 KiB. Fast Data Compression Algorithm (header-only C/C++).
https://www.reddit.com/r/programming/comments/1ovyqle/lzav_50_improved_compression_ratio_across_a_wide/

submitted by /u/avaneev (https://www.reddit.com/user/avaneev)
[link] (https://github.com/avaneev/lzav) [comments] (https://www.reddit.com/r/programming/comments/1ovyqle/lzav_50_improved_compression_ratio_across_a_wide/)

The Way the Future Was • Kevlin Henney & James Lewis
https://www.reddit.com/r/programming/comments/1ow0nzm/the_way_the_future_was_kevlin_henney_james_lewis/

submitted by /u/goto-con (https://www.reddit.com/user/goto-con)
[link] (https://youtu.be/ZTfnRXtIFEo) [comments] (https://www.reddit.com/r/programming/comments/1ow0nzm/the_way_the_future_was_kevlin_henney_james_lewis/)

Why agents DO NOT write most of our code - a reality check
https://www.reddit.com/r/programming/comments/1ow476v/why_agents_do_not_write_most_of_our_code_a/

submitted by /u/ma_za_octo (https://www.reddit.com/user/ma_za_octo)
[link] (https://octomind.dev/blog/why-agents-do-not-write-most-of-our-code-a-reality-check) [comments] (https://www.reddit.com/r/programming/comments/1ow476v/why_agents_do_not_write_most_of_our_code_a/)

Exploring the x402 Protocol for Internet-Native Payments
https://www.reddit.com/r/programming/comments/1ow6j1h/exploring_the_x402_protocol_for_internetnative/

submitted by /u/Permit_io (https://www.reddit.com/user/Permit_io)
[link] (https://www.permit.io/blog/exploring-the-x402-protocol-for-internet-native-payments) [comments] (https://www.reddit.com/r/programming/comments/1ow6j1h/exploring_the_x402_protocol_for_internetnative/)

Rust compilation is resource hungry!
https://www.reddit.com/r/programming/comments/1ow3zg6/rust_compilation_is_resource_hungry/

submitted by /u/aditya26sg (https://www.reddit.com/user/aditya26sg)
[link] (https://aditya26sg.substack.com/p/resource-consumption-by-rust) [comments] (https://www.reddit.com/r/programming/comments/1ow3zg6/rust_compilation_is_resource_hungry/)

Raft Consensus in 2,000 words
https://www.reddit.com/r/programming/comments/1ow0czt/raft_consensus_in_2000_words/

<!-- SC_OFF -->Very accessible article about the Raft Consensus Algorithm - which solves the problem of choosing the leader in a distributed system environment. It's used in many popular tools and libraries, such as Etcd (database behind Kubernetes state), MongoDB or Apache Kafka. So it's definitely worth wrapping one's head around it; and as for a complex problem of this nature it's surprisingly straightforward and the linked article does a great job at explaining it in detail. <!-- SC_ON --> submitted by /u/BinaryIgor (https://www.reddit.com/user/BinaryIgor)
[link] (https://news.alvaroduran.com/p/raft-consensus-in-2000-words) [comments] (https://www.reddit.com/r/programming/comments/1ow0czt/raft_consensus_in_2000_words/)

IBM Patented Euler's 200 year old Math Technique
https://www.reddit.com/r/programming/comments/1ow61vh/ibm_patented_eulers_200_year_old_math_technique/

submitted by /u/DataBaeBee (https://www.reddit.com/user/DataBaeBee)
[link] (https://leetarxiv.substack.com/p/ibm-patented-eulers-fractions) [comments] (https://www.reddit.com/r/programming/comments/1ow61vh/ibm_patented_eulers_200_year_old_math_technique/)

Visual Types: a collection of semi-interactive TypeScript lessons
https://www.reddit.com/r/programming/comments/1ow41pn/visual_types_a_collection_of_semiinteractive/

submitted by /u/self (https://www.reddit.com/user/self)
[link] (https://types.kitlangton.com/) [comments] (https://www.reddit.com/r/programming/comments/1ow41pn/visual_types_a_collection_of_semiinteractive/)

Day 13: Implement TLS Encryption for Secure Log Transmission
https://www.reddit.com/r/programming/comments/1ow0nhs/day_13_implement_tls_encryption_for_secure_log/

<!-- SC_OFF --> Mutual TLS (mTLS) authentication between all distributed services Certificate management infrastructure with automated rotation Encrypted Kafka message streams with broker authentication TLS-secured REST endpoints with client certificate validation Performance benchmarking to quantify encryption overhead Resources : https://github.com/sysdr/sdc-java/tree/main/day13 https://sdcourse.substack.com/p/day-13-implement-tls-encryption-for <!-- SC_ON --> submitted by /u/Safe_Trick8865 (https://www.reddit.com/user/Safe_Trick8865)
[link] (https://sdcourse.substack.com/p/day-13-implement-tls-encryption-for) [comments] (https://www.reddit.com/r/programming/comments/1ow0nhs/day_13_implement_tls_encryption_for_secure_log/)

Pulse 1.0.4: deterministic concurrency, CLI tools and full templates
https://www.reddit.com/r/programming/comments/1owss92/pulse_104_deterministic_concurrency_cli_tools_and/

<!-- SC_OFF -->Hi everyone, I have been working on a small language called Pulse, a language that compiles to JavaScript but runs on its own deterministic runtime. If you like the idea of deterministic scheduling, channels and select inspired by Go, reactive signals, structured concurrency, and full JS ecosystem compatibility, you might find this interesting. What is Pulse Pulse is a small language with: deterministic cooperative scheduler CSP style channels and select signals, computed values and effects a full compiler pipeline: lexer, parser and codegen ES module output compatible with Node, Vite, Next, React, Vue Same inputs always produce the same async behavior. What is new in version 1.0.4 Version 1.0.4 focuses on real usability: stable CLI: pulse and pulselang commands create app tool: npx create-pulselang-app my-app full templates: React, Next and Vue templates now build correctly deterministic runtime verified again with fuzz and soak tests documentation and examples fully corrected ready for real world experiments Small example import { signal, effect } from 'pulselang/runtime/reactivity' import { channel, select, sleep } from 'pulselang/runtime/async' fn main() { const [count, setCount] = signal(0) const ch = channel() effect(() => { print('count is', count()) }) spawn async { for (let i = 1; i <= 3; i++) { await ch.send(i) setCount(count() + 1) } ch.close() } spawn async { for await (let value of ch) { print('received', value) } } } The scheduler runs this with the same execution order every time. How to try it Install: npm install pulselang Run: pulse run file.pulse Create a template app (React + Vite + Tailwind): npx create-pulselang-app my-app cd my-app npm run dev Links Docs and playground: https://osvfelices.github.io/pulse Source code: https://github.com/osvfelices/pulse If you try it and manage to break the scheduler, the channels or the reactivity system, I would love to hear about it. <!-- SC_ON --> submitted by /u/coloresmusic (https://www.reddit.com/user/coloresmusic)
[link] (https://osvfelices.github.io/pulse) [comments] (https://www.reddit.com/r/programming/comments/1owss92/pulse_104_deterministic_concurrency_cli_tools_and/)