frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

F-Droid 2.0

https://f-droid.org/2026/09/24/f-droid-2.0-a-new-chapter-for-android-freedom.html
447•daveoc64•3h ago•130 comments

Show HN: Whiteboard (YC W26) – An open-source IDE for thoughtful software design

https://github.com/devdotfast/whiteboard
65•sidharthkmenon•1h ago•12 comments

Fearless SIMD v1.0

https://linebender.org/blog/fearless-simd-1-0/
30•verdagon•2d ago•5 comments

Why is the liver so weirdly regenerative?

https://dynomight.substack.com/p/liver
18•jbotz•2h ago•16 comments

Two-tier encryption in the UK

https://macanorak.com/two-tier-encryption-in-the-uk/
292•ReturnoftheHack•7h ago•286 comments

Google’s Project Suncatcher to put ML infrastructure in space

https://blog.google/innovation-and-ai/models-and-research/google-research/google-project-suncatch...
28•xnx•4h ago•37 comments

Forging 1024-bit RSA signatures in nearly SNFS time [pdf]

https://eprint.iacr.org/2026/2131.pdf
9•int0x29•4h ago•0 comments

Rails World 2026 Opening Keynote [video]

https://www.youtube.com/watch?v=vDjW_dRyKXY
50•an0malous•1d ago•22 comments

WaveDigger: Dig into wireless signals to discover their physical locations

https://github.com/christianrowlands/wavedigger
45•882542F3884314B•1d ago•6 comments

The forgotten battle of East Lansing

https://eastlansinginfo.news/the-forgotten-battle-of-east-lansing/
13•rmason•2d ago•0 comments

Show HN: Make cursed fonts like Times New Bastard

https://bastardica.mitpit.com
16•MitPitt•19h ago•3 comments

Book review: Is parallel programming hard, and, if so, what can you do about it?

https://ahelwer.ca/post/2026-09-21-concurrency-textbook/
14•ahelwer•3d ago•0 comments

Nokia Design Archive (2025)

https://repo.aalto.fi/index.php?name=SO_b66a9391-dcf8-4399-8e87-611f84c3fc4c
181•pillars•8h ago•96 comments

Motor Characterization for Small Running Robots (2016)

https://robot-daycare.com/posts/2016-01-06-motor-characterization-for-small-running-robots/
10•loughnane•2d ago•0 comments

GitHub has not removed malicious imitation software after 3 weeks

https://successfulsoftware.net/2026/09/24/github-has-not-removed-malicious-imitation-software-aft...
162•hermitcrab•2h ago•64 comments

Security auditing in the age of (good enough) AI

https://blog.trailofbits.com/2026/09/18/auditing-in-the-age-of-good-enough-ai/
8•aray07•2d ago•0 comments

B5-BJ2 – Ice Cream Barges – Concrete Ship Constructors (2023)

https://thecretefleet.com/blog/f/b5-bj2---ice-cream-barges---concrete-ship-constructors
16•nixass•2d ago•5 comments

Experiencing writing at our recent Chinese calligraphy workshop

https://viewsproject.wordpress.com/2026/09/06/chinese-calligraphy-workshop/
13•surprisetalk•2h ago•1 comments

Geothermal heat map of US hot springs

https://www.soakingsprings.com/hot-springs/geothermal-map
18•armenarmen•22h ago•5 comments

Show HN: AgentRun: DSL to turn agents into workflows

https://github.com/Parcha-ai/agentrun
14•miguelrios•22h ago•0 comments

Toyota is taking the Corolla electric

https://electrek.co/2026/09/23/toyota-best-selling-corolla-electric/
79•cisc•19h ago•71 comments

Search – A small, fast WebKit browser for macOS

https://github.com/driceroland/Search
37•metrofun•9h ago•0 comments

My Weird New Hobby: Wandering Around Tokyo on Google Maps

https://ahmedhossamdev.com/writing/my-weird-new-hobby-wandering-around-tokyo/
16•ahmedhossamdev•2d ago•8 comments

Ideas on modernizing the open-source desktop

https://lwn.net/SubscriberLink/1095425/2d9f411252325784/
346•signa11•15h ago•428 comments

Show HN: Treepeat – Code similarity detection using Tree-sitter

https://github.com/dsummersl/treepeat
7•91awebsi•2d ago•0 comments

The science of Monkey Island: can grog dissolve a metal mug that fast?

https://jgeekstudies.org/2026/09/23/the-science-of-monkey-island-can-grog-actually-dissolve-a-met...
107•zdw•1d ago•23 comments

RAM: the forgotten history (2024)

https://blog.coredump.cx/p/memory-the-forgotten-history
101•Luc•2d ago•4 comments

When the Debugger Lies

https://danielmangum.com/posts/when-the-debugger-lies/
60•hasheddan•2d ago•17 comments

Enjoy Every Sandwich

https://bradmontague.substack.com/p/enjoy-every-sandwich
167•NaOH•2d ago•85 comments

Coulomb's law remains tricky to test at home

https://chillphysicsenjoyer.substack.com/p/coulombs-law-remains-tricky-to-test
21•surprisetalk•2d ago•16 comments
Open in hackernews

The Scalar Select Anti-Pattern

https://matklad.github.io/2025/05/14/scalar-select-aniti-pattern.html
47•goranmoomin•1y ago

Comments

castratikron•1y ago
As long as processing one event does not affect any of the other events in the batch. E.g. events are file IO, and processing one event causes another event's descriptor to get closed before that event can be processed.
wahern•1y ago
If the close routine on an event source, or the low-level (e.g. epoll) registration, deregistration, and dequeueing logic doesn't know how to keep polling and liveness state consistent between userspace and the kernel, they've got much bigger problems. This looks like Rust code so I would hope the event stream libraries are, e.g., keeping Rc'd file objects and properly managing reference integrity viz-a-viz kernel state before the application caller ever sees the first dequeued event in a cycle. This is a perennial issue with event loop libraries and buggy application code (in every language). One can't just deal with raw file descriptors, call the close syscall directly, etc, hoping to keep state consistent implicitly. There's an unavoidable tie-in needed between application's wrappers around low-level resources and the event loop in use.
taeric•1y ago
I'm not entirely clear on what the proposal is at the end? Seems that the long term answer as to "which of these implications to pursue" is "all of them?" Simply taking in a batch of instructions doesn't immediately change much? You still have to be able to do each of the other things. And you will still expect some dependencies between batches that could possibly interact in the same ways.

In a sense, this is no different than how your processor is dealing with instructions coming in. You will have some instructions that can be run without waiting on previous ones. You will have some that can complete quickly. You will have some that are stalled on other parts of the system. (I'm sure I could keep wording an instruction to match each of the implications.)

To that end, part of your program has to deal with taking off "whats next" and finding how to prepare that to pass to the execution portion of your program. You can make that only take in batches, but you are almost certainly responsible for how you chunk them moreso than whatever process is sending the instructions to you? Even if you are handed clear batches, it is incumbent on you to batch them as they go off to the rest of the system.

lmz•1y ago
I guess the proposal is "instead of fetching and acting on one event at a time, consider fetching all available events and look for opportunities to optimize which ones you process (e.g. by prioritization or by skipping certain events if superseded by newer ones)".
taeric•1y ago
I mean, I got that. But you could as easily say "instead of fetching and acting on one event at a time, fetch and triage/route instructions into applicable queues."

In particular, there is no guarantee that moving to batches changes any of the problems you may have from acting on a single one at a time. To that end, you will have to look into all of the other strategies sooner or later.

Following from that, the problem is not "processMessage" or whatever. The problem is that you haven't broken "processMessage" up into the constituent "receive/triage/process/resolve" loop that you almost certainly will have to end up with.

malkia•1y ago
in CPU's - pipelining!
jchw•1y ago
I believe something similar is going on internally in Windows with event queues. It coalesces and prioritizes input events when multiple of them pile up before you're able to pop new events off of the queue. (For some events, e.g. pointer events, you can even go and query frames that were coalesced during input handling.) On the application/API end, it just looks like a "scalar select" loop, but actually it is doing batching behavior for input events!

(On the flip side, if you have a Wayland client that falls behind on processing its event queue, it can crash. On the whole this isn't really that bad but if you have something sending a shit load of events it can cause very bad behavior. This has made me wonder if it's possible, with UNIX domain sockets, to implement some kind of event coalescing on the server-side, to avoid flooding the client with high-precision pointer movement events while it's falling behind. Maybe start coalescing when FIONREAD gets to some high watermark? No idea...)