Show HN: Tree, truth, druid, dryad, and tar share one Proto-Indo-European root https://ift.tt/NfSJZhF

Show HN: Tree, truth, druid, dryad, and tar share one Proto-Indo-European root https://ift.tt/cegJMHA July 16, 2026 at 11:11PM

Show HN: SirixDB 1.0 Beta – Git-Like Versioning, Diffs, Time-Travel Queries https://ift.tt/f7dBJF2

Show HN: SirixDB 1.0 Beta – Git-Like Versioning, Diffs, Time-Travel Queries Hi HN! I've posted SirixDB here before, back in 2019 ( https://ift.tt/sd9Mrvh ) and again in 2023 ( https://ift.tt/M9IjZ0G ). The core idea behind SirixDB is, that history is a first-class citizen. Every commit stores a lightweight, queryable revision. You can query any point in time, even individual nodes (for instance JSON values), diff arbitrary revisions, and efficiently track how data evolved without replaying events. Unlike traditional event stores, historical states do not need to be reconstructed by replaying events nor do we have to think about projections. Revisions are directly queryable. A simple example: Jan 1: Record "Price = $100, valid from Jan 1". Stored on Jan 1 (transaction time). Jan 20: Discover price was actually $95 on Jan 1. Commit correction. After correction, you can ask across both axes: - "What did we THINK the price was on Jan 16?" -> $100 (Transaction time) - "What WAS the price on Jan 1?" -> $95 (Valid time) I've worked on this in my spare time since 2013, following its academic precursor (Idefix/Treetank) at the University of Konstanz. The architecture relies on an append-only physical log and a persistent copy-on-write page trie. A high level view of the architecture: Physical Log (append-only, sequential writes) ┌────────────────────────────────────────────────────────────────────────┐ │ [R1:Root] [R1:P1] [R1:P2] [R2:Root] [R2:P1'] [R3:Root] [R3:P2'] ... │ └────────────────────────────────────────────────────────────────────────┘ t=0 t=1 t=2 t=3 t=4 t=5 t=6 → time Each revision is indexed, and unchanged pages are shared: [Rev 1] [Rev 2] [Rev 3] │ │ │ ▼ ▼ ▼ [Root₁] [Root₂] [Root₃] │ │ │ │ │ │ │ └─────────┐ │ └────────┐ │ └─────────┐ ▼ ▼ ▼ ▼ ▼ ▼ ┌──────┐ ┌──────┐ ┌──────┐ ┌──────┐ │ P1 │ │ P2 │ │ P1' │ │ P2' │ └──────┘ └──────┘ └──────┘ └──────┘ Rev 1 Rev 1+2 Rev 2+3 Rev 3 (shared) (shared) Beneath the root pages sit node and secondary indexes, using a novel sliding-snapshot algorithm to balance read/write performance. Everything is queryable using JSONiq via the Brackit compiler. Back in 2019, and even in 2023, SirixDB was very slow due to GC pressure. Unlike most other document stores, SirixDB stores fine-grained nodes, and I came to realize that an on-heap (JVM) representation made up of lots of small objects simply didn't make sense. I measured it with async-profiler — with some help from Andrei Pangin himself — and the result was that the poor throughput was due to the sheer amount of allocations which scaled almost linearly with the number of open transactions. Working a full-time software engineering job, I lacked the energy for a massive spare-time rewrite. About a year ago, I started experimenting with AI. It turned out to be ideal for automating the tedious, repetitive parts of migrating the storage layer to Java's Foreign Function & Memory API, storing pages completely off-heap. Looking further ahead, the append-only, immutable-page design maps naturally onto object storage like S3 and distributed logs like Kafka for a cloud version, and initial prototypes already exist. Maybe that becomes a commercial service one day, but for now, I'm just thrilled to see these core design principles finally proven out.There's an interactive demo, documentation, and the code is on GitHub. I'd love feedback and am happy to answer questions! kind regards Johannes [1] https://sirix.io | https://ift.tt/KOCgxSv [2] https://ift.tt/RGJQ0Bn [3] https://demo.sirix.io [4] https://sirix.io/docs/ [5] http://brackit.io https://ift.tt/KOCgxSv July 15, 2026 at 09:16PM

Show HN: Leet Robotics: Learn robotics and ROS2 with hands-on courses https://ift.tt/rAZ5WDq

Show HN: Leet Robotics: Learn robotics and ROS2 with hands-on courses Hi all, I've just launched Leet Robotics: a platform to learn robotics hands-on, with a full ROS2 workspace that runs in the browser (Jazzy, Gazebo Harmonic, Foxglove, VS Code) - no install required. The platform also has room for sharing projects and simulation assets as it grows. Our first course is live now: Intro to ROS2 (free to read). The course teaches skills ranging from building your first node to a capstone project of a robot touring a museum world, with every lesson runnable in the online workspace (free accounts get an hour of workspace time daily - enough to follow the course). Would love feedback from this community: on the course, the workspace experience, and what courses to build next. https://ift.tt/vSqxdnz July 15, 2026 at 05:44PM

Show HN: Beautiful Type Erasure with C++26 Reflection https://ift.tt/snjTVE2

Show HN: Beautiful Type Erasure with C++26 Reflection Try it on Compiler Explorer: https://ift.tt/ZVJdl0a Check out the source code: https://ift.tt/wuaLFt4 https://ryanjk5.github.io/posts/rjk-duck/ July 14, 2026 at 06:10PM

Show HN: Find Remote Accounting Jobs https://ift.tt/V8cden0

Show HN: Find Remote Accounting Jobs https://ift.tt/qZz1oNg July 13, 2026 at 11:47PM

Show HN: Scramble Quest https://ift.tt/UdhOgGe

Show HN: Scramble Quest https://ift.tt/UHSfy80 July 12, 2026 at 11:28PM

Show HN: Sqlsure – deterministic semantic checks for AI-generated SQL https://ift.tt/sYeTAKt

Show HN: Sqlsure – deterministic semantic checks for AI-generated SQL https://ift.tt/bKHXwPc July 12, 2026 at 01:33AM

Show HN: Don't let your engineering brain rot in the age of AI https://ift.tt/gqL9JiM

Show HN: Don't let your engineering brain rot in the age of AI https://ift.tt/VfSz0RK July 12, 2026 at 01:27AM

Show HN: Share and explore custom Claude Code status lines https://ift.tt/5sve4uO

Show HN: Share and explore custom Claude Code status lines Hey HN, I made a registry for claude code users to share and explore status lines. I found that my friends/coworkers and I would always share screenshots of our terminal to show off our custom claude lines so I decided to build this registry as a place for others to show off! https://claudelines.com July 12, 2026 at 01:21AM

Show HN: We beat Cloudflare's bot detection (open-source stealth browser) https://ift.tt/YyDUmBQ

Show HN: We beat Cloudflare's bot detection (open-source stealth browser) https://ift.tt/4z3Jcjq July 11, 2026 at 05:56AM

Show HN: SubjectiveZero, an open-source agentic node editor for creative coding https://ift.tt/mr3N0GZ

Show HN: SubjectiveZero, an open-source agentic node editor for creative coding Hey there, My name is Clem, I've been a solo indie dev for a couple years now, exploring frontier tech like XR and agentic workflows in the context of creative / interactive work. I've been building creation tools for a while and some common design challenge is to figure out the right level of abstraction for your tool. You can always make it super advanced and complex with low level concepts (shader composition, actual code etc.) but then you get something with a high complexity / learning curve. On the other hand, if you make your tool too high level, it might be easier to use at first, but people will most likely hit a wall eventually and start fighting with your tool to get their edge case done (you see that on mobile a lot actually). With this prototype (called SubjectiveZero), I'd like to imagine that we can kind of move the "slider" on the abstraction layer, meaning that you can actually start with prompts that describe the goal, and you can go as high level (stay with abstract prompts) or low level as you'd like (more specific prompts, or even edit the generated code directly)! The agent orchestration actually understand your context and work along side with you to figure out what could be the best node graph structure for your project (that and some fun little procedural UI done at the node level). If i had to pitch it in 30 seconds, I'd say "Think TouchDesigner and friends but with agent orchestration". When you use it, it will generate real native code (Swift/Metal for now) that you can actually hot reload and iterate on either manually or through agents. It's still an early prototype and macOS only for now, but I'd love to get genuine feedback that could help me drive where this project should go next (or not). Lastly, I'm absolutely open and upfront on the fact that I used agentic coding for this, but as people say: "kept on a short leash". The architecture and specs were relatively well thought out and I personally prefer to be in the loop and review all the code being written to make sure it's going in the right direction. Oh and it's open source :-) Hope you like it! https://ift.tt/Ks2GPwz https://ift.tt/Ks2GPwz July 10, 2026 at 08:53PM

Show HN: Wyrm – Solve algebra by touch, built on an open-source soundness engine https://ift.tt/c39dMLX

Show HN: Wyrm – Solve algebra by touch, built on an open-source soundness engine There is a mobile game called DragonBox. It sort of tricks you into learning algebra by starting with very abstract manipulations of a puzzle that must follow rules... gradually the game teaches you more and more rules and also strips out the more abstract elements until on the last levels you are finally solving real equations. I loved it, it taught my kids algebra.... and it was just fun. Over the years I often thought that there should be a calculator for Algebra that works this way... something where you can drag terms around and cancel & distribute with gestures, but most importantly enter your own problems. It should also do more kinds of problems than DragonBox allowed. So I finally decided to build it. https://dicroce.github.io/wyrm/home.html Here's a video showing it: https://www.youtube.com/watch?v=_STbS4zvIlU . If you'd rather just play with it: there's a limited in-browser demo (real engine, a few example equations, no download) on the landing page — https://dicroce.github.io/wyrm/home.html . The app can be found on iOS ( https://ift.tt/5CI1tEG ) and as of this week on Google Play ( https://ift.tt/0H7RAm2... ). I also decided to open source the underlying math engine so others could build on it: https://ift.tt/P1iHdqQ . My goal for the engine btw is to build it all the way up to Calculus. Monetization is deliberately boring: the engine is free (MIT), and the polished gesture app is $4.99 once. No subscriptions, ads, accounts, or analytics. I'd love feedback on the engine design — especially from anyone who's worked on CAS or proof-assistant-adjacent problems. And if you played DragonBox as a kid and wished it went further: this is for you! https://ift.tt/P1iHdqQ July 9, 2026 at 04:46PM

Show HN: Real-time n-body tree code in CUDA https://ift.tt/wuI09sD

Show HN: Real-time n-body tree code in CUDA Sharing an old project of mine, on my RTX 500 Ada laptop GPU, it can simulate up to 4 million particles at ~400 ms per step using the Barnes-Hut algorithm, saturating the 4GB of VRAM available. The octree construction is fast, as well as the traversal. The major bottlenecks are the VRAM usage (1 million bodies require ~1GB), which could be probably halved by reusing intermediate buffers, and the particle to leaf evaluation, which would benefit from more fp32 FLOPS. Moreover, I still don't have a good heuristic to predetermine the size of the BFS queue, perhaps some sort of memory paging could solve the issue. https://ift.tt/V5k6CwM July 10, 2026 at 09:17PM