liu.diva-portal.org/smash/record...
github.com/stegu/noisei...
liu.diva-portal.org/smash/record...
github.com/stegu/noisei...
Nothing special here so this is a bit surprising to me.
gist.github.com/Marc-B-Reyno...
Nothing special here so this is a bit surprising to me.
gist.github.com/Marc-B-Reyno...
I'm sharing because it's an example of using a "seed" approximation to refine the coefficients using sollya.
gist.github.com/Marc-B-Reyno...
I'm sharing because it's an example of using a "seed" approximation to refine the coefficients using sollya.
gist.github.com/Marc-B-Reyno...
arxiv.org/abs/2404.05948
AFIK: latest refinement of the accurate building blocks are in this: hal.science/hal-02972245
& weakened constraint versions by Rump & Lang www.tuhh.de/ti3/paper/ru...
arxiv.org/abs/2404.05948
AFIK: latest refinement of the accurate building blocks are in this: hal.science/hal-02972245
& weakened constraint versions by Rump & Lang www.tuhh.de/ti3/paper/ru...
1) A tightening of FastTwoSum knowledge
2) Attempting to generate approximations which account for runtime evaluation errors (w source 4 external proc for Sollya)
1) hal.science/hal-04875749v1
2) hal.science/hal-04709615v1
1) A tightening of FastTwoSum knowledge
2) Attempting to generate approximations which account for runtime evaluation errors (w source 4 external proc for Sollya)
1) hal.science/hal-04875749v1
2) hal.science/hal-04709615v1
www.keithschwarz.com/darts-dice-c...
www.keithschwarz.com/darts-dice-c...
marc-b-reynolds.github.io/math/2025/01...
marc-b-reynolds.github.io/math/2025/01...
zed.dev/blog/zed-dec...
(A B-tree of 128 byte payloads...interesting) and an optimization related to that which is "find n^th bit set" for precomputed return positions in payload side-line info.
zed.dev/blog/zed-dec...
(A B-tree of 128 byte payloads...interesting) and an optimization related to that which is "find n^th bit set" for precomputed return positions in payload side-line info.
marc-b-reynolds.github.io/math/2024/12...
marc-b-reynolds.github.io/math/2024/12...
1) generate a random number with a given population count (portable, bisection method)
2) perform a random bit permutation of the input. (needs PDEP or SAG like op in hardware to be usable)
3) not quite random versions of (2)
(continued)
1) generate a random number with a given population count (portable, bisection method)
2) perform a random bit permutation of the input. (needs PDEP or SAG like op in hardware to be usable)
3) not quite random versions of (2)
(continued)
An old blog post on the format:
marc-b-reynolds.github.io/math/2019/02...
An old blog post on the format:
marc-b-reynolds.github.io/math/2019/02...