test is a unsigned 32-bit integer is prime. GitHub Gist: instantly share code, notes, and snippets.

This note collects, in compressed form, some techniques for modular multiplication with word-size (“short-limb”), or at most a-handful-of-words sized moduli as they are used in implementations of latt...

This is Part 1 in a planned three part series on Montgomery arithmetic. A few days ago, Part 0 (the prequel?) showed how best to calculate the multiplicative inverse. If you would like an excellent…

//──────────────────────────────────────────────────────────────────────────────────── // scaffolding macros. limited argcount based (up to 8) version #define CAT2(A,B) A##B // mini argcount based m...

Covers a transform that converts the tangent and bitangent of a 3D frame to a point on the unit circle.

// CRC32C hardware inverse #if defined(__ARM_ARCH) #if defined(__ARM_FEATURE_CRC32) && defined(__ARM_FEATURE_CRYPTO) static inline uint32_t crc32c(uint32_t x, uint32_t k) { return __crc32cw(...

There’s a hardware problem affecting Intel 13th/14th gen CPUs, mostly desktop ones. This made the rounds through the press last year and has been on forums etc. for much longer than that. For…

test driver that demos "xoroshiro128+" failing PractRand - test.c

Using sollya to "repeat" Cecil Hastings' 1955 approximations for atan. Works as an example of using a 'seed' approximation & using sollya to refine. - hastings_atan.sollya

We demonstrate that, even when there are moderate overlaps in the inputs of sloppy or accurate double-word addition algorithms in the QD library, these algorithms still guarantee error bounds of $O(u^...

The FastTwoSum algorithm is a classical way to evaluate the rounding error that occurs when adding two numbers in finite precision arithmetic. Starting with Dekker in the early 1970s, numerous floatin...

This post describes using item weights to define the relative frequency of drop rates.

From the Zed Blog: In this episode of Zed Decoded, Thorsten and Antonio walk through the performance optimizations Antonio when working on Zed's Rope data structure before they then pair on adding mor...

Builds up a rational for a presented method for generating the additive constant of a LCG or Weyl sequence based PRNG.

Skims two methods: bisection method for random numbers with given popcount & branchfree random bit permutation with bit-scatter or sheep-and-goats op. - prng_pop.c