标签:#news
找到 9820 篇相关文章
Modernizing a 25-year-old minimal C++ unit testing framework (Part 2)
Exapunks
Postgres transactions are a distributed systems superpower
Vulkan is now available on NetBSD
Ask HN: Why are so many "AI evangelists" posting such insufferable content?
My LinkedIn feed is absolutely unreal right now. 90% (I don't even think I'm exaggerating) of the posts in my feed are from connections who have changed their title to something like "AI Thought Leader | AI Native | Thought Coaching". They post *daily* about something LLM/agentic. The biggest problem is that it's never "hey check out this cool thing", it's "if you're not doing this, you're a dinosaur who will be left in the past." Other common content is regurgitating blog / Twitter folks from "
Platonic Hydrocarbons
Screen Time for Under-2s Poses Long-Term Health Risks
Weird Al Yankovic Pulled Out of AI Ad Deal: 'I Can't Be the Poster Boy for AI'
Europe's top court upholds Google's record $4.7B antitrust fine
Text AI watermarks will always be trivial to remove
The US Government Is Now a Shareholder in 26 Companies
Portugal launches first open-source AI model, joining Europe's sovereignty push
24-bit/192kHz music downloads and why they make no sense (2012)
Brave's latest browser release offers Containers for better and easier workflow
Microsoft's new Azure Linux 4.0 is here, and it could replace Windows Server
Show HN: ctx – Search the coding agent history already on your machine
Coding agents don't have long-term memory. But you do have months of full-fidelity agent transcripts stored on your machine. A simple solution that goes a long way: ingest those transcripts and logs into a structured SQLite database, then search them with ranked text match. Everything is fully local and doesn't require anything fancy like a graph database or hosted memory service. This is the idea behind ctx, a Rust CLI that handles the ingestion and searching. We give our agents a skill that te
Flexible Metaprogramming with Rhombus
Show HN: zkGolf, competitive optimization of formally verified circuits.
Zero-Knowledge Proofs (ZKPs) let an untrusted proved show that computation was executed correctly without revealing the inputs to the verifier. However to prove anything, the computation first has to be expressed as a circuit: a system of polynomial equations (constraints) over a finite field. Circuits are the assembly language of zk and every constraint costs prover (and sometimes verifier) time, so production circuits are aggressively hand-optimized. Over the last months, we have been experime