rjeli
Joined 11 years ago
Joined 11 years ago
> ob.patp('0')
'~zod'
> ob.patp2dec('~nidsut-tomdun')
'15663360'
> ob.hex2patq('010203')
'~doznec-binwes'
> ob.patq2hex('~marned-wismul-nilsev-botnyt')
'01ca0e51d20462f3'
> ob.isValidPatq('~marned-wismul-nilsev-botnyt')
> true
Each byte is converted to a three letter syllable, from a hand-written LUT optimized for pronounceability, & different LUTs for even and odd bytes.The LLM handles the natural language interaction and orchestration, while the computer algebra system does what it does best ... exact symbolic manipulation.
this smells like claude :D
mirror: https://nitter.net/camrobjones/status/1907086860322480233#m
They link to the webapp which you can play yourself!
(I have a dozen games played and 100% success rate :3)
Not sure how much storage to get. I was floating the idea of getting less storage, and hooking it up to a TB5 NAS array of 2.5” SSDs, 10-20tb for models + datasets + my media library would be nice. Any recommendations for the best enclosure for that?
(was playing with a mod that models ullage, so relighting was quite finicky)
(I am not a C or C++ expert.)
Some call this a “harmonic” fft, and there are also non-harmonic FFTs:
- the “additive NTT” of [LCH14] on GF(2^n)
- the circle fft on the unit circle X^2+Y^2=1 of a finite field [HLP24]
- the ecfft on a sequence of elliptic curve isogenies [BCKL21]
[LCH14]: https://arxiv.org/abs/1404.3458
[HLP24]: https://eprint.iacr.org/2024/278
[BCKL21]: https://arxiv.org/pdf/2107.08473
In particular, if you choose a group where discrete log is hard (such as prime order elliptic curves), multiset hashing falls out for free
[ my public key: https://keybase.io/rjeli; my proof: https://keybase.io/rjeli/sigs/g_UlqZH7q19Y1_4cFMHYmpBANDmW-KNtGysYrIaZP6w ]
https://rjeli.at.hn