Adam V

An additional motivation may be to provide raw unchecked operations for loading constants. Say you want to load a bitvector: UInt does not allow negative BigInts, and SInt does not...

Interesting to see generalization to higher bit counts. I'm particularly interested in high bit counts (2^11-2^16) and wonder how well these compose. That is, insofar can you apply different generated...

Same issue with - Linux distro: arch-linux 5.15.67-1 (manjaro) - Distro version: (latest, rolling) - Docker Desktop Version: 4.12.0

Nice! Can you drop the `_k` from `bottom_k`? Also, please add a test on within_std and outside_std, as these are the most crucial yet finicky methods.

There's also an opportunity for a logic_window [like a decision tree](https://github.com/Adam-Vandervorst/PyBHV/blob/4b53586beb91cef082d246aeafac8adf1f07ecbc/bhv/abstract.py#L536), though I've found it quite hard to replicate in C++ with ternary functions (AVX-512) as I desire. Links to...

Hi! This has raised a few warts. While this works for some implementations, it doesn't for others for some very nasty reasons: there are three different orders going on, resulting...

One solution would be to generate an initial carefully chosen random state for each potential thread. Then, using templates, the current code still works, but you can optionally specify a...

I want to avoid bothering the user with this. At the moment, a random vector has just one identity: the pointer you have to the newly generated vector. When you...

See https://github.com/Adam-Vandervorst/PyBHV/tree/parallel-opt