HNHacker News
TopNewBestAskShowJobs

anematode

766 karma · joined May 22, 2024

Opinions expressed here are solely my own. Website: https://anemato.de
submissionscomments
anematode··on We should be more ambitious with the software we build
The author claimed that it was an honest mistake, but looking closer at the original PR removing it, his explanation doesn't make sense.

Maybe what's happened is that their bots reward hacked their way into special-casing the benchmarks without a proper audit from the humans involved, and now they're doing vibed damage control....

anematode··on 'I've applied for 300 jobs. My 25 years' experience is worthless'
Well said.
anematode··on Anthropic logged net loss of over $80B in first half of 2026
Hasn't Apple themselves partnered with Google? Why not switch to one of the Gemini coding offerings? (Yes, they may be inferior for now, but that's not guaranteed to persist.)
anematode··on Netflix vmaf: Perceptual video quality assessment based on multi-method fusion
VMAF is super cool, although not the end-all-be-all of video quality measurement for sure. I'm currently evaluating switching over to the new v1.0 models.

The (unsolicited) slop PRs on that repository are a sight to behold, though. The same slopper posted an aggressive response to my PR: https://github.com/Netflix/vmaf/pull/1586

anematode··on Sharing AI progress in mathematics
Dear lord that website is laggy
anematode··on Coding is not solved
lgtm!

... Oh by the way, did you know that Claude Code is actually a mini game engine? /s

anematode··on Three-LLM: Three.js-based WebGPU LLM inference engine
That makes very little sense when you can just use WebGPU and have fine-grained control...

for something like LLM inference, having this kind of abstraction seems like quite a hindrance

anematode··on AI;DR (AI; Didn't Read)
Even worse, in a brownfield codebase that was once fairly light with comments, that's now being subject to these modifications, the insane amounts of commentary around the parts newly touched by AI lead to an excessive emphasis on those parts, for both human and AI readers (who think, well if this one part is commented so thoroughly, it must be unusually subtle)
anematode··on Protobuf has LSP support. You're welcome
JSON. /s
anematode··on Branchless Rust: Making a Filter 4x Faster by Removing an If
Yes, that's one approach. Another reasonable approach is to get out a mask from the comparison using `vmovmskpd` and use that to look up a shuffle constant, since there are only 16 possibilities. This also works well on NEON, although I wonder there whether it'd make more sense to find the shuffle dynamically rather than loading it.
anematode··on Branchless Rust: Making a Filter 4x Faster by Removing an If
Great link, nice find!
anematode··on Branchless Rust: Making a Filter 4x Faster by Removing an If
Good question. I personally doubt that the compress instruction is easy to coax compilers into generating, as there are many edge cases to consider.

For example, you'll notice here that we perform a full vector store of 8 elements unconditionally, even if only a few of the elements are active. This is safe, though, because the output buffer is as large as the input buffer, and we're chunking by 8, so we'll never trash memory past the end; but this is a tricky analysis. Performance-wise, we rely on the CPU's store buffer to make these overlapping stores cheap.

Instead, you might think that you could just store the elements which are actually active, using a masked store. In fact there is also an intrinsic for this purpose (_mm512_mask_compressstoreu_pd), but it is extremely slow on some CPUs, namely Zen 4, so it's dangerous to use unless you know exactly what CPU you're using. (In my testing, there also seems to be some weird hazard on Zen 5 where multiple memory-destination compress instructions to nearby, even non-overlapping, addresses are serialized. But I haven't looked closer at this.)

anematode··on Branchless Rust: Making a Filter 4x Faster by Removing an If
Nice post!

You can do even a bit better if you're willing to use intrinsics. In particular this kind of operation is well-suited for compress-type operations, available as a first-class operation in at least AVX512, SVE and RVV; you can also emulate them reasonably quickly on NEON and AVX2.

Here's an example, building on the OP's work:

    pub fn filter_compress(input: &[f64], threshold: f64) -> Vec<f64> {
        use std::arch::x86_64::*;
    
        let mut out = vec![0.0; input.len()]; 
        let mut n = 0usize;
    
        let (head, tail) = input.as_chunks::<8>();
    
        for chunk in head {
            unsafe {
                let p = _mm512_loadu_pd(chunk.as_ptr());
                let m = _mm512_cmpnle_pd_mask(p, _mm512_set1_pd(threshold));
        
                let compress = _mm512_maskz_compress_pd(m, p); 
                _mm512_storeu_pd(out.as_mut_ptr().wrapping_add(n), compress);
                n += m.count_ones() as usize;
            }   
        }   
    
        for &x in tail {
            out[n] = x;
            n += (x > threshold) as usize;
        }   
        out.truncate(n);
        out 
    }
For me it's about 25% less time than the branchless version with 1,000,000 elements, and 60% less with 10,000 elements where memory bandwidth effects are less relevant.
anematode··on Born Against, or why hobby programming communities are against LLM usage
That's awesome :) Do you have any links to your guys' work that I could check out?
anematode··on Born Against, or why hobby programming communities are against LLM usage
It's a dog-eat-dog world, eh? :)

Anyway, I don't see how this relates to the original discussion. Nor do I think the irony is particularly deep: As far as I'm aware, Deep Blue didn't plagiarize Kasparov, and indeed alpha-beta search is quite different than how humans calculate. But yes, I'd have been very demoralized if I were Kasparov, although he seems to be doing well now.

Edit: Regarding being mean-spirited, sorry to say, but I don't particularly care for the feelings of someone who has been repeatedly dishonest and used LLMs to respond to people engaging in good faith. That latter path has been exhausted now.

To co-opt your conflation of legality and morality: free speech, mf!

anematode··on Born Against, or why hobby programming communities are against LLM usage
:EmotiTrumpet:
anematode··on Born Against, or why hobby programming communities are against LLM usage
> Some times that's appropriate, like if there's a competition for hand-made or human-written something.

Indeed, and this is the problem: unlike woodworking, where my power-assisted creation is independent of, or complements, your handcraft, this engine is directly competing with other engines. Twiss is being disingenuous when he says he has no interest in submitting it to competitions; it plays on a rated account on Lichess, for example.

anematode··on Born Against, or why hobby programming communities are against LLM usage
My implicit request, which I should have made clearer, was for him to delete (or make private) the repository and move on to greater ideals.
anematode··on Born Against, or why hobby programming communities are against LLM usage
You'll notice I didn't mention copyright, and that's because I don't think it's relevant. I think your analysis is correct. Keep in mind too that Stockfish – the engine I work on, although I wasn't at the time – was the subject of a high-profile defense of the GPL in Germany: https://stockfishchess.org/blog/2021/our-lawsuit-against-che.... That case was different as it involved wholesale copying of the source code, rather than porting ideas. Ideas shouldn't be copyrightable.

But copyright and plagiarism are orthogonal, and questions of morality are much more tied to the latter. It would be illegal (in the United States) for me to publish a copy of Nineteen Eighty-Four, but not immoral. It was not immoral, in my view, for Aaron Swartz to try to liberate JSTor articles.

That doesn't make plagiarism acceptable, either. And therefore, I'm willing to call it out when I see it.

anematode··on Born Against, or why hobby programming communities are against LLM usage
I'm the OP of the cited thread, ask me anything :P
anematode··on Cloudflare enforces engineering standards using AI
Meanwhile: https://textslashplain.com/2026/08/04/security-is-hard-yall/

> The Cloudflare folks apparently want security issues reported via HackerOne (which wouldn’t let me log in because the Cloudflare CAPTCHA HackerOne uses seems to be broken…).

anematode··on Ten advances in mathematics and theoretical computer science
Fully agreed. As someone who both loves chess and works on chess engines... these comparisons to chess needs to stop.
anematode··on Scriptc by Vercel: TypeScript-to-Native compiler, no JavaScript engine in binary
> deferring int optimizations for later

This part made me laugh out loud

anematode··on A 77-year-old Republican man is staging a solo protest against Flock cameras
https://en.wikipedia.org/wiki/Incitement#United_States

If done obliquely enough... e.g., just making a tracker and having the ability for people to report broken cameras, you're probably fine in theory. In practice, this is a litigious society, so you'd want to build this anonymously.

anematode··on The Dark Night of Mathematics
A raw and powerful piece, thanks for sharing.

For years I've wanted to get back into self-studying mathematics, not to make serious contributions but just to appreciate its beauty; but the recent observation that I'll never be able to answer a pure mathematics question that a clanker could not has been off-putting, to say the least.

Unsaid here is that the companies involved have stolen so much (both literally in their plagiarism, and in their breaking of people's spirit), and given back so little. You still need to pay them cold, hard cash for them to help you prove theorems, and meanwhile, mathematicians working at these companies have themselves done little to contextualize and interpret results. That insight has mostly come from outsiders.

anematode··on OpenAI’s accidental attack against Hugging Face is science fiction that happened
For security??

Why else would they purposely lower cyber refusals in that case.

anematode··on OpenAI and Hugging Face address security incident during model evaluation
> Do you think there is such a thing as perfect security? No one can "get it right" in the face of arbitrarily high intelligence

Why didn't they run the model against the sandbox first? They have effectively unlimited spend.

anematode··on Meta is testing an AI bedtime story app for people with no imagination
Disgusting.
anematode··on Claude Code uses Bun written in Rust now
Same observation. One thing you can do is close out the session and `claude --resume`
anematode··on Claude Code uses Bun written in Rust now
It's a "democracy", in which some people (Anthropic and co., and anyone willing to suck up to them) are more equal than others...
Page 1 of 9Next →