Show HN: Beamsplitter – Hash function that uses only S-boxes

Let&#x27;s ignore for a second the question of security (is it collision&#x2F;pre-image resistant? Dieharder says nothing about this).<p>As a developer, is the fact that it only uses S-boxes supposed to be beneficial to me somehow? Does this mean it runs faster? Uses less memory? Is it an academic exercise? Why would I use this over a different hash function?

&gt; I went to random.org and generated 32 sets of 256 no-repeat numbers between 0 and 255 inclusive.<p>One suggestion I&#x27;d have here would be using &quot;nothing-up-my-sleeve&quot; numbers like pi&#x2F;e&#x2F;log2 in hex. [1]<p>[1] <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Nothing-up-my-sleeve_number" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Nothing-up-my-sleeve_number</a>

Saving a Google search for those (like me) who don&#x27;t know what S-boxes are: <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;S-box" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;S-box</a>

I sincerely hope the author will urgently and clearly mark the repo as a toy&#x2F;demo&#x2F;do not use for anything important in the readme.