Explore >> Select a destination
|
You are here 
|
blag.nullteilerfrei.de | ||
| | | | |
imapenguin.com
|
|
| | | | | What is an LFSR? An LFSR is a Linear Feedback Shift Register. It's a simple way of generating a sequence of numbers that look random. Used in cryptography and in generating pseudo-random numbers, they are interesting because they are so simple. Shift bits and feed a few of them back into the sequence. That's it. Important note: LFSRs are not cryptographically secure on their own. ESPECIALLY 8-bit LFSRs. More on that in the next post on this topic. | |
| | | | |
ondrejcertik.com
|
|
| | | | | [AI summary] A blog post announces the development of fastGPT, a Fortran implementation of GPT-2 inference that outperforms PyTorch in speed on Apple M1 Max processors, leveraging static typing and optimized matrix operations. | |
| | | | |
cp4space.hatsya.com
|
|
| | | | | A couple of years ago I described a primep which possesses various properties that renders it useful for computing number-theoretic transforms over the field $latex \mathbb{F}_p$. Specifically, we have: $latex p = \Phi_{192}(2) = \Phi_6(2^{32}) = 2^{64} - 2^{32} + 1$ where the first of these equalities uses the identity that: $latex \Phi_{k}(x) = \Phi_{rad(k)}(x^{k/rad(k)})$... | |
| | | | |
astroautomata.com
|
|
| | | Automating Scientific Discovery | ||
