<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Fast Evaluation of Polynomials with Rational Preprocessing · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2609.06022/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2609.06022/feed.xml" rel="self" type="application/rss+xml" /><item><title>Fast Evaluation of Polynomials with Rational Preprocessing — mentioned by thomasahle</title><link>https://news.ycombinator.com/item?id=49638999</link><guid isPermaLink="false">urn:hackerpapers:mention:2609.06022:49638999</guid><pubDate>Thu, 10 Sep 2026 05:59:24 GMT</pubDate><description>&lt;p&gt;WyHash and xxh3 are not polynomial, in fact this is one of the issues we try to solve in the paper. Many &amp;quot;practical&amp;quot; hashes use heuristics instead of real field multiplications to be faster. But it means they are vulnerable to adversarial inputs. That means, it&amp;#x27;s possible to design a set of keys that have much higher probability (under random hash seeds/keys) to collide than you&amp;#x27;d expect under a correct hash function. We actually analyze both WyHash and xxh3 in this setting in section &amp;quot;Adversarial inputs for heuristic hashes&amp;quot; - https://arxiv.org/pdf/2609.06022#page=165&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2609.06022/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
