sfluhrer

Hmmm, by design, you #include hss.h into your code, and link in hss_lib.a or hss_lib_thread.a into your project. Is this not working? What build environment are you using?

I tried it with Visual Studio 2019; I created an empty console project, imported the source files, excluding demo.c (I used test_hss.c as my 'main' program, hence I included all...

I do not believe we are double-counting. What's in line 307 counts the stack usage only for the upper level trees (that is, all of them except the bottom-most) -...

The reason we have the two separate logics (one for the bottom-most tree, another for all the others) is that we use different strategies for selecting the sizes of the...

Oops, David Cooper is right; this does flip the bit order for each leaf. What we want is: indices[i] ^= ((m[offset >> 3] >> (~offset & 0x7)) & 0x1)