You can add location information to your Tweets, such as your city or precise location, from the web and via third-party applications. You always have the option to delete your Tweet location history. Learn more
CLMUL a number with itself inserts zeroes between each input bit. Useful if you want to construct morton-codes. They are useful to index into large 2D arrays because they are very cache friendly.
Thanks! I've now added that as clmul(h) use-case (and "zip" use-case, which is the more obvious choice for morton-codes within xbitmanip) to the current draft document at https://raw.githubusercontent.com/cliffordwolf/xbitmanip/master/xbitmanip-draft.pdf …, and added you as contributor, and added the following invariant to my tests.pic.twitter.com/32dWnYWLTh
I have another one. Afaik you can calculate the Number Theoretic Transform in GF2 using clmul. This gives you most of the goodies a FFT will, but without ever running into roundig Errors. You can use this for example to do fast bignum multiplications.
Do you have a reference for this? (Googled a bit but didn't find something that looks like that, maybe I just used the wrong search terms? I guess the fast bignum part refers to the Schoenhage-Strassen algorithm. But I can't seem to find anything specifically re NTT using CLMUL.)
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.
