Page Object (2013)
martinfowler.com·3h·
Discuss: Hacker News
🧩WebAssembly
Evolution of the ELF object file format
maskray.me·4d·
Discuss: Hacker News
⚙Risc-v
The inevitable cable drawer
thefoggiest.dev·8h·
Discuss: Hacker News
🎚️Audio Codecs
Early return and goroutine leak
rednafi.com·4d·
Discuss: Hacker News
🌐Rust Networking
The 4p Developer: The Missing Layer in Platform Thinking
davidpoll.com·10h·
Discuss: Hacker News
🧩Nomad
Show HN: A local first AI engine and orchestrator
krionis.com·3d·
Discuss: Hacker News
🏗️AI Infrastructure
The Endless Hot Vibe Code Summer
redmonk.com·2d·
Discuss: Hacker News
✨vibe-coding
Show HN: AI image creation that works like chat threads
hiflux.ai·1d·
Discuss: Hacker News
🤖AI agents
Should I use this Go bi-temporal event store, pick another, or build my own?
reddit.com·1d·
Discuss: r/golang
⏳Time-travel Databases
The exceptionalism of software is unwarranted
overbring.com·1d·
Discuss: Hacker News
🧩Low-code
Visual Studio 2026 Insiders is here! - Visual Studio Blog
devblogs.microsoft.com·1d·
Discuss: Hacker News, r/cpp
🧩Low-code
How to evaluate AI agent development tools and platforms
infoworld.com·1d
🤖AI agents
Building an AI Store Generator with Tambo
dev.to·3h·
Discuss: DEV
✨vibe-coding
The Choice of Divergence: A Neglected Key to Mitigating Diversity Collapse in Reinforcement Learning with Verifiable Reward
arxiv.org·1d
🏗️AI Infrastructure
Show HN: Claude Context but local – semantic code search without API keys
github.com·3d·
Discuss: Hacker News, r/ClaudeAI, r/LocalLLaMA
☁️Serverless Rust
Automated Biotope Design Optimization via Generative Adversarial Networks (GANs)
dev.to·1d·
Discuss: DEV
🍄Mycelium Networks
Fairness-Aware Data Augmentation for Cardiac MRI using Text-Conditioned Diffusion Models
arxiv.org·2d
🎙️Whisper
Hyperbolic Large Language Models
arxiv.org·2d
🎙️Whisper
Bi-Level Game-Theoretic Planning of Cyber Deception for Cognitive Arbitrage
arxiv.org·2d
⚖️Consensus Networks
Another Turn, Better Output? A Turn-Wise Analysis of Iterative LLM Prompting
arxiv.org·2d
🎙️Whisper