thomasahle

11 ms·

1.
by thomasahle 5d ago
Sorry I meant P_i = x_{2i} + (x_{2i+1} + z^3)(P_{i-1} + z^2)
2.
by thomasahle 6d ago
I'm happy to take a PR if you have a good layout in mind!
3.
by thomasahle 6d ago
> Hopefully that answers your question about why someone might still choose to use heuristic hashing Not really. Our method is also 2x faster than xxh3. Sure, AES make the heuristic hashes harder to break, but they still provide (1) slow
4.
by thomasahle 6d ago
It's true that you can use AES instructions now on some computers, bit I honestly don't see why you'd use a heuristic hash (even if cryptographic) when you can get provable guarantees with k-wise independent hashing. Our pape
5.
by thomasahle 6d ago
I'm not sure, since we only do univariate polynomials and k-path has lots of variables, right? But maybe this work can inspire looking for other small, constant factor saving circuits for different classes of polynomials. Would be cool
6.
by thomasahle 6d ago
> the "universality" property of such hashes seldom provides any substantial benefit over alternative hash functions that do not have this property Do you mean hashes like xxh3? We have a section in the paper showing for a bunc
7.
by thomasahle 6d ago
It's the blessing and the course of a polynomial inverse: the inverse is the same degree as the polynomial, so its largest coeffecient is large and blows up. Knuth-Eve and Pan use the root of a degree d polynomial, which is slightly l
8.
by thomasahle 7d ago
> This method requires additional preprocessing of the coefficients, before starting to evaluate the polynomial. That preprocessing would slow the hashing algorithm more than what is gained during evaluation. There is no preprocessing at
9.
by thomasahle 7d ago
See also discussions here https://www.reddit.com/r/programming/comments/1wbgcke/commen... on how the actual math works out.
10.
by thomasahle 7d ago
Thank you! It was a lot of fun to make the website and see all the methods in practice after having just looked at the theory for a long time :D > have a separate source node for each x, x^2, x^4 used Do you mean a graph like this R&
11.
by thomasahle 7d ago
FFT multipoint evaluation is great when you know all the evaluation points in advance. However, for many practical applications the input is only streamed to you. E.g. a polynomial hash for a hashmap. Or preprocessing the taylor approximati
12.
by thomasahle 7d ago
In CRC8 you interpret the input as coefficients of a polynomial, and take mod `x⁸ + x² + x + 1`. The problem we solve here is a bit different: You know the coefficients in advance, and want to preprocess the polynomial to make it fast to ev
13.
by thomasahle 7d ago
If you are working over floating point, you probably with to use Estrin's method (see https://en.wikipedia.org/wiki/Estrin%27s_scheme - also tab 3 on the website.) It takes advantage of FMA (fused multiply add), h
14.
by thomasahle 7d ago
I don't know what happened to the URL, but it's supposed to link to this paper: https://www.gwizfl.org/email/cr.yp.to/antiforgery/pema-20071... It's a very nice construction (based on Rabin &am
15.
by thomasahle 7d ago
WyHash and xxh3 are not polynomial, in fact this is one of the issues we try to solve in the paper. Many "practical" hashes use heuristics instead of real field multiplications to be faster. But it means they are vulnerable to adv
16.
by thomasahle 7d ago
It's surprising that in 2026 they still haven't figured out how to remove the bezels. They are smaller than they used to be, but On something as compact a watch, all screen estate counts.
17.
by thomasahle 7d ago
They charge you 23%? I thought in the EU the maximum interchange fee for consumer credit cards is capped at 0.3% of the transaction value.
18.
Show HN: Compute polynomials twice as fast(thomasahle.com)
139 points by thomasahle 7d ago|42 comments
19.
by thomasahle 10d ago
1) That's maybe $180,000 per year, so much less than median OpenAI employee wages. 2) OpenAI doesn't pay API prices. 3) Compute costs are likely already their biggest expense, dwarfing wages.
20.
by thomasahle 11d ago
Do you want people here to try to convince you to have kids?
21.
by thomasahle 11d ago
Yes please. For a moment I thought Terrence Tao had scooped Anthropic.
22.
by thomasahle 13d ago
• 98.6% on ARC-AGI-3 • 97.6% on frontier math • 95.9% on CAD • 100% on ExploitBench Nothing modest about it
23.
by thomasahle 26d ago
> Grades should come from hard randomized exams with unlimited retakes Exams will have to be a lot longer if you allow unlimited retakes. Generally exams work on a sample principle, but this breaks with retakes.
24.
by thomasahle 26d ago
> had similar (slightly higher) performance. The data point around 80 minutes seems like noise to me. Looks like there isn't enough data/students who spend that much time and also used AI. It would be nice if AI was a force for
25.
by thomasahle 1mo ago
Has anyone started proving their sandboxes in Lean (or Coq, etc.)?
26.
by thomasahle 1mo ago
> I expect a lot of the social anxiety can be mitigated by arranging things so that students get a chance to know the examiners and build a rapport with them ahead of time. That's not my experience. Standing in front of somebody who
27.
by thomasahle 1mo ago
The talk is wild: https://www.youtube.com/watch?v=87DyyMV0kCY > I want to note that every step in the process we discussed has had a remediation applied. The credentials have been revoked. The zero date has been patched
28.
by thomasahle 1mo ago
Nah, Claude will finish it over night
29.
by thomasahle 2mo ago
If it's successful, why do you think we'll even know how it did it?
30.
by thomasahle 2mo ago
Here's one way it could happen: Let's say there's some circuit that does problem solving of the kind we call intelligence. We dont know what this circuit looks like, but it exists in our brain. Doing regression on outputs fro

More ›