Can you name applications for CLMUL that are not CRC, GCM, hashing/rng, or Erasure Code? I'm trying to create a list of possible applications. #RISCV #Bitmanip #Followerpower cc @rygorous @geofflangdale @alt_kia @lemire @rrika9
-
-
This Tweet is unavailable.
-
I've done some exploration of this using SyGuS and quantified SMT. See for example http://svn.clifford.at/handicraft/2018/xbitpermsyn/ …. (Also submitted some SyGuS benchmarks.) A big unsolved problem seems to be generating programs that contain large (word-sized) magic constants.
- Show replies
-
-
-
Since the Gray code is bit-reversed polynomial multiplication by x + 1, whose inverse modulo x^32 is all 1s, you can also have grev32(clmul32(grev32(x ^ (x >> 1), 31), -1), 31) == x.
-
Oh, yes. That also works.
However, my "clmul_gray2" uses one instruction fewer.
So current status of gray code vs clmul invariants:pic.twitter.com/t06o5v9TCW
- Show replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.