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/)
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/)
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/)
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/)
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/)
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/)
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/)
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/)
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/)
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/)
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/)
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/)
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/)
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/)
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/)
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/)
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/)
Ace Your JavaScript Interview! Developer Podcast with Real Q&A Examples
https://www.reddit.com/r/programming/comments/1owt528/ace_your_javanoscript_interview_developer_podcast/
submitted by /u/ThisCar6196 (https://www.reddit.com/user/ThisCar6196)
[link] (https://youtu.be/0FjtM4iYDFY) [comments] (https://www.reddit.com/r/programming/comments/1owt528/ace_your_javanoscript_interview_developer_podcast/)
https://www.reddit.com/r/programming/comments/1owt528/ace_your_javanoscript_interview_developer_podcast/
submitted by /u/ThisCar6196 (https://www.reddit.com/user/ThisCar6196)
[link] (https://youtu.be/0FjtM4iYDFY) [comments] (https://www.reddit.com/r/programming/comments/1owt528/ace_your_javanoscript_interview_developer_podcast/)
Build an Image Classifier with Vision Transformer
https://www.reddit.com/r/programming/comments/1owti39/build_an_image_classifier_with_vision_transformer/
<!-- SC_OFF -->Hi, For anyone studying Vision Transformer image classification, this tutorial demonstrates how to use the ViT model in Python for recognizing image categories.
It covers the preprocessing steps, model loading, and how to interpret the predictions. Video explanation : https://youtu.be/zGydLt2-ubQ?si=2AqxKMXUHRxe_-kU You can find more tutorials, and join my newsletter here: https://eranfeit.net/ Blog for Medium users : https://medium.com/@feitgemel/build-an-image-classifier-with-vision-transformer-3a1e43069aa6 Written explanation with code: https://eranfeit.net/build-an-image-classifier-with-vision-transformer/ This content is intended for educational purposes only. Constructive feedback is always welcome. Eran <!-- SC_ON --> submitted by /u/Feitgemel (https://www.reddit.com/user/Feitgemel)
[link] (https://eranfeit.net/build-an-image-classifier-with-vision-transformer/) [comments] (https://www.reddit.com/r/programming/comments/1owti39/build_an_image_classifier_with_vision_transformer/)
https://www.reddit.com/r/programming/comments/1owti39/build_an_image_classifier_with_vision_transformer/
<!-- SC_OFF -->Hi, For anyone studying Vision Transformer image classification, this tutorial demonstrates how to use the ViT model in Python for recognizing image categories.
It covers the preprocessing steps, model loading, and how to interpret the predictions. Video explanation : https://youtu.be/zGydLt2-ubQ?si=2AqxKMXUHRxe_-kU You can find more tutorials, and join my newsletter here: https://eranfeit.net/ Blog for Medium users : https://medium.com/@feitgemel/build-an-image-classifier-with-vision-transformer-3a1e43069aa6 Written explanation with code: https://eranfeit.net/build-an-image-classifier-with-vision-transformer/ This content is intended for educational purposes only. Constructive feedback is always welcome. Eran <!-- SC_ON --> submitted by /u/Feitgemel (https://www.reddit.com/user/Feitgemel)
[link] (https://eranfeit.net/build-an-image-classifier-with-vision-transformer/) [comments] (https://www.reddit.com/r/programming/comments/1owti39/build_an_image_classifier_with_vision_transformer/)
We made the most【vaporwave】operating system
https://www.reddit.com/r/programming/comments/1owwvts/we_made_the_most%EF%BD%96%EF%BD%81%EF%BD%90%EF%BD%8F%EF%BD%92%EF%BD%97%EF%BD%81%EF%BD%96%EF%BD%85operating_system/
submitted by /u/daedaluscommunity (https://www.reddit.com/user/daedaluscommunity)
[link] (https://www.youtube.com/watch?v=AqFiAO0Gm6s) [comments] (https://www.reddit.com/r/programming/comments/1owwvts/we_made_the_most%EF%BD%96%EF%BD%81%EF%BD%90%EF%BD%8F%EF%BD%92%EF%BD%97%EF%BD%81%EF%BD%96%EF%BD%85operating_system/)
https://www.reddit.com/r/programming/comments/1owwvts/we_made_the_most%EF%BD%96%EF%BD%81%EF%BD%90%EF%BD%8F%EF%BD%92%EF%BD%97%EF%BD%81%EF%BD%96%EF%BD%85operating_system/
submitted by /u/daedaluscommunity (https://www.reddit.com/user/daedaluscommunity)
[link] (https://www.youtube.com/watch?v=AqFiAO0Gm6s) [comments] (https://www.reddit.com/r/programming/comments/1owwvts/we_made_the_most%EF%BD%96%EF%BD%81%EF%BD%90%EF%BD%8F%EF%BD%92%EF%BD%97%EF%BD%81%EF%BD%96%EF%BD%85operating_system/)
How we avoided side-channels in our new post-quantum Go cryptography libraries
https://www.reddit.com/r/programming/comments/1owzfjp/how_we_avoided_sidechannels_in_our_new/
submitted by /u/sarciszewski (https://www.reddit.com/user/sarciszewski)
[link] (https://blog.trailofbits.com/2025/11/14/how-we-avoided-side-channels-in-our-new-post-quantum-go-cryptography-libraries/) [comments] (https://www.reddit.com/r/programming/comments/1owzfjp/how_we_avoided_sidechannels_in_our_new/)
https://www.reddit.com/r/programming/comments/1owzfjp/how_we_avoided_sidechannels_in_our_new/
submitted by /u/sarciszewski (https://www.reddit.com/user/sarciszewski)
[link] (https://blog.trailofbits.com/2025/11/14/how-we-avoided-side-channels-in-our-new-post-quantum-go-cryptography-libraries/) [comments] (https://www.reddit.com/r/programming/comments/1owzfjp/how_we_avoided_sidechannels_in_our_new/)
DNS Resolution Delay: The Silent Killer That Blocks Your Threads
https://www.reddit.com/r/programming/comments/1ox0lkn/dns_resolution_delay_the_silent_killer_that/
<!-- SC_OFF -->The Blocking Problem Everyone Forgets Here’s the thing about DNS lookups that catches people off guard. When your service needs to connect to another service, it has to resolve the hostname to an IP address. In most programming languages, this happens through a synchronous system call like getaddrinfo(). That means the thread making the request just sits there, doing nothing, waiting for the DNS response. Normally this takes 2-5 milliseconds and nobody notices. You have a thread pool of 200 threads, each request takes maybe 50ms total, and you’re processing thousands of requests per second without breaking a sweat. The occasional DNS lookup is just noise in the overall request time. But when DNS gets slow, everything changes. Imagine your DNS resolver is now taking 300ms to respond. Every thread that needs to establish a new connection is now blocked for 300ms just waiting for DNS. During that time, incoming requests pile up in the queue. More threads pick up queued requests, and they also need new connections, so they also get stuck on DNS. Before you know it, your entire thread pool is blocked waiting for DNS responses, and your service is effectively dead even though your CPU is at 15% and you have plenty of memory. https://howtech.substack.com/p/dns-resolution-delay-the-silent-killer https://github.com/sysdr/howtech/tree/main/dns_resolution <!-- SC_ON --> submitted by /u/Designer_Bug9592 (https://www.reddit.com/user/Designer_Bug9592)
[link] (https://howtech.substack.com/p/dns-resolution-delay-the-silent-killer) [comments] (https://www.reddit.com/r/programming/comments/1ox0lkn/dns_resolution_delay_the_silent_killer_that/)
https://www.reddit.com/r/programming/comments/1ox0lkn/dns_resolution_delay_the_silent_killer_that/
<!-- SC_OFF -->The Blocking Problem Everyone Forgets Here’s the thing about DNS lookups that catches people off guard. When your service needs to connect to another service, it has to resolve the hostname to an IP address. In most programming languages, this happens through a synchronous system call like getaddrinfo(). That means the thread making the request just sits there, doing nothing, waiting for the DNS response. Normally this takes 2-5 milliseconds and nobody notices. You have a thread pool of 200 threads, each request takes maybe 50ms total, and you’re processing thousands of requests per second without breaking a sweat. The occasional DNS lookup is just noise in the overall request time. But when DNS gets slow, everything changes. Imagine your DNS resolver is now taking 300ms to respond. Every thread that needs to establish a new connection is now blocked for 300ms just waiting for DNS. During that time, incoming requests pile up in the queue. More threads pick up queued requests, and they also need new connections, so they also get stuck on DNS. Before you know it, your entire thread pool is blocked waiting for DNS responses, and your service is effectively dead even though your CPU is at 15% and you have plenty of memory. https://howtech.substack.com/p/dns-resolution-delay-the-silent-killer https://github.com/sysdr/howtech/tree/main/dns_resolution <!-- SC_ON --> submitted by /u/Designer_Bug9592 (https://www.reddit.com/user/Designer_Bug9592)
[link] (https://howtech.substack.com/p/dns-resolution-delay-the-silent-killer) [comments] (https://www.reddit.com/r/programming/comments/1ox0lkn/dns_resolution_delay_the_silent_killer_that/)