Bump version

Update README.md
Add new coverage to corpus
2026-07-14 15:27:09 -04:00 · 2026-07-14 14:32:08 -04:00 · 2026-07-14 14:23:03 -04:00 · 2026-07-14 13:38:15 -04:00 · 2026-07-14 12:28:08 -04:00 · 2026-07-14 10:56:12 -04:00
2083 changed files with 1852 additions and 6458 deletions
@@ -38,43 +38,21 @@ jobs:
      matrix:
        include:
          - name: 64-bit-versions
-            runner: ubuntu-latest-amd64
-            arch: amd64
-            llvm_version: "21"
-            msan_url: ""
            cmake_args: -DCMAKE_CXX_FLAGS=-DUSE_64_BIT=1
          - name: debug
-            runner: ubuntu-latest-amd64
-            arch: amd64
-            llvm_version: "21"
-            msan_url: https://minio.weaselab.dev/public/x86_64/msan-toolchain-21.1.8.tar.zst
-            cmake_args: -DCMAKE_BUILD_TYPE=Debug -DMSAN_TOOLCHAIN_PATH=/opt/msan
+            cmake_args: -DCMAKE_BUILD_TYPE=Debug
          - name: simd-fallback
-            runner: ubuntu-latest-amd64
-            arch: amd64
-            llvm_version: "21"
-            msan_url: ""
            cmake_args: -DUSE_SIMD_FALLBACK=ON
          - name: gcc
-            runner: ubuntu-latest-amd64
-            arch: amd64
-            llvm_version: "21"
-            msan_url: ""
            cmake_args: -DCMAKE_C_COMPILER=gcc -DCMAKE_CXX_COMPILER=g++
-          - name: debug-arm64
-            runner: ubuntu-latest-arm64
-            arch: arm64
-            llvm_version: "22"
-            msan_url: https://minio.weaselab.dev/public/aarch64/msan-toolchain-22.1.8.tar.zst
-            cmake_args: -DCMAKE_BUILD_TYPE=Debug -DMSAN_TOOLCHAIN_PATH=/opt/msan
-    runs-on: ${{ matrix.runner }}
+    runs-on: ubuntu-latest-amd64
    steps:
      - uses: actions/checkout@v4

      - uses: actions/cache@v4
        with:
          path: /var/cache/apt/archives
-          key: apt-${{ matrix.arch }}-${{ hashFiles('.gitea/workflows/ci.yml') }}
+          key: apt-amd64-${{ hashFiles('.gitea/workflows/ci.yml') }}

      - name: Install common dependencies
        run: |
@@ -90,21 +68,14 @@ jobs:
        run: |
          . /etc/os-release
          wget -qO- https://apt.llvm.org/llvm-snapshot.gpg.key | sudo tee /etc/apt/trusted.gpg.d/apt.llvm.org.asc
-          echo "deb http://apt.llvm.org/${VERSION_CODENAME}/ llvm-toolchain-${VERSION_CODENAME}-${{ matrix.llvm_version }} main" | sudo tee /etc/apt/sources.list.d/llvm.list
+          echo "deb http://apt.llvm.org/${VERSION_CODENAME}/ llvm-toolchain-${VERSION_CODENAME}-21 main" | sudo tee /etc/apt/sources.list.d/llvm.list
          sudo apt-get update -qq
          sudo apt-get install -y \
-            clang-${{ matrix.llvm_version }} llvm-${{ matrix.llvm_version }} lld-${{ matrix.llvm_version }} mold
+            clang-21 llvm-21 lld-21 mold
          for tool in clang clang++ llvm-ar llvm-nm llvm-ranlib llvm-objcopy llvm-cov llvm-symbolizer lld ld.lld; do
-            sudo update-alternatives --install /usr/bin/${tool} ${tool} /usr/bin/${tool}-${{ matrix.llvm_version }} 100
+            sudo update-alternatives --install /usr/bin/${tool} ${tool} /usr/bin/${tool}-21 100
          done

-      - name: Download MSan toolchain
-        if: matrix.msan_url != ''
-        run: |
-          curl -Ls "${{ matrix.msan_url }}" -o /tmp/msan-toolchain.tar.zst
-          sudo mkdir -p /opt/msan
-          sudo tar --zstd -xf /tmp/msan-toolchain.tar.zst -C /opt/msan
-
      - name: Build
        run: |
          export CCACHE_DIR="$GITHUB_WORKSPACE/.ccache"
@@ -145,10 +116,8 @@ jobs:
        include:
          - runner: ubuntu-latest-amd64
            arch: amd64
-            cmake_args: -DMSAN_TOOLCHAIN_PATH=/opt/msan
          - runner: ubuntu-latest-arm64
            arch: arm64
-            cmake_args: ""
    runs-on: ${{ matrix.runner }}
    steps:
      - uses: actions/checkout@v4
@@ -189,25 +158,23 @@ jobs:
          restore-keys: |
            ccache-release-${{ matrix.arch }}-

-      - name: Download MSan toolchain
-        if: matrix.arch == 'amd64'
-        run: |
-          curl -Ls "https://minio.weaselab.dev/public/x86_64/msan-toolchain-21.1.8.tar.zst" -o /tmp/msan-toolchain.tar.zst
-          sudo mkdir -p /opt/msan
-          sudo tar --zstd -xf /tmp/msan-toolchain.tar.zst -C /opt/msan
-
      - name: Build
        run: |
          export CCACHE_DIR="$GITHUB_WORKSPACE/.ccache"
          rm -rf build
-          cmake -S . -B build -G Ninja -DCMAKE_CXX_COMPILER_LAUNCHER=ccache -DCMAKE_CXX_FLAGS=-DNVALGRIND ${{ matrix.cmake_args }}
+          cmake -S . -B build -G Ninja -DCMAKE_CXX_COMPILER_LAUNCHER=ccache -DCMAKE_CXX_FLAGS=-DNVALGRIND
          ninja -C build
          ccache -s

      - name: Test
        run: |
          cd build
-          ctest --no-compress-output --test-output-size-passed 100000 --test-output-size-failed 100000 -T Test -j "$(nproc)" --timeout 90 > /dev/null
+          # On arm64, valgrind needs the MAKE_MEM_DEFINED client requests for
+          # https://git.weaselab.dev/weaselab/conflict-set/issues/39, but this
+          # build has -DNVALGRIND, which compiles them out. Skip valgrind
+          # tests here; they run annotated in the test job.
+          ctest --no-compress-output --test-output-size-passed 100000 --test-output-size-failed 100000 ${{ matrix.arch == 'arm64' && '-E valgrind' || '' }} -T Test -j "$(nproc)" --timeout 90 > /dev/null
+
      - name: Package
        run: |
          cd build
@@ -7,6 +7,7 @@
 void showMemory(const ConflictSet &cs);
 #endif

+#define ANKERL_NANOBENCH_IMPLEMENT
 #include "third_party/nanobench.h"

 constexpr int kNumKeys = 1000000;
@@ -17,48 +18,45 @@ constexpr int kPrefixLen = 0;

 constexpr int kMvccWindow = 100000;

-TrivialSpan makeKey(Arena &arena, int index) {
+std::span<const uint8_t> makeKey(Arena &arena, int index) {

-  uint8_t *buf = new (arena) uint8_t[4 + kPrefixLen];
-  auto result = TrivialSpan{buf, 4 + kPrefixLen};
+  auto result =
+      std::span<uint8_t>{new (arena) uint8_t[4 + kPrefixLen], 4 + kPrefixLen};
  index = __builtin_bswap32(index);
-  memset(buf, 0, kPrefixLen);
-  memcpy(buf, &index, 4);
+  memset(result.data(), 0, kPrefixLen);
+  memcpy(result.data() + kPrefixLen, &index, 4);

  return result;
 }

-ConflictSet::ReadRange singleton(Arena &arena, TrivialSpan key) {
-  uint8_t *buf = new (arena) uint8_t[key.size() + 1];
-  auto r = TrivialSpan(buf, key.size() + 1);
-  memcpy(buf, key.data(), key.size());
-  buf[key.size()] = 0;
+ConflictSet::ReadRange singleton(Arena &arena, std::span<const uint8_t> key) {
+  auto r =
+      std::span<uint8_t>(new (arena) uint8_t[key.size() + 1], key.size() + 1);
+  memcpy(r.data(), key.data(), key.size());
+  r[key.size()] = 0;
  return {{key.data(), int(key.size())}, {r.data(), int(r.size())}, 0};
 }

-ConflictSet::ReadRange prefixRange(Arena &arena, TrivialSpan key) {
-  int index = key.size() - 1;
-  for (; index >= 0; index--)
-    if (key[index] != 255)
+ConflictSet::ReadRange prefixRange(Arena &arena, std::span<const uint8_t> key) {
+  int index;
+  for (index = key.size() - 1; index >= 0; index--)
+    if ((key[index]) != 255)
      break;

  // Must not be called with a string that consists only of zero or more '\xff'
-  // bytes, or with an empty string (which has no finite upper bound).
+  // bytes.
  if (index < 0) {
    assert(false);
-    std::abort();
  }

-  uint8_t *buf = new (arena) uint8_t[index + 1];
-  auto r = TrivialSpan(buf, index + 1);
-  memcpy(buf, key.data(), index + 1);
-  buf[r.size() - 1]++;
+  auto r = std::span<uint8_t>(new (arena) uint8_t[index + 1], index + 1);
+  memcpy(r.data(), key.data(), index + 1);
+  r[r.size() - 1]++;
  return {{key.data(), int(key.size())}, {r.data(), int(r.size())}, 0};
 }

 void benchConflictSet() {
  ankerl::nanobench::Bench bench;
-  bench.minEpochIterations(10000);
  ConflictSet cs{0};

  bench.batch(kOpsPerTx);
@@ -84,7 +82,14 @@ void benchConflictSet() {
    ++version;
  }

-  auto points = set<TrivialSpan, std::less<>>(arena);
+  // I don't know why std::less didn't work /shrug
+  struct Less {
+    bool operator()(const std::span<const uint8_t> &lhs,
+                    const std::span<const uint8_t> &rhs) const {
+      return lhs < rhs;
+    }
+  };
+  auto points = set<std::span<const uint8_t>, Less>(arena);

  while (points.size() < kOpsPerTx * 2 + 1) {
    // TODO don't use rand?
@@ -328,22 +333,16 @@ void benchWorstCaseForRadixRangeRead() {
  auto end = std::vector<uint8_t>(kKeyLenForWorstCase - 1, 255);
  end.push_back(254);

-  weaselab::ConflictSet::ReadRange r[] = {
-      {{begin.data(), int(begin.size())}, {end.data(), int(end.size())}, 0},
-  };
-  weaselab::ConflictSet::Result results[sizeof(r) / sizeof(r[0])];
-  for (auto &result : results) {
-    result = weaselab::ConflictSet::TooOld;
-  }
-  bench.batch(sizeof(r) / sizeof(r[0]));
+  weaselab::ConflictSet::Result result;
+  weaselab::ConflictSet::ReadRange r{
+      {begin.data(), int(begin.size())}, {end.data(), int(end.size())}, 0};

  bench.run("worst case for radix tree", [&]() {
    for (int i = 0; i < 256; ++i) {
-      cs[i]->check(r, results, sizeof(r) / sizeof(r[0]));
-      for (auto result : results) {
-        if (result != weaselab::ConflictSet::Commit) {
-          abort();
-        }
+      result = weaselab::ConflictSet::TooOld;
+      cs[i]->check(&r, &result, 1);
+      if (result != weaselab::ConflictSet::Commit) {
+        abort();
      }
    }
  });
@@ -1,7 +1,7 @@
 cmake_minimum_required(VERSION 3.18)
 project(
  conflict-set
-  VERSION 0.1.0
+  VERSION 0.0.14
  DESCRIPTION
    "A data structure for optimistic concurrency control on ranges of bitwise-lexicographically-ordered keys."
  HOMEPAGE_URL "https://git.weaselab.dev/weaselab/conflict-set"
@@ -31,65 +31,22 @@ if(NOT CMAKE_BUILD_TYPE AND NOT CMAKE_CONFIGURATION_TYPES)
                                               "MinSizeRel" "RelWithDebInfo")
 endif()

-add_compile_options(
-  -Werror=switch-enum
-  -Wswitch-enum
-  -Wunused-variable
-  -fPIC
-  -fdata-sections
-  -ffunction-sections
-  -fno-jump-tables # https://github.com/llvm/llvm-project/issues/54247
-)
-
-if(CMAKE_CXX_COMPILER_ID STREQUAL "Clang")
-  add_link_options("-Wno-unused-command-line-argument")
-  find_program(LLVM_OBJCOPY llvm-objcopy)
-  if(LLVM_OBJCOPY)
-    set(CMAKE_OBJCOPY
-        ${LLVM_OBJCOPY}
-        CACHE FILEPATH "path to objcopy binary" FORCE)
-  endif()
-endif()
-
-if(CMAKE_CXX_COMPILER_ID STREQUAL "GNU")
-  add_compile_options("-Wno-maybe-uninitialized")
-  add_compile_options("-Wno-maybe-musttail-local-addr")
-endif()
-
+add_compile_options(-fdata-sections -ffunction-sections -Wswitch-enum
+                    -Werror=switch-enum -fPIC)
 if(NOT APPLE)
  # This causes some versions of clang to crash on macos
  add_compile_options(-g -fno-omit-frame-pointer)
 endif()

-set(relro_flags "LINKER:-z,relro,-z,now,-z,noexecstack")
-set(full_relro_flags "-pie;${relro_flags}")
+set(full_relro_flags "-pie;LINKER:-z,relro,-z,now,-z,noexecstack")
 cmake_push_check_state()
 list(APPEND CMAKE_REQUIRED_LINK_OPTIONS ${full_relro_flags})
 check_cxx_source_compiles("int main(){}" HAS_FULL_RELRO FAIL_REGEX "warning:")
 if(HAS_FULL_RELRO)
-  # -pie only applies to executables; passing it when linking a shared library
-  # makes the driver pull in Scrt1.o, which requires main.
-  add_link_options("$<$<STREQUAL:$<TARGET_PROPERTY:TYPE>,EXECUTABLE>:-pie>"
-                   ${relro_flags})
+  add_link_options(${full_relro_flags})
 endif()
 cmake_pop_check_state()

-if(CMAKE_SYSTEM_PROCESSOR STREQUAL aarch64 OR CMAKE_SYSTEM_PROCESSOR STREQUAL
-                                              arm64)
-  add_compile_options(-mbranch-protection=standard)
-else()
-  add_compile_options(-fcf-protection)
-  set(rewrite_endbr_flags "-fuse-ld=mold;LINKER:-z,rewrite-endbr")
-  cmake_push_check_state()
-  list(APPEND CMAKE_REQUIRED_LINK_OPTIONS ${rewrite_endbr_flags})
-  check_cxx_source_compiles("int main(){}" HAS_REWRITE_ENDBR FAIL_REGEX
-                            "warning:")
-  if(HAS_REWRITE_ENDBR)
-    add_link_options(${rewrite_endbr_flags})
-  endif()
-  cmake_pop_check_state()
-endif()
-
 set(version_script_flags
    LINKER:--version-script=${CMAKE_CURRENT_SOURCE_DIR}/linker.map)
 cmake_push_check_state()
@@ -103,28 +60,37 @@ option(USE_SIMD_FALLBACK

 option(DISABLE_TSAN "Disable TSAN" OFF)

-set(MSAN_TOOLCHAIN_PATH
-    ""
-    CACHE
-      PATH
-      "Path to an MSan-instrumented libc++ toolchain. When set, an MSan fuzz_driver target is added. Must contain include/c++/v1 and lib. See build_msan_toolchain.sh to produce one."
-)
-
 # This is encouraged according to
 # https://valgrind.org/docs/manual/manual-core-adv.html#manual-core-adv.clientreq
 include_directories(SYSTEM ${CMAKE_CURRENT_SOURCE_DIR}/third_party/valgrind)

+add_compile_options($<$<COMPILE_LANGUAGE:CXX>:-Wno-invalid-offsetof>)
+
 if(APPLE)
  add_link_options(-Wl,-dead_strip)
 else()
  add_link_options(-Wl,--gc-sections)
 endif()

-if(USE_SIMD_FALLBACK)
-  add_compile_definitions(USE_SIMD_FALLBACK)
-else()
-  if(CMAKE_SYSTEM_PROCESSOR STREQUAL x86_64)
+if(EMSCRIPTEN)
+  # https://github.com/emscripten-core/emscripten/issues/15377#issuecomment-1285167486
+  add_link_options(-lnodefs.js -lnoderawfs.js)
+  add_link_options(-s ALLOW_MEMORY_GROWTH)
+endif()
+
+if(NOT USE_SIMD_FALLBACK)
+  cmake_push_check_state()
+  list(APPEND CMAKE_REQUIRED_FLAGS -mavx)
+  check_include_file_cxx("immintrin.h" HAS_AVX)
+  if(HAS_AVX)
    add_compile_options(-mavx)
+    add_compile_definitions(HAS_AVX)
+  endif()
+  cmake_pop_check_state()
+
+  check_include_file_cxx("arm_neon.h" HAS_ARM_NEON)
+  if(HAS_ARM_NEON)
+    add_compile_definitions(HAS_ARM_NEON)
  endif()
 endif()

@@ -135,24 +101,12 @@ target_compile_options(${PROJECT_NAME}-object PRIVATE -fno-exceptions
                                                      -fvisibility=hidden)
 target_include_directories(${PROJECT_NAME}-object
                           PRIVATE ${CMAKE_CURRENT_SOURCE_DIR}/include)
-if(NOT LD_EXE)
-  set(LD_EXE ld)
-endif()
-add_custom_command(
-  OUTPUT ${CMAKE_BINARY_DIR}/${PROJECT_NAME}.o
-  COMMAND ${LD_EXE} -r $<TARGET_OBJECTS:${PROJECT_NAME}-object> -o
-          ${CMAKE_BINARY_DIR}/${PROJECT_NAME}.o
-  DEPENDS $<TARGET_OBJECTS:${PROJECT_NAME}-object>
-  COMMAND_EXPAND_LISTS)

-add_library(${PROJECT_NAME} SHARED ${CMAKE_BINARY_DIR}/${PROJECT_NAME}.o)
-add_dependencies(${PROJECT_NAME} ${PROJECT_NAME}-object)
+add_library(${PROJECT_NAME} SHARED $<TARGET_OBJECTS:${PROJECT_NAME}-object>)
 set_target_properties(
  ${PROJECT_NAME} PROPERTIES LIBRARY_OUTPUT_DIRECTORY
                             "${CMAKE_CURRENT_BINARY_DIR}/radix_tree")
-if(CMAKE_BUILD_TYPE STREQUAL Debug)
-  set_target_properties(${PROJECT_NAME} PROPERTIES LINKER_LANGUAGE CXX)
-else()
+if(NOT CMAKE_BUILD_TYPE STREQUAL Debug)
  set_target_properties(${PROJECT_NAME} PROPERTIES LINKER_LANGUAGE C)
 endif()

@@ -162,14 +116,19 @@ if(HAS_VERSION_SCRIPT)
    LINKER:--version-script=${CMAKE_CURRENT_SOURCE_DIR}/linker.map)
 endif()

-add_library(${PROJECT_NAME}-static STATIC ${CMAKE_BINARY_DIR}/${PROJECT_NAME}.o)
-add_dependencies(${PROJECT_NAME}-static ${PROJECT_NAME}-object)
-if(CMAKE_BUILD_TYPE STREQUAL Debug)
-  set_target_properties(${PROJECT_NAME}-static PROPERTIES LINKER_LANGUAGE CXX)
-else()
+add_library(${PROJECT_NAME}-static STATIC
+            $<TARGET_OBJECTS:${PROJECT_NAME}-object>)
+if(NOT CMAKE_BUILD_TYPE STREQUAL Debug)
  set_target_properties(${PROJECT_NAME}-static PROPERTIES LINKER_LANGUAGE C)
 endif()
-if(NOT APPLE)
+
+if(APPLE)
+  add_custom_command(
+    TARGET ${PROJECT_NAME}-static
+    PRE_LINK
+    COMMAND ${CMAKE_CURRENT_SOURCE_DIR}/privatize_symbols_macos.sh
+            $<TARGET_OBJECTS:${PROJECT_NAME}-object>)
+else()
  add_custom_command(
    TARGET ${PROJECT_NAME}-static
    POST_BUILD
@@ -185,8 +144,6 @@ include(CTest)
 # disable tests if this is being used through e.g. FetchContent
 if(CMAKE_SOURCE_DIR STREQUAL CMAKE_CURRENT_SOURCE_DIR AND BUILD_TESTING)

-  add_library(nanobench ${CMAKE_CURRENT_SOURCE_DIR}/nanobench.cpp)
-
  set(TEST_FLAGS -Wall -Wextra -Wunreachable-code -Wpedantic -UNDEBUG)

  # corpus tests, which are tests curated by libfuzzer. The goal is to get broad
@@ -224,20 +181,16 @@ if(CMAKE_SOURCE_DIR STREQUAL CMAKE_CURRENT_SOURCE_DIR AND BUILD_TESTING)
  target_compile_options(driver_skip_list PRIVATE ${TEST_FLAGS})
  target_link_libraries(driver_skip_list PRIVATE skip_list)

-  # enable to test skip list
-  if(0)
-    foreach(TEST ${CORPUS_TESTS})
-      get_filename_component(hash ${TEST} NAME)
-      add_test(NAME skip_list_${hash} COMMAND driver_skip_list ${TEST})
-    endforeach()
-  endif()
+  foreach(TEST ${CORPUS_TESTS})
+    get_filename_component(hash ${TEST} NAME)
+    add_test(NAME skip_list_${hash} COMMAND driver_skip_list ${TEST})
+  endforeach()

  # ad hoc testing
  add_executable(conflict_set_main ConflictSet.cpp)
  target_include_directories(conflict_set_main
                             PRIVATE ${CMAKE_CURRENT_SOURCE_DIR}/include)
  target_compile_definitions(conflict_set_main PRIVATE ENABLE_MAIN)
-  target_link_libraries(conflict_set_main PRIVATE nanobench)

  if(NOT APPLE)
    # libfuzzer target, to generate/manage corpus
@@ -260,7 +213,7 @@ if(CMAKE_SOURCE_DIR STREQUAL CMAKE_CURRENT_SOURCE_DIR AND BUILD_TESTING)
    endif()
  endif()

-  # whitebox tests asan+ubsan
+  # whitebox tests
  add_executable(fuzz_driver ConflictSet.cpp FuzzTestDriver.cpp)
  target_compile_options(fuzz_driver PRIVATE ${TEST_FLAGS})
  if(NOT CMAKE_CROSSCOMPILING)
@@ -275,34 +228,6 @@ if(CMAKE_SOURCE_DIR STREQUAL CMAKE_CURRENT_SOURCE_DIR AND BUILD_TESTING)
    add_test(NAME conflict_set_fuzz_${hash} COMMAND fuzz_driver ${TEST})
  endforeach()

-  # whitebox tests msan
-  if(MSAN_TOOLCHAIN_PATH)
-    add_executable(fuzz_driver_msan ConflictSet.cpp FuzzTestDriver.cpp)
-    target_compile_options(fuzz_driver_msan PRIVATE ${TEST_FLAGS})
-    if(NOT CMAKE_CROSSCOMPILING)
-      target_compile_options(
-        fuzz_driver_msan
-        PRIVATE -fsanitize=memory -fsanitize-memory-track-origins=2
-                $<$<COMPILE_LANGUAGE:CXX>:-stdlib=libc++>
-                -I${MSAN_TOOLCHAIN_PATH}/include/c++/v1)
-      target_link_options(
-        fuzz_driver_msan
-        PRIVATE
-        -fsanitize=memory
-        -fsanitize-memory-track-origins=2
-        -stdlib=libc++
-        -L${MSAN_TOOLCHAIN_PATH}/lib
-        LINKER:-rpath,${MSAN_TOOLCHAIN_PATH}/lib)
-    endif()
-    target_compile_definitions(fuzz_driver_msan PRIVATE ENABLE_FUZZ)
-    target_include_directories(fuzz_driver_msan
-                               PRIVATE ${CMAKE_CURRENT_SOURCE_DIR}/include)
-    foreach(TEST ${CORPUS_TESTS})
-      get_filename_component(hash ${TEST} NAME)
-      add_test(NAME conflict_set_msan_${hash} COMMAND fuzz_driver_msan ${TEST})
-    endforeach()
-  endif()
-
  # tsan tests
  if(NOT CMAKE_CROSSCOMPILING AND NOT DISABLE_TSAN)
    add_executable(tsan_driver ConflictSet.cpp FuzzTestDriver.cpp)
@@ -326,19 +251,6 @@ if(CMAKE_SOURCE_DIR STREQUAL CMAKE_CURRENT_SOURCE_DIR AND BUILD_TESTING)
    add_test(NAME conflict_set_blackbox_${hash} COMMAND driver ${TEST})
  endforeach()

-  find_program(VALGRIND_EXE valgrind)
-  if(VALGRIND_EXE AND NOT CMAKE_CROSSCOMPILING)
-    list(LENGTH CORPUS_TESTS len)
-    math(EXPR last "${len} - 1")
-    set(partition_size 100)
-    foreach(i RANGE 0 ${last} ${partition_size})
-      list(SUBLIST CORPUS_TESTS ${i} ${partition_size} partition)
-      add_test(NAME conflict_set_blackbox_valgrind_${i}
-               COMMAND ${VALGRIND_EXE} --error-exitcode=99 --
-                       $<TARGET_FILE:driver> ${partition})
-    endforeach()
-  endif()
-
  # scripted tests. Written manually to fill in anything libfuzzer couldn't
  # find.
  if(NOT CMAKE_CROSSCOMPILING)
@@ -359,14 +271,19 @@ if(CMAKE_SOURCE_DIR STREQUAL CMAKE_CURRENT_SOURCE_DIR AND BUILD_TESTING)
          ${Python3_EXECUTABLE}
          ${CMAKE_CURRENT_SOURCE_DIR}/test_conflict_set.py test ${TEST}
          --build-dir ${CMAKE_CURRENT_BINARY_DIR})
-      if(VALGRIND_EXE AND NOT CMAKE_CROSSCOMPILING)
-        add_test(
-          NAME script_test_${TEST}_valgrind
-          COMMAND
-            ${VALGRIND_EXE} ${Python3_EXECUTABLE}
-            ${CMAKE_CURRENT_SOURCE_DIR}/test_conflict_set.py test ${TEST}
-            --build-dir ${CMAKE_CURRENT_BINARY_DIR})
-      endif()
+    endforeach()
+  endif()
+
+  find_program(VALGRIND_EXE valgrind)
+  if(VALGRIND_EXE AND NOT CMAKE_CROSSCOMPILING)
+    list(LENGTH CORPUS_TESTS len)
+    math(EXPR last "${len} - 1")
+    set(partition_size 100)
+    foreach(i RANGE 0 ${last} ${partition_size})
+      list(SUBLIST CORPUS_TESTS ${i} ${partition_size} partition)
+      add_test(NAME conflict_set_blackbox_valgrind_${i}
+               COMMAND ${VALGRIND_EXE} --error-exitcode=99 --
+                       $<TARGET_FILE:driver> ${partition})
    endforeach()
  endif()

@@ -417,39 +334,9 @@ if(CMAKE_SOURCE_DIR STREQUAL CMAKE_CURRENT_SOURCE_DIR AND BUILD_TESTING)
        ${symbol_imports})
  endif()

-  if(NOT CMAKE_CROSSCOMPILING)
-    find_program(HARDENING_CHECK hardening-check)
-    if(HARDENING_CHECK)
-      # Not all versions of hardening-check support the same options, so query
-      # the help output before using architecture-specific skips.
-      execute_process(
-        COMMAND ${HARDENING_CHECK} --help
-        OUTPUT_VARIABLE hardening_check_help
-        ERROR_VARIABLE hardening_check_help
-        OUTPUT_STRIP_TRAILING_WHITESPACE ERROR_STRIP_TRAILING_WHITESPACE)
-      set(hardening_check_arch_flags "")
-      # Control flow integrity (CET) is x86-only and branch protection (PAC/BTI)
-      # is arm64-only, so ignore whichever doesn't apply.
-      if(CMAKE_SYSTEM_PROCESSOR STREQUAL aarch64 OR CMAKE_SYSTEM_PROCESSOR
-                                                    STREQUAL arm64)
-        if(hardening_check_help MATCHES "nocfprotection")
-          list(APPEND hardening_check_arch_flags --nocfprotection)
-        endif()
-      else()
-        if(hardening_check_help MATCHES "nobranchprotection")
-          list(APPEND hardening_check_arch_flags --nobranchprotection)
-        endif()
-      endif()
-      add_test(
-        NAME hardening_check
-        COMMAND ${HARDENING_CHECK} $<TARGET_FILE:${PROJECT_NAME}> --nofortify
-                --nostackprotector ${hardening_check_arch_flags})
-    endif()
-  endif()
-
  # bench
  add_executable(conflict_set_bench Bench.cpp)
-  target_link_libraries(conflict_set_bench PRIVATE ${PROJECT_NAME} nanobench)
+  target_link_libraries(conflict_set_bench PRIVATE ${PROJECT_NAME})
  set_target_properties(conflict_set_bench PROPERTIES SKIP_BUILD_RPATH ON)
  add_executable(real_data_bench RealDataBench.cpp)
  target_link_libraries(real_data_bench PRIVATE ${PROJECT_NAME})
@@ -464,14 +351,6 @@ if(CMAKE_SOURCE_DIR STREQUAL CMAKE_CURRENT_SOURCE_DIR AND BUILD_TESTING)
  add_executable(server_bench ServerBench.cpp)
  target_link_libraries(server_bench PRIVATE ${PROJECT_NAME})
  set_target_properties(server_bench PROPERTIES SKIP_BUILD_RPATH ON)
-
-  add_executable(interleaving_test InterleavingTest.cpp)
-  # work around lack of musttail for gcc
-  if(CMAKE_CXX_COMPILER_ID STREQUAL "GNU" AND CMAKE_BUILD_TYPE STREQUAL "Debug")
-    target_compile_options(interleaving_test PRIVATE -Og
-                                                     -foptimize-sibling-calls)
-  endif()
-  target_link_libraries(interleaving_test PRIVATE nanobench)
 endif()

 # packaging
@@ -0,0 +1,51 @@
+FROM ubuntu:rolling
+
+WORKDIR /tmp
+ENV HOME=/tmp
+RUN chmod -R 777 /tmp
+
+# Install apt dependencies
+RUN apt-get update
+RUN apt-get upgrade -y
+RUN TZ=America/Los_Angeles DEBIAN_FRONTEND=noninteractive apt-get install -y \
+    build-essential \
+    ccache \
+    clang \
+    cmake \
+    curl \
+    doxygen \
+    file \
+    g++-aarch64-linux-gnu \
+    gcovr \
+    git \
+    gperf \
+    graphviz \
+    libc6-dbg \
+    ninja-build \
+    pre-commit \
+    python3-requests \
+    qemu-user \
+    rpm \
+    texlive-full \
+    zstd
+
+# Install recent valgrind from source
+RUN curl -Ls https://sourceware.org/pub/valgrind/valgrind-3.22.0.tar.bz2 -o valgrind.tar.bz2 && \
+    echo "c811db5add2c5f729944caf47c4e7a65dcaabb9461e472b578765dd7bf6d2d4c  valgrind.tar.bz2" > valgrind-sha.txt && \
+    sha256sum --quiet -c valgrind-sha.txt && \
+    mkdir valgrind && \
+    tar --strip-components 1 --no-same-owner --no-same-permissions --directory valgrind -xjf valgrind.tar.bz2 && \
+    cd valgrind && \
+    ./configure --enable-only64bit --enable-lto && \
+    make -j`nproc` && \
+    make install && \
+    cd .. && \
+    rm -rf /tmp/*
+
+# Set after building valgrind, which doesn't build with clang for some reason
+ENV CC=clang
+ENV CXX=clang++
+
+# Try to have all the pre-commit hooks we'll need already initialized
+COPY .pre-commit-config.yaml /tmp/
+RUN git init && pre-commit install-hooks
@@ -96,9 +96,7 @@ void ConflictSet::setOldestVersion(int64_t oldestVersion) {
  return impl->setOldestVersion(oldestVersion);
 }

-// The hash_table implementation does not track memory usage, so return 0 to
-// satisfy the API contract that getBytes() returns a non-negative value.
-int64_t ConflictSet::getBytes() const { return 0; }
+int64_t ConflictSet::getBytes() const { return -1; }

 void ConflictSet::getMetricsV1(MetricsV1 **metrics, int *count) const {
  *metrics = nullptr;
@@ -163,10 +161,7 @@ __attribute__((__visibility__("default"))) void ConflictSet_destroy(void *cs) {
 }
 __attribute__((__visibility__("default"))) int64_t
 ConflictSet_getBytes(void *cs) {
-  (void)cs;
-  // The hash_table implementation does not track memory usage, so return 0 to
-  // satisfy the API contract that ConflictSet_getBytes returns a non-negative
-  // value.
-  return 0;
+  using Impl = ConflictSet::Impl;
+  return -1;
 }
 }
@@ -1,256 +0,0 @@
-#include <alloca.h>
-#include <cassert>
-#ifdef __x86_64__
-#include <immintrin.h>
-#endif
-
-#include "third_party/nanobench.h"
-
-struct Job {
-  int *input;
-  // Returned void* is a function pointer to the next continuation. We have to
-  // use void* because otherwise the type would be recursive.
-  typedef void *(*continuation)(Job *);
-  continuation next;
-};
-
-void *stepJob(Job *j) {
-  auto done = --(*j->input) == 0;
-#ifdef __x86_64__
-  _mm_clflush(j->input);
-#endif
-  return done ? nullptr : (void *)stepJob;
-}
-
-void sequential(Job **jobs, int count) {
-  for (int i = 0; i < count; ++i) {
-    do {
-      jobs[i]->next = (Job::continuation)jobs[i]->next(jobs[i]);
-    } while (jobs[i]->next);
-  }
-}
-
-void sequentialNoFuncPtr(Job **jobs, int count) {
-  for (int i = 0; i < count; ++i) {
-    while (stepJob(jobs[i]))
-      ;
-  }
-}
-
-void interleaveSwapping(Job **jobs, int remaining) {
-  int current = 0;
-  while (remaining > 0) {
-    auto next = (Job::continuation)jobs[current]->next(jobs[current]);
-    jobs[current]->next = next;
-    if (next == nullptr) {
-      jobs[current] = jobs[remaining - 1];
-      --remaining;
-    } else {
-      ++current;
-    }
-    if (current == remaining) {
-      current = 0;
-    }
-  }
-}
-
-void interleaveBoundedCyclicList(Job **jobs, int count) {
-  if (count == 0) {
-    return;
-  }
-
-  constexpr int kConcurrent = 32;
-  Job *inProgress[kConcurrent];
-  int nextJob[kConcurrent];
-
-  int started = std::min(kConcurrent, count);
-  for (int i = 0; i < started; i++) {
-    inProgress[i] = jobs[i];
-    nextJob[i] = i + 1;
-  }
-  nextJob[started - 1] = 0;
-
-  int prevJob = started - 1;
-  int job = 0;
-  for (;;) {
-    auto next = (Job::continuation)inProgress[job]->next(inProgress[job]);
-    inProgress[job]->next = next;
-    if (next == nullptr) {
-      if (started == count) {
-        if (prevJob == job)
-          break;
-        nextJob[prevJob] = nextJob[job];
-        job = prevJob;
-      } else {
-        int temp = started++;
-        inProgress[job] = jobs[temp];
-      }
-    }
-    prevJob = job;
-    job = nextJob[job];
-  }
-}
-
-#ifndef __has_attribute
-#define __has_attribute(x) 0
-#endif
-
-#if __has_attribute(musttail)
-#define MUSTTAIL __attribute__((musttail))
-#else
-#define MUSTTAIL
-#endif
-
-struct Context {
-  constexpr static int kConcurrent = 32;
-  Job **jobs;
-  Job *inProgress[kConcurrent];
-  void (*continuation[kConcurrent])(Context *, int64_t prevJob, int64_t job,
-                                    int64_t started, int64_t count);
-  int nextJob[kConcurrent];
-};
-
-void keepGoing(Context *context, int64_t prevJob, int64_t job, int64_t started,
-               int64_t count) {
-  prevJob = job;
-  job = context->nextJob[job];
-  MUSTTAIL return context->continuation[job](context, prevJob, job, started,
-                                             count);
-}
-
-void stepJobTailCall(Context *context, int64_t prevJob, int64_t job,
-                     int64_t started, int64_t count);
-
-void complete(Context *context, int64_t prevJob, int64_t job, int64_t started,
-              int64_t count) {
-  if (started == count) {
-    if (prevJob == job) {
-      return;
-    }
-    context->nextJob[prevJob] = context->nextJob[job];
-    job = prevJob;
-  } else {
-    context->inProgress[job] = context->jobs[started++];
-    context->continuation[job] = stepJobTailCall;
-  }
-  prevJob = job;
-  job = context->nextJob[job];
-  MUSTTAIL return context->continuation[job](context, prevJob, job, started,
-                                             count);
-}
-
-void stepJobTailCall(Context *context, int64_t prevJob, int64_t job,
-                     int64_t started, int64_t count) {
-  auto *j = context->inProgress[job];
-  auto done = --(*j->input) == 0;
-#ifdef __x86_64__
-  _mm_clflush(j->input);
-#endif
-  if (done) {
-    MUSTTAIL return complete(context, prevJob, job, started, count);
-  } else {
-    context->continuation[job] = stepJobTailCall;
-    MUSTTAIL return keepGoing(context, prevJob, job, started, count);
-  }
-}
-
-void useTailCalls(Job **jobs, int count) {
-  if (count == 0) {
-    return;
-  }
-  Context context;
-  context.jobs = jobs;
-  int64_t started = std::min(Context::kConcurrent, count);
-  for (int i = 0; i < started; i++) {
-    context.inProgress[i] = jobs[i];
-    context.nextJob[i] = i + 1;
-    context.continuation[i] = stepJobTailCall;
-  }
-  context.nextJob[started - 1] = 0;
-  int prevJob = started - 1;
-  int job = 0;
-  return context.continuation[job](&context, prevJob, job, started, count);
-}
-
-void interleaveCyclicList(Job **jobs, int count) {
-  auto *nextJob = (int *)alloca(sizeof(int) * count);
-
-  for (int i = 0; i < count - 1; ++i) {
-    nextJob[i] = i + 1;
-  }
-  nextJob[count - 1] = 0;
-
-  int prevJob = count - 1;
-  int job = 0;
-  for (;;) {
-    auto next = (Job::continuation)jobs[job]->next(jobs[job]);
-    jobs[job]->next = next;
-    if (next == nullptr) {
-      if (prevJob == job)
-        break;
-      nextJob[prevJob] = nextJob[job];
-      job = prevJob;
-    }
-    prevJob = job;
-    job = nextJob[job];
-  }
-}
-
-int main() {
-  ankerl::nanobench::Bench bench;
-
-  constexpr int kNumJobs = 10000;
-  bench.relative(true);
-
-  Job jobs[kNumJobs];
-  Job jobsCopy[kNumJobs];
-  int iters = 0;
-  int originalInput[kNumJobs];
-  for (int i = 0; i < kNumJobs; ++i) {
-    originalInput[i] = rand() % 5 + 3;
-    jobs[i].input = new int{originalInput[i]};
-    jobs[i].next = stepJob;
-    iters += *jobs[i].input;
-  }
-  bench.batch(iters);
-
-  for (auto [scheduler, name] :
-       {std::make_pair(sequentialNoFuncPtr, "sequentialNoFuncPtr"),
-        std::make_pair(sequential, "sequential"),
-        std::make_pair(useTailCalls, "useTailCalls"),
-        std::make_pair(interleaveSwapping, "interleavingSwapping"),
-        std::make_pair(interleaveBoundedCyclicList,
-                       "interleaveBoundedCyclicList"),
-        std::make_pair(interleaveCyclicList, "interleaveCyclicList")}) {
-    for (int i = 0; i < kNumJobs; ++i) {
-      *jobs[i].input = originalInput[i];
-    }
-    memcpy(jobsCopy, jobs, sizeof(jobs));
-    Job *ps[kNumJobs];
-    for (int i = 0; i < kNumJobs; ++i) {
-      ps[i] = jobsCopy + i;
-    }
-    scheduler(ps, kNumJobs);
-    for (int i = 0; i < kNumJobs; ++i) {
-      if (*jobsCopy[i].input != 0) {
-        fprintf(stderr, "%s failed\n", name);
-        abort();
-      }
-    }
-
-    bench.run(name, [&]() {
-      for (int i = 0; i < kNumJobs; ++i) {
-        *jobs[i].input = originalInput[i];
-      }
-      memcpy(jobsCopy, jobs, sizeof(jobs));
-      Job *ps[kNumJobs];
-      for (int i = 0; i < kNumJobs; ++i) {
-        ps[i] = jobsCopy + i;
-      }
-      scheduler(ps, kNumJobs);
-    });
-  }
-  for (int i = 0; i < kNumJobs; ++i) {
-    delete jobs[i].input;
-  }
-}
@@ -18,6 +18,7 @@ using namespace weaselab;
 #include <span>
 #include <string>
 #include <thread>
+#include <unordered_set>
 #include <utility>

 #include <callgrind.h>
@@ -25,38 +26,9 @@ using namespace weaselab;
 #define DEBUG_VERBOSE 0
 #define SHOW_MEMORY 0

-// std::span is not trivially constructible. We want a span that leaves its
-// members uninitialized for performance reasons.
-struct TrivialSpan {
-  TrivialSpan() = default;
-  TrivialSpan(const uint8_t *begin, int len) : begin(begin), len(len) {}
-
-  uint8_t back() const {
-    assert(len > 0);
-    return begin[len - 1];
-  }
-  uint8_t front() const {
-    assert(len > 0);
-    return begin[0];
-  }
-  uint8_t operator[](int i) const {
-    assert(0 <= i);
-    assert(i < len);
-    return begin[i];
-  }
-  int size() const { return len; }
-  TrivialSpan subspan(int offset, int len) { return {begin + offset, len}; }
-  const uint8_t *data() const { return begin; }
-
-private:
-  const uint8_t *begin;
-  int len;
-};
-
-static_assert(std::is_trivial_v<TrivialSpan>);
-
-[[nodiscard]] inline auto operator<=>(const TrivialSpan &lhs,
-                                      const TrivialSpan &rhs) noexcept {
+[[nodiscard]] inline auto
+operator<=>(const std::span<const uint8_t> &lhs,
+            const std::span<const uint8_t> &rhs) noexcept {
  int cl = std::min<int>(lhs.size(), rhs.size());
  if (cl > 0) {
    if (auto c = memcmp(lhs.data(), rhs.data(), cl) <=> 0; c != 0) {
@@ -66,7 +38,7 @@ static_assert(std::is_trivial_v<TrivialSpan>);
  return lhs.size() <=> rhs.size();
 }

-[[nodiscard]] inline auto operator<=>(const TrivialSpan &lhs,
+[[nodiscard]] inline auto operator<=>(const std::span<const uint8_t> &lhs,
                                      const ConflictSet::Key &rhs) noexcept {
  int cl = std::min<int>(lhs.size(), rhs.len);
  if (cl > 0) {
@@ -74,18 +46,7 @@ static_assert(std::is_trivial_v<TrivialSpan>);
      return c;
    }
  }
-  return lhs.size() <=> rhs.len;
-}
-
-[[nodiscard]] inline auto operator<=>(const ConflictSet::Key &lhs,
-                                      const ConflictSet::Key &rhs) noexcept {
-  int cl = std::min<int>(lhs.len, rhs.len);
-  if (cl > 0) {
-    if (auto c = memcmp(lhs.p, rhs.p, cl) <=> 0; c != 0) {
-      return c;
-    }
-  }
-  return lhs.len <=> rhs.len;
+  return lhs.size() <=> size_t(rhs.len);
 }

 // This header contains code that we want to reuse outside of ConflictSet.cpp or
@@ -367,6 +328,23 @@ template <class T, class C = std::less<T>> auto set(Arena &arena) {
  return Set<T, C>(ArenaAlloc<T>(&arena));
 }

+template <class T> struct MyHash;
+
+template <class T> struct MyHash<T *> {
+  size_t operator()(const T *t) const noexcept {
+    size_t result;
+    memcpy(&result, &t, sizeof(result));
+    return result;
+  }
+};
+
+template <class T>
+using HashSet =
+    std::unordered_set<T, MyHash<T>, std::equal_to<T>, ArenaAlloc<T>>;
+template <class T> auto hashSet(Arena &arena) {
+  return HashSet<T>(ArenaAlloc<T>(&arena));
+}
+
 template <class T, class U>
 bool operator==(const ArenaAlloc<T> &lhs, const ArenaAlloc<U> &rhs) {
  return lhs.arena == rhs.arena;
@@ -560,7 +538,7 @@ struct ReferenceImpl {

 using Key = ConflictSet::Key;

-inline Key operator""_s(const char *str, size_t size) {
+inline Key operator"" _s(const char *str, size_t size) {
  return {reinterpret_cast<const uint8_t *>(str), int(size)};
 }

@@ -591,7 +569,7 @@ inline std::string printable(const Key &key) {
  return printable(std::string_view((const char *)key.p, key.len));
 }

-inline std::string printable(TrivialSpan key) {
+inline std::string printable(std::span<const uint8_t> key) {
  return printable(std::string_view((const char *)key.data(), key.size()));
 }

@@ -699,8 +677,10 @@ struct TestDriver {
            arbitrary->randomBytes(begin + prefixLen, keyLen - prefixLen);
            writes[i].end.len = keyLen;
            writes[i].end.p = begin;
-            auto c = TrivialSpan(writes[i].begin.p, writes[i].begin.len) <=>
-                     TrivialSpan(writes[i].end.p, writes[i].end.len);
+            auto c =
+                std::span<const uint8_t>(writes[i].begin.p,
+                                         writes[i].begin.len) <=>
+                std::span<const uint8_t>(writes[i].end.p, writes[i].end.len);
            if (c > 0) {
              using std::swap;
              swap(writes[i].begin, writes[i].end);
@@ -0,0 +1,151 @@
+def CleanBuildAndTest(String cmakeArgs) {
+    sh """
+    export CCACHE_DIR=/ccache
+    rm -rf build
+    mkdir build
+    cd build
+    cmake .. -G Ninja -DCMAKE_CXX_COMPILER_LAUNCHER=ccache ${cmakeArgs} 
+    ninja
+    ccache -s
+    """
+    catchError {
+        sh '''
+        cd build
+        ctest --no-compress-output --test-output-size-passed 100000 --test-output-size-failed 100000 -T Test -j `nproc` --timeout 90
+        zstd Testing/*/Test.xml
+        '''
+    }
+    xunit tools: [CTest(pattern: 'build/Testing/*/Test.xml')], reduceLog: false, skipPublishingChecks: false
+    minio bucket: 'jenkins', credentialsId: 'jenkins-minio', excludes: '', host: 'minio.weaselab.dev', includes: 'build/Testing/*/Test.xml.zst', targetFolder: '${JOB_NAME}/${BUILD_NUMBER}/${STAGE_NAME}/'
+}
+
+pipeline {
+    agent any
+    stages {
+        stage('Pre-commit') {
+            agent {
+                dockerfile {
+                    args '-v /home/jenkins/ccache:/ccache'
+                    reuseNode true
+                }
+            }
+            steps {
+                script {
+                    env.HOME = env.WORKSPACE
+                }
+                sh 'pre-commit run --all-files --show-diff-on-failure'
+            }
+        }
+        stage('Clang') {
+            agent {
+                dockerfile {
+                    args '-v /home/jenkins/ccache:/ccache'
+                    reuseNode true
+                }
+            }
+            steps {
+                CleanBuildAndTest("")
+                recordIssues(tools: [clang()])
+            }
+        }
+        stage('64 bit versions') {
+            agent {
+                dockerfile {
+                    args '-v /home/jenkins/ccache:/ccache'
+                    reuseNode true
+                }
+            }
+            steps {
+                CleanBuildAndTest("-DCMAKE_CXX_FLAGS=-DUSE_64_BIT=1")
+            }
+        }
+        stage('Debug') {
+            agent {
+                dockerfile {
+                    args '-v /home/jenkins/ccache:/ccache'
+                    reuseNode true
+                }
+            }
+            steps {
+                CleanBuildAndTest("-DCMAKE_BUILD_TYPE=Debug")
+            }
+        }
+        stage('SIMD fallback') {
+            agent {
+                dockerfile {
+                    args '-v /home/jenkins/ccache:/ccache'
+                    reuseNode true
+                }
+            }
+            steps {
+                CleanBuildAndTest("-DUSE_SIMD_FALLBACK=ON")
+            }
+        }
+        stage('Release [gcc]') {
+            agent {
+                dockerfile {
+                    args '-v /home/jenkins/ccache:/ccache'
+                    reuseNode true
+                }
+            }
+            steps {
+                CleanBuildAndTest("-DCMAKE_C_COMPILER=gcc -DCMAKE_CXX_COMPILER=g++ -DCMAKE_CXX_FLAGS=-DNVALGRIND")
+                recordIssues(tools: [gcc()])
+                sh '''
+                cd build
+                cpack -G DEB
+                cpack -G RPM
+                '''
+                sh '''
+                cd paper
+                make
+                '''
+                minio bucket: 'jenkins', credentialsId: 'jenkins-minio', excludes: '', host: 'minio.weaselab.dev', includes: 'build/*.deb,build/*.rpm,paper/*.pdf', targetFolder: '${JOB_NAME}/${BUILD_NUMBER}/${STAGE_NAME}/'
+            }
+        }
+        stage('Release [gcc,aarch64]') {
+            agent {
+                dockerfile {
+                    args '-v /home/jenkins/ccache:/ccache'
+                    reuseNode true
+                }
+            }
+            steps {
+                CleanBuildAndTest("-DCMAKE_TOOLCHAIN_FILE=../aarch64-toolchain.cmake -DCMAKE_CXX_FLAGS=-DNVALGRIND")
+                sh '''
+                cd build
+                cpack -G DEB
+                cpack -G RPM
+                '''
+                minio bucket: 'jenkins', credentialsId: 'jenkins-minio', excludes: '', host: 'minio.weaselab.dev', includes: 'build/*.deb,build/*.rpm', targetFolder: '${JOB_NAME}/${BUILD_NUMBER}/${STAGE_NAME}'
+            }
+        }
+        stage('Coverage') {
+            agent {
+                dockerfile {
+                    args '-v /home/jenkins/ccache:/ccache'
+                    reuseNode true
+                }
+            }
+            steps {
+                script {
+                    filter_args = "-f ConflictSet.cpp -f LongestCommonPrefix.h"
+                }
+                CleanBuildAndTest("-DCMAKE_C_COMPILER=gcc -DCMAKE_CXX_COMPILER=g++ -DCMAKE_C_FLAGS=--coverage -DCMAKE_CXX_FLAGS=--coverage -DCMAKE_BUILD_TYPE=Debug -DDISABLE_TSAN=ON")
+                sh """
+                gcovr ${filter_args} --cobertura > build/coverage.xml
+                """
+                recordCoverage qualityGates: [[criticality: 'NOTE', metric: 'MODULE']], tools: [[parser: 'COBERTURA', pattern: 'build/coverage.xml']]
+                sh """
+                gcovr ${filter_args}
+                gcovr ${filter_args} --fail-under-line 100 > /dev/null
+                """
+            }
+        }
+    }
+    post {
+        always {
+            emailext mimeType: 'text/html', body: '${SCRIPT, template="groovy-html.template"}', subject: "${env.JOB_NAME} - Build# ${env.BUILD_NUMBER} - ${currentBuild.currentResult}", to: 'andrew@weaselab.dev'
+        }
+    }
+}
@@ -182,4 +182,4 @@ longestCommonPrefix(const uint8_t *ap, const uint8_t *bp, int cl) {
  }

  return i;
-}
+}
@@ -1,64 +0,0 @@
-#pragma once
-
-#include "ConflictSet.h"
-#include "Internal.h"
-
-#include <assert.h>
-#include <atomic>
-#include <tuple>
-
-struct Metric {
-  Metric *prev;
-  const char *name;
-  const char *help;
-  weaselab::ConflictSet::MetricsV1::Type type;
-  std::atomic<int64_t> value;
-
-protected:
-  Metric(Metric *&metricList, int &metricsCount, const char *name,
-         const char *help, weaselab::ConflictSet::MetricsV1::Type type)
-      : prev(std::exchange(metricList, this)), name(name), help(help),
-        type(type), value(0) {
-    ++metricsCount;
-  }
-};
-
-struct Gauge : private Metric {
-  Gauge(Metric *&metricList, int &metricsCount, const char *name,
-        const char *help)
-      : Metric(metricList, metricsCount, name, help,
-               weaselab::ConflictSet::MetricsV1::Gauge) {}
-
-  void set(int64_t value) {
-    this->value.store(value, std::memory_order_relaxed);
-  }
-};
-
-struct Counter : private Metric {
-  Counter(Metric *&metricList, int &metricsCount, const char *name,
-          const char *help)
-      : Metric(metricList, metricsCount, name, help,
-               weaselab::ConflictSet::MetricsV1::Counter) {}
-  // Expensive. Accumulate locally and then call add instead of repeatedly
-  // calling add.
-  void add(int64_t value) {
-    assert(value >= 0);
-    static_assert(std::atomic<int64_t>::is_always_lock_free);
-    this->value.fetch_add(value, std::memory_order_relaxed);
-  }
-};
-
-inline weaselab::ConflictSet::MetricsV1 *initMetrics(Metric *metricsList,
-                                                     int metricsCount) {
-  weaselab::ConflictSet::MetricsV1 *metrics =
-      (weaselab::ConflictSet::MetricsV1 *)safe_malloc(metricsCount *
-                                                      sizeof(metrics[0]));
-  for (auto [i, m] = std::make_tuple(metricsCount - 1, metricsList); i >= 0;
-       --i, m = m->prev) {
-    metrics[i].name = m->name;
-    metrics[i].help = m->help;
-    metrics[i].p = m;
-    metrics[i].type = m->type;
-  }
-  return metrics;
-}
@@ -19,30 +19,30 @@ InstalledDir: /usr/lib/llvm-21/bin

 |               ns/op |                op/s |    err% |          ins/op |          cyc/op |    IPC |         bra/op |   miss% |     total | benchmark
 |--------------------:|--------------------:|--------:|----------------:|----------------:|-------:|---------------:|--------:|----------:|:----------
-|              164.29 |        6,086,873.38 |    0.0% |        3,107.03 |          604.19 |  5.142 |         558.59 |    0.0% |      1.96 | `point reads`
-|              161.05 |        6,209,395.38 |    0.1% |        3,036.76 |          592.21 |  5.128 |         539.35 |    0.0% |      1.93 | `prefix reads`
-|              239.55 |        4,174,539.38 |    0.1% |        3,722.71 |          880.68 |  4.227 |         692.00 |    0.0% |      2.86 | `range reads`
-|              354.75 |        2,818,919.14 |    0.7% |        4,523.64 |        1,304.75 |  3.467 |         720.22 |    2.0% |      4.23 | `point writes`
-|              345.32 |        2,895,878.47 |    0.1% |        4,484.57 |        1,270.31 |  3.530 |         705.00 |    1.8% |      4.12 | `prefix writes`
-|              193.48 |        5,168,547.42 |    0.1% |        2,224.10 |          711.72 |  3.125 |         377.17 |    3.3% |      2.32 | `range writes`
-|              404.89 |        2,469,777.50 |    2.4% |        6,855.96 |        1,489.70 |  4.602 |       1,227.82 |    1.3% |      0.05 | `monotonic increasing point writes`
-|          134,231.80 |            7,449.80 |    1.9% |      812,045.25 |      495,770.40 |  1.638 |     151,246.50 |    0.9% |      0.01 | `worst case for radix tree`
-|               37.80 |       26,454,311.17 |    0.4% |          701.00 |          139.14 |  5.038 |         102.00 |    0.0% |      0.01 | `create and destroy`
+|              171.37 |        5,835,467.28 |    0.5% |        2,915.46 |          629.31 |  4.633 |         502.91 |    0.0% |      0.01 | `point reads`
+|              168.16 |        5,946,774.62 |    0.5% |        2,859.73 |          619.03 |  4.620 |         488.59 |    0.0% |      0.01 | `prefix reads`
+|              245.86 |        4,067,294.63 |    0.3% |        3,508.97 |          904.82 |  3.878 |         627.73 |    0.0% |      0.01 | `range reads`
+|              381.14 |        2,623,691.76 |    0.2% |        5,127.16 |        1,402.60 |  3.655 |         830.59 |    1.7% |      0.01 | `point writes`
+|              376.24 |        2,657,887.07 |    0.3% |        5,062.85 |        1,381.07 |  3.666 |         811.68 |    1.6% |      0.01 | `prefix writes`
+|              257.09 |        3,889,688.44 |    3.8% |        3,010.09 |          949.42 |  3.170 |         521.34 |    2.9% |      0.01 | `range writes`
+|              629.71 |        1,588,026.28 |    4.0% |        6,809.60 |        2,320.32 |  2.935 |       1,247.08 |    1.3% |      0.01 | `monotonic increasing point writes`
+|          126,164.50 |            7,926.16 |    1.7% |      772,460.25 |      463,264.67 |  1.667 |     141,512.00 |    0.2% |      0.01 | `worst case for radix tree`
+|               15.33 |       65,217,669.23 |    0.4% |          299.00 |           56.45 |  5.297 |          64.00 |    0.0% |      0.01 | `create and destroy`

 ## Radix tree (this implementation)


 |               ns/op |                op/s |    err% |          ins/op |          cyc/op |    IPC |         bra/op |   miss% |     total | benchmark
 |--------------------:|--------------------:|--------:|----------------:|----------------:|-------:|---------------:|--------:|----------:|:----------
-|               12.89 |       77,565,115.56 |    0.1% |          244.55 |           47.43 |  5.155 |          34.21 |    0.6% |      0.15 | `point reads`
-|               15.11 |       66,162,047.76 |    0.1% |          297.79 |           55.60 |  5.356 |          43.23 |    0.4% |      0.18 | `prefix reads`
-|               36.29 |       27,559,358.29 |    0.1% |          783.16 |          133.44 |  5.869 |         109.52 |    0.2% |      0.43 | `range reads`
-|               20.53 |       48,719,405.55 |    0.1% |          381.81 |           75.51 |  5.057 |          51.04 |    0.5% |      0.25 | `point writes`
-|               39.37 |       25,402,042.40 |    0.1% |          685.00 |          144.83 |  4.730 |         106.72 |    0.3% |      0.47 | `prefix writes`
-|               43.78 |       22,843,841.63 |    0.1% |          800.40 |          161.06 |  4.970 |         127.36 |    0.1% |      0.53 | `range writes`
-|               78.37 |       12,760,008.75 |    1.0% |        1,452.61 |          288.24 |  5.040 |         278.69 |    0.1% |      0.01 | `monotonic increasing point writes`
-|          322,885.50 |            3,097.07 |    1.5% |    4,362,382.00 |    1,183,852.00 |  3.685 |     765,301.00 |    0.1% |      0.01 | `worst case for radix tree`
-|               99.99 |       10,000,718.79 |    0.4% |        1,775.00 |          367.93 |  4.824 |         288.00 |    0.0% |      0.01 | `create and destroy`
+|               12.81 |       78,088,759.03 |    0.7% |          187.38 |           47.15 |  3.974 |          33.70 |    0.5% |      0.01 | `point reads`
+|               16.77 |       59,626,501.14 |    0.4% |          277.61 |           61.74 |  4.497 |          44.76 |    0.4% |      0.01 | `prefix reads`
+|               42.45 |       23,556,818.87 |    0.4% |          856.96 |          156.09 |  5.490 |         126.22 |    0.2% |      0.01 | `range reads`
+|               15.76 |       63,453,196.94 |    0.3% |          249.89 |           58.04 |  4.306 |          33.21 |    0.5% |      0.01 | `point writes`
+|               29.71 |       33,662,499.39 |    0.1% |          509.14 |          109.33 |  4.657 |          70.26 |    0.5% |      0.01 | `prefix writes`
+|               35.77 |       27,956,388.03 |    0.8% |          614.18 |          131.72 |  4.663 |          85.57 |    0.1% |      0.01 | `range writes`
+|               80.13 |       12,480,456.47 |    1.5% |        1,279.04 |          294.90 |  4.337 |         234.68 |    0.1% |      0.01 | `monotonic increasing point writes`
+|          360,748.00 |            2,772.02 |    2.6% |    4,401,835.00 |    1,318,754.00 |  3.338 |     728,537.00 |    0.0% |      0.01 | `worst case for radix tree`
+|               90.69 |       11,027,103.45 |    1.0% |        1,686.00 |          333.80 |  5.051 |         284.00 |    0.0% |      0.01 | `create and destroy`

 # "Real data" test

@@ -51,13 +51,13 @@ Point queries only. Gc ratio is the ratio of time spent doing garbage collection
 ## skip list

 ```
-Check: 4.62967 seconds, 352.195 MB/s, Add: 3.34177 seconds, 167.771 MB/s, Gc ratio: 37.9399%, Peak idle memory: 5.51852e+06
+Check: 4.42779 seconds, 368.253 MB/s, Add: 4.64942 seconds, 120.586 MB/s, Gc ratio: 28.8784%, Peak idle memory: 5.51735e+06
 ```

 ## radix tree

 ```
-Check: 1.00477 seconds, 1622.8 MB/s, Add: 1.21142 seconds, 462.808 MB/s, Gc ratio: 39.4716%, Peak idle memory: 2.0226e+06
+Check: 0.891163 seconds, 1829.69 MB/s, Add: 1.23064 seconds, 455.579 MB/s, Gc ratio: 42.9417%, Peak idle memory: 2.28333e+06
 ```

 ## hash table
@@ -65,6 +65,6 @@ Check: 1.00477 seconds, 1622.8 MB/s, Add: 1.21142 seconds, 462.808 MB/s, Gc rati
 (The hash table implementation doesn't work on range queries, and its purpose is to provide an idea of how fast point queries can be)

 ```
-Check: 0.854254 seconds, 1908.74 MB/s, Add: 0.632626 seconds, 886.232 MB/s, Gc ratio: 41.0827%, Peak idle memory: 0
+Check: 0.858484 seconds, 1899.33 MB/s, Add: 0.632886 seconds, 885.868 MB/s, Gc ratio: 41.252%, Peak idle memory: 0
 ```

@@ -1,12 +1,11 @@
 #include <ConflictSet.h>

-#include <algorithm>
 #include <cerrno>
 #include <chrono>
 #include <cstdio>
 #include <cstring>
 #include <fcntl.h>
-#include <span>
+#include <string_view>
 #include <sys/mman.h>
 #include <sys/stat.h>
 #include <unistd.h>
@@ -65,7 +64,7 @@ int main(int argc, const char **argv) {
    auto *const mapOriginal = begin;
    const auto sizeOriginal = size;

-    using StringView = std::span<const uint8_t>;
+    using StringView = std::basic_string_view<uint8_t>;

    StringView write;
    std::vector<StringView> reads;
@@ -78,10 +77,10 @@ int main(int argc, const char **argv) {
      begin = end + 1;
      end = (uint8_t *)memchr(begin, '\n', size);

-      if (line.size() >= 2 && line[0] == 'P') {
-        write = line.subspan(2, line.size() - 2);
-      } else if (line.size() >= 2 && line[0] == 'L') {
-        reads.push_back(line.subspan(2, line.size() - 2));
+      if (line.size() > 0 && line[0] == 'P') {
+        write = line.substr(2, line.size());
+      } else if (line.size() > 0 && line[0] == 'L') {
+        reads.push_back(line.substr(2, line.size()));
      } else if (line.empty()) {
        {
          readRanges.resize(reads.size());
@@ -91,7 +90,7 @@ int main(int argc, const char **argv) {
            iter->begin.len = read.size();
            checkBytes += read.size();
            iter->end.len = 0;
-            iter->readVersion = std::max<int64_t>(0, version - 100);
+            iter->readVersion = version - 100;
            ++iter;
          }
        }
@@ -122,7 +121,7 @@ int main(int argc, const char **argv) {
        }

        timer = now();
-        cs.setOldestVersion(std::max<int64_t>(0, version - 10000));
+        cs.setOldestVersion(version - 10000);
        gcTime += now() - timer;
      }
    }
@@ -134,10 +133,10 @@ int main(int argc, const char **argv) {
  int metricsCount;
  cs.getMetricsV1(&metrics, &metricsCount);
  for (int i = 0; i < metricsCount; ++i) {
-    fprintf(stderr, "# HELP %s %s\n", metrics[i].name, metrics[i].help);
-    fprintf(stderr, "# TYPE %s %s\n", metrics[i].name,
-            metrics[i].type == metrics[i].Counter ? "counter" : "gauge");
-    fprintf(stderr, "%s %g\n", metrics[i].name, metrics[i].getValue());
+    printf("# HELP %s %s\n", metrics[i].name, metrics[i].help);
+    printf("# TYPE %s %s\n", metrics[i].name,
+           metrics[i].type == metrics[i].Counter ? "counter" : "gauge");
+    printf("%s %g\n", metrics[i].name, metrics[i].getValue());
  }

  printf("Check: %g seconds, %g MB/s, Add: %g seconds, %g MB/s, Gc ratio: "
@@ -1,7 +1,4 @@
-#include <algorithm>
 #include <atomic>
-#include <cstdint>
-#include <cstdlib>
 #include <errno.h>
 #include <netdb.h>
 #include <stdio.h>
@@ -12,7 +9,6 @@
 #include <sys/ioctl.h>
 #include <sys/resource.h>
 #include <sys/socket.h>
-#include <sys/syscall.h>
 #include <sys/types.h>
 #include <sys/uio.h>
 #include <thread>
@@ -21,210 +17,84 @@
 #include <vector>

 #include "ConflictSet.h"
-#include "Internal.h"
 #include "third_party/nadeau.h"

-constexpr int kCacheLine = 64; // TODO mac m1 is 128
-
-template <class T> struct TxQueue {
-
-  explicit TxQueue(int lgSlotCount)
-      : slotCount(1 << lgSlotCount), slotCountMask(slotCount - 1),
-        slots(new T[slotCount]) {
-    // Otherwise we can't tell the difference between full and empty.
-    assert(!(slotCountMask & 0x80000000));
-  }
-
-  /// Call from producer thread, after ensuring consumer is no longer accessing
-  /// it somehow
-  ~TxQueue() { delete[] slots; }
-
-  /// Must be called from the producer thread
-  void push(T t) {
-    if (wouldBlock()) {
-      // Wait for pops to change and try again
-      consumer.pops.wait(producer.lastPopRead, std::memory_order_relaxed);
-      producer.lastPopRead = consumer.pops.load(std::memory_order_acquire);
-    }
-    slots[producer.pushesNonAtomic++ & slotCountMask] = std::move(t);
-    // seq_cst so that the notify can't be ordered before the store
-    producer.pushes.store(producer.pushesNonAtomic, std::memory_order_seq_cst);
-    // We have to notify every time, since we don't know if this is the last
-    // push ever
-    producer.pushes.notify_one();
-  }
-
-  /// Must be called from the producer thread
-  uint32_t outstanding() {
-    return producer.pushesNonAtomic -
-           consumer.pops.load(std::memory_order_relaxed);
-  }
-
-  /// Returns true if a call to push might block. Must be called from the
-  /// producer thread.
-  bool wouldBlock() {
-    // See if we can determine that overflow won't happen entirely from state
-    // local to the producer
-    if (producer.pushesNonAtomic - producer.lastPopRead == slotCount - 1) {
-      // Re-read pops with memory order
-      producer.lastPopRead = consumer.pops.load(std::memory_order_acquire);
-      return producer.pushesNonAtomic - producer.lastPopRead == slotCount - 1;
-    }
-    return false;
-  }
-
-  /// Valid until the next pop, or until this queue is destroyed.
-  T *pop() {
-    // See if we can determine that there's an entry we can pop entirely from
-    // state local to the consumer
-    if (consumer.lastPushRead - consumer.popsNonAtomic == 0) {
-      // Re-read pushes with memory order and try again
-      consumer.lastPushRead = producer.pushes.load(std::memory_order_acquire);
-      if (consumer.lastPushRead - consumer.popsNonAtomic == 0) {
-        // Wait for pushes to change and try again
-        producer.pushes.wait(consumer.lastPushRead, std::memory_order_relaxed);
-        consumer.lastPushRead = producer.pushes.load(std::memory_order_acquire);
-      }
-    }
-    auto result = &slots[consumer.popsNonAtomic++ & slotCountMask];
-    // We only have to write pops with memory order if we've run out of items.
-    // We know that we'll eventually run out.
-    if (consumer.lastPushRead - consumer.popsNonAtomic == 0) {
-      // seq_cst so that the notify can't be ordered before the store
-      consumer.pops.store(consumer.popsNonAtomic, std::memory_order_seq_cst);
-      consumer.pops.notify_one();
-    }
-    return result;
-  }
-
-private:
-  const uint32_t slotCount;
-  const uint32_t slotCountMask;
-  T *slots;
-  struct alignas(kCacheLine) ProducerState {
-    std::atomic<uint32_t> pushes{0};
-    uint32_t pushesNonAtomic{0};
-    uint32_t lastPopRead{0};
-  };
-  struct alignas(kCacheLine) ConsumerState {
-    std::atomic<uint32_t> pops{0};
-    uint32_t popsNonAtomic{0};
-    uint32_t lastPushRead{0};
-  };
-  ProducerState producer;
-  ConsumerState consumer;
-};
-
 std::atomic<int64_t> transactions;

-int64_t safeUnaryMinus(int64_t x) {
-  return x == std::numeric_limits<int64_t>::min() ? x : -x;
-}
+constexpr int kBaseSearchDepth = 32;
+constexpr int kWindowSize = 10000000;

-void tupleAppend(std::string &output, int64_t value) {
-  if (value == 0) {
-    output.push_back(0x14);
-    return;
-  }
-  uint32_t size = 8 - __builtin_clrsbll(value) / 8;
-  int typeCode = 0x14 + (value < 0 ? -1 : 1) * size;
-  output.push_back(typeCode);
-  if (value < 0) {
-    value = ~safeUnaryMinus(value);
-  }
-  uint64_t swap = __builtin_bswap64(value);
-  output.insert(output.end(), (uint8_t *)&swap + 8 - size,
-                (uint8_t *)&swap + 8);
-}
-
-void tupleAppend(std::string &output, std::string_view value) {
-  output.push_back('\x02');
-  if (memchr(value.data(), '\x00', value.size()) != nullptr) {
-    for (auto c : value) {
-      if (c == '\x00') {
-        output.push_back('\x00');
-        output.push_back('\xff');
-      } else {
-        output.push_back(c);
-      }
-    }
-  } else {
-    output.insert(output.end(), value.begin(), value.end());
-  }
-  output.push_back('\x00');
-}
-
-template <class... Ts> std::string tupleKey(const Ts &...ts) {
+std::string numToKey(int64_t num) {
  std::string result;
-  (tupleAppend(result, ts), ...);
+  result.resize(kBaseSearchDepth + sizeof(int64_t));
+  memset(result.data(), 0, kBaseSearchDepth);
+  int64_t be = __builtin_bswap64(num);
+  memcpy(result.data() + kBaseSearchDepth, &be, sizeof(int64_t));
  return result;
 }

-constexpr int kTotalKeyRange = 1'000'000'000;
-constexpr int kWindowSize = 1'000'000;
-constexpr int kNumReadKeysPerTx = 5;
-constexpr int kNumWriteKeysPerTx = 10;
-
-struct Transaction {
-  std::vector<std::string> keys;
-  std::vector<weaselab::ConflictSet::ReadRange> reads;
-  std::vector<weaselab::ConflictSet::WriteRange> writes;
-  int64_t version;
-  int64_t oldestVersion;
-  Transaction() = default;
-  explicit Transaction(int64_t version)
-      : version(version), oldestVersion(version - kWindowSize) {
-    std::vector<int64_t> keyIndices;
-    for (int i = 0; i < std::max(kNumReadKeysPerTx, kNumWriteKeysPerTx); ++i) {
-      keyIndices.push_back(rand() % kTotalKeyRange);
+void workload(weaselab::ConflictSet *cs) {
+  int64_t version = kWindowSize;
+  cs->addWrites(nullptr, 0, version);
+  for (;; transactions.fetch_add(1, std::memory_order_relaxed)) {
+    // Reads
+    {
+      auto beginK = numToKey(version - kWindowSize);
+      auto endK = numToKey(version - 1);
+      auto pointRv = version - kWindowSize + rand() % kWindowSize + 1;
+      auto pointK = numToKey(pointRv);
+      weaselab::ConflictSet::ReadRange reads[] = {
+          {
+              {(const uint8_t *)pointK.data(), int(pointK.size())},
+              {nullptr, 0},
+              pointRv,
+          },
+          {
+              {(const uint8_t *)beginK.data(), int(beginK.size())},
+              {(const uint8_t *)endK.data(), int(endK.size())},
+              version - 2,
+          },
+      };
+      weaselab::ConflictSet::Result result[sizeof(reads) / sizeof(reads[0])];
+      cs->check(reads, result, sizeof(reads) / sizeof(reads[0]));
+      // for (int i = 0; i < sizeof(reads) / sizeof(reads[0]); ++i) {
+      //   if (result[i] != weaselab::ConflictSet::Commit) {
+      //     fprintf(stderr, "Unexpected conflict: [%s, %s) @ %" PRId64 "\n",
+      //             printable(reads[i].begin).c_str(),
+      //             printable(reads[i].end).c_str(), reads[i].readVersion);
+      //     abort();
+      //   }
+      // }
    }
-    std::sort(keyIndices.begin(), keyIndices.end());
-    constexpr std::string_view fullString =
-        "this is a string, where a prefix of it is used as an element of the "
-        "tuple forming the key";
-    for (int i = 0; i < int(keyIndices.size()); ++i) {
-      keys.push_back(
-          tupleKey(0x100, keyIndices[i] / fullString.size(),
-                   fullString.substr(0, keyIndices[i] % fullString.size())));
-      // printf("%s\n", printable(keys.back()).c_str());
-    }
-    for (int i = 0; i < kNumWriteKeysPerTx; ++i) {
-      writes.push_back({{(const uint8_t *)keys[i].data(), int(keys[i].size())},
-                        {nullptr, 0}});
-    }
-    reads.push_back({{(const uint8_t *)keys[0].data(), int(keys[0].size())},
-                     {(const uint8_t *)keys[1].data(), int(keys[1].size())},
-                     version - std::min(10, kWindowSize)});
-    static_assert(kNumReadKeysPerTx >= 3);
-    for (int i = 2; i < kNumReadKeysPerTx; ++i) {
-      reads.push_back({{(const uint8_t *)keys[i].data(), int(keys[i].size())},
-                       {nullptr, 0},
-                       version - kWindowSize});
+    // Writes
+    {
+      weaselab::ConflictSet::WriteRange w;
+      auto k = numToKey(version);
+      w.begin.p = (const uint8_t *)k.data();
+      w.end.len = 0;
+      if (version % (kWindowSize / 2) == 0) {
+        for (int l = 0; l <= k.size(); ++l) {
+          w.begin.len = l;
+          cs->addWrites(&w, 1, version);
+        }
+      } else {
+        w.begin.len = k.size();
+        cs->addWrites(&w, 1, version);
+        int64_t beginN = version - kWindowSize + rand() % kWindowSize;
+        auto b = numToKey(beginN);
+        auto e = numToKey(beginN + 1000);
+        w.begin.p = (const uint8_t *)b.data();
+        w.begin.len = b.size();
+        w.end.p = (const uint8_t *)e.data();
+        w.end.len = e.size();
+        cs->addWrites(&w, 1, version);
+      }
    }
+    // GC
+    cs->setOldestVersion(version - kWindowSize);
+    ++version;
  }
-
-  Transaction(Transaction &&) = default;
-  Transaction &operator=(Transaction &&) = default;
-  Transaction(Transaction const &) = delete;
-  Transaction const &operator=(Transaction const &) = delete;
-};
-
-struct Resolver {
-
-  void resolve(const weaselab::ConflictSet::ReadRange *reads, int readCount,
-               const weaselab::ConflictSet::WriteRange *writes, int writeCount,
-               int64_t newVersion, int64_t newOldestVersion) {
-    results.resize(readCount);
-    cs.check(reads, results.data(), readCount);
-    cs.addWrites(writes, writeCount, newVersion);
-    cs.setOldestVersion(newOldestVersion);
-  }
-
-  ConflictSet cs{0};
-
-private:
-  std::vector<weaselab::ConflictSet::Result> results;
-};
+}

 // Adapted from getaddrinfo man page
 int getListenFd(const char *node, const char *service) {
@@ -367,8 +237,7 @@ int main(int argc, char **argv) {
  {
    int listenFd = getListenFd(argv[1], argv[2]);

-    Resolver resolver;
-    auto &cs = resolver.cs;
+    weaselab::ConflictSet cs{0};
    weaselab::ConflictSet::MetricsV1 *metrics;
    int metricsCount;
    cs.getMetricsV1(&metrics, &metricsCount);
@@ -417,22 +286,7 @@ int main(int argc, char **argv) {
    }
 #endif

-    TxQueue<Transaction> queue{10};
-
-    auto workloadThread = std::thread{[&]() {
-      for (int64_t version = kWindowSize;;
-           ++version, transactions.fetch_add(1, std::memory_order_relaxed)) {
-        queue.push(Transaction(version));
-      }
-    }};
-
-    auto resolverThread = std::thread{[&]() {
-      for (;;) {
-        auto tx = queue.pop();
-        resolver.resolve(tx->reads.data(), tx->reads.size(), tx->writes.data(),
-                         tx->writes.size(), tx->version, tx->oldestVersion);
-      }
-    }};
+    auto w = std::thread{workload, &cs};

    for (;;) {
      struct sockaddr_storage peer_addr = {};
@@ -22,7 +22,6 @@

 #include "ConflictSet.h"
 #include "Internal.h"
-#include "Metrics.h"

 #include <algorithm>
 #include <span>
@@ -38,9 +37,6 @@ std::span<const uint8_t> keyAfter(Arena &arena, std::span<const uint8_t> key) {

 std::span<const uint8_t> copyToArena(Arena &arena,
                                     std::span<const uint8_t> key) {
-  if (key.size() == 0) {
-    return std::span<const uint8_t>();
-  }
  auto result = std::span<uint8_t>(new (arena) uint8_t[key.size()], key.size());
  memcpy(result.data(), key.data(), key.size());
  return result;
@@ -100,7 +96,7 @@ force_inline bool getCharacter(const KeyInfo &ki, int character,

 bool operator<(const KeyInfo &lhs, const KeyInfo &rhs) {
  int i = std::min(lhs.key.size(), rhs.key.size());
-  int c = i > 0 ? memcmp(lhs.key.data(), rhs.key.data(), i) : 0;
+  int c = memcmp(lhs.key.data(), rhs.key.data(), i);
  if (c != 0)
    return c < 0;

@@ -290,8 +286,7 @@ private:

  static force_inline bool less(const uint8_t *a, int aLen, const uint8_t *b,
                                int bLen) {
-    int n = std::min(aLen, bLen);
-    int c = n > 0 ? memcmp(a, b, n) : 0;
+    int c = memcmp(a, b, std::min(aLen, bLen));
    if (c < 0)
      return true;
    if (c > 0)
@@ -439,14 +434,13 @@ public:
    return result;
  }

-  // Return number of iterations of main loop
-  int detectConflicts(ReadConflictRange *ranges, int count,
-                      ConflictSet::Result *transactionConflictStatus) const {
+  void detectConflicts(ReadConflictRange *ranges, int count,
+                       ConflictSet::Result *transactionConflictStatus) const {
    const int M = 16;
    int nextJob[M];
    CheckMax inProgress[M];
    if (!count)
-      return 0;
+      return;

    int started = std::min(M, count);
    for (int i = 0; i < started; i++) {
@@ -457,9 +451,8 @@ public:

    int prevJob = started - 1;
    int job = 0;
-    int iters = 0;
    // vtune: 340 parts
-    for (;; ++iters) {
+    while (true) {
      if (inProgress[job].advance()) {
        if (started == count) {
          if (prevJob == job)
@@ -475,7 +468,6 @@ public:
      prevJob = job;
      job = nextJob[job];
    }
-    return iters;
  }

  void find(const StringRef *values, Finger *results, int *temp, int count) {
@@ -710,27 +702,15 @@ private:
  };
 };

-struct ReadContext {
-  int64_t commits_accum = 0;
-  int64_t conflicts_accum = 0;
-  int64_t too_olds_accum = 0;
-  int64_t check_bytes_accum = 0;
-};
-
 struct __attribute__((visibility("hidden"))) ConflictSet::Impl {
  Impl(int64_t oldestVersion)
      : oldestVersion(oldestVersion), newestVersion(oldestVersion),
-        skipList(oldestVersion) {
-    metrics = initMetrics(metricsList, metricsCount);
-  }
-  ~Impl() { safe_free(metrics, metricsCount * sizeof(metrics[0])); }
+        skipList(oldestVersion) {}
  void check(const ConflictSet::ReadRange *reads, ConflictSet::Result *results,
-             int count) {
-    ReadContext tls;
+             int count) const {
    Arena arena;
    auto *ranges = new (arena) ReadConflictRange[count];
    for (int i = 0; i < count; ++i) {
-      tls.check_bytes_accum += reads[i].begin.len + reads[i].end.len;
      ranges[i].begin = {reads[i].begin.p, size_t(reads[i].begin.len)};
      ranges[i].end = reads[i].end.len > 0
                          ? StringRef{reads[i].end.p, size_t(reads[i].end.len)}
@@ -738,28 +718,18 @@ struct __attribute__((visibility("hidden"))) ConflictSet::Impl {
      ranges[i].version = reads[i].readVersion;
      results[i] = ConflictSet::Commit;
    }
-    int iters = skipList.detectConflicts(ranges, count, results);
+    skipList.detectConflicts(ranges, count, results);
    for (int i = 0; i < count; ++i) {
      if (reads[i].readVersion < oldestVersion ||
          reads[i].readVersion < newestVersion - 2e9) {
        results[i] = TooOld;
      }
-      tls.commits_accum += results[i] == Commit;
-      tls.conflicts_accum += results[i] == Conflict;
-      tls.too_olds_accum += results[i] == TooOld;
    }
-    range_read_iterations_total.add(iters);
-    range_read_total.add(count);
-    commits_total.add(tls.commits_accum);
-    conflicts_total.add(tls.conflicts_accum);
-    too_olds_total.add(tls.too_olds_accum);
-    check_bytes_total.add(tls.check_bytes_accum);
  }

  void addWrites(const ConflictSet::WriteRange *writes, int count,
                 int64_t writeVersion) {
-    auto points = std::vector<KeyInfo>();
-    points.reserve(count * 2);
+    auto points = std::vector<KeyInfo>(count * 2);
    Arena arena;

    for (int r = 0; r < count; r++) {
@@ -772,9 +742,7 @@ struct __attribute__((visibility("hidden"))) ConflictSet::Impl {
          false, true);
    }

-    if (!std::is_sorted(points.begin(), points.end())) {
-      sortPoints(points);
-    }
+    sortPoints(points);

    int activeWriteCount = 0;
    std::vector<std::pair<StringRef, StringRef>> combinedWriteConflictRanges;
@@ -801,6 +769,7 @@ struct __attribute__((visibility("hidden"))) ConflictSet::Impl {
    int temp[stripeSize];
    int stripes = (stringCount + stripeSize - 1) / stripeSize;
    StringRef values[stripeSize];
+    int64_t writeVersions[stripeSize / 2];
    int ss = stringCount - (stripes - 1) * stripeSize;
    int64_t entryDelta = 0;
    for (int s = stripes - 1; s >= 0; s--) {
@@ -819,9 +788,6 @@ struct __attribute__((visibility("hidden"))) ConflictSet::Impl {
  }

  void setOldestVersion(int64_t oldestVersion) {
-    // This isn't 100% accurate. It overcounts if you hit the end
-    gc_iterations_total.add(keyUpdates);
-
    assert(oldestVersion >= this->oldestVersion);
    this->oldestVersion = oldestVersion;
    SkipList::Finger finger;
@@ -836,54 +802,6 @@ struct __attribute__((visibility("hidden"))) ConflictSet::Impl {

  int64_t totalBytes = 0;

-  MetricsV1 *metrics;
-  int metricsCount = 0;
-  Metric *metricsList = nullptr;
-
-#define GAUGE(name, help)                                                      \
-  Gauge name { metricsList, metricsCount, #name, help }
-#define COUNTER(name, help)                                                    \
-  Counter name { metricsList, metricsCount, #name, help }
-  // ==================== METRICS DEFINITIONS ====================
-  COUNTER(range_read_total, "Total number of range reads checked");
-  COUNTER(range_read_iterations_total,
-          "Total number of iterations of the main loops for range read checks");
-  COUNTER(commits_total,
-          "Total number of checks where the result is \"commit\"");
-  COUNTER(conflicts_total,
-          "Total number of checks where the result is \"conflict\"");
-  COUNTER(too_olds_total,
-          "Total number of checks where the result is \"too old\"");
-  COUNTER(check_bytes_total, "Total number of key bytes checked");
-  GAUGE(memory_bytes, "Total number of bytes in use");
-  COUNTER(nodes_allocated_total,
-          "The total number of physical tree nodes allocated");
-  COUNTER(nodes_released_total,
-          "The total number of physical tree nodes released");
-  COUNTER(insert_iterations_total,
-          "The total number of iterations of the main loop for insertion. "
-          "Includes searches where the entry already existed, and so insertion "
-          "did not take place");
-  COUNTER(entries_inserted_total,
-          "The total number of entries inserted in the tree");
-  COUNTER(entries_erased_total,
-          "The total number of entries erased from the tree");
-  COUNTER(
-      gc_iterations_total,
-      "The total number of iterations of the main loop for garbage collection");
-  COUNTER(write_bytes_total, "Total number of key bytes in calls to addWrites");
-  GAUGE(oldest_version,
-        "The lowest version that doesn't result in \"TooOld\" for checks");
-  GAUGE(newest_version, "The version of the most recent call to addWrites");
-  // ==================== END METRICS DEFINITIONS ====================
-#undef GAUGE
-#undef COUNTER
-
-  void getMetricsV1(MetricsV1 **metrics, int *count) {
-    *metrics = this->metrics;
-    *count = metricsCount;
-  }
-
 private:
  int64_t keyUpdates = 0;
  Arena removalArena;
@@ -906,7 +824,6 @@ void internal_addWrites(ConflictSet::Impl *impl,
  mallocBytesDelta = 0;
  impl->addWrites(writes, count, writeVersion);
  impl->totalBytes += mallocBytesDelta;
-  impl->memory_bytes.set(impl->totalBytes);
 #if SHOW_MEMORY
  if (impl->totalBytes != mallocBytes) {
    abort();
@@ -918,7 +835,6 @@ void internal_setOldestVersion(ConflictSet::Impl *impl, int64_t oldestVersion) {
  mallocBytesDelta = 0;
  impl->setOldestVersion(oldestVersion);
  impl->totalBytes += mallocBytesDelta;
-  impl->memory_bytes.set(impl->totalBytes);
 #if SHOW_MEMORY
  if (impl->totalBytes != mallocBytes) {
    abort();
@@ -942,11 +858,12 @@ int64_t internal_getBytes(ConflictSet::Impl *impl) { return impl->totalBytes; }

 void internal_getMetricsV1(ConflictSet::Impl *impl,
                           ConflictSet::MetricsV1 **metrics, int *count) {
-  return impl->getMetricsV1(metrics, count);
+  *metrics = nullptr;
+  *count = 0;
 }

 double internal_getMetricValue(const ConflictSet::MetricsV1 *metric) {
-  return ((Metric *)metric->p)->value.load(std::memory_order_relaxed);
+  return 0;
 }

 void ConflictSet::check(const ReadRange *reads, Result *results,
@@ -5,7 +5,6 @@ __stack_chk_guard@GLIBC_2.17
 abort@GLIBC_2.17
 free@GLIBC_2.17
 malloc@GLIBC_2.17
-memcmp@GLIBC_2.17
 memcpy@GLIBC_2.17
 memmove@GLIBC_2.17
 memset@GLIBC_2.17
@@ -1,8 +1,7 @@
 set(CMAKE_SYSTEM_NAME Linux)
 set(CMAKE_SYSTEM_PROCESSOR aarch64)
-set(CMAKE_C_COMPILER "clang;--target=aarch64-linux-gnu")
-set(CMAKE_CXX_COMPILER "clang++;--target=aarch64-linux-gnu")
+set(CMAKE_C_COMPILER "/usr/bin/aarch64-linux-gnu-gcc")
+set(CMAKE_CXX_COMPILER "/usr/bin/aarch64-linux-gnu-g++")
 set(CMAKE_FIND_ROOT_PATH /usr/aarch64-linux-gnu)
 set(CMAKE_CROSSCOMPILING_EMULATOR "qemu-aarch64;-L;/usr/aarch64-linux-gnu/")
 set(CPACK_DEBIAN_PACKAGE_ARCHITECTURE arm64)
-set(LD_EXE "/usr/bin/aarch64-linux-gnu-ld")
@@ -1,4 +1,3 @@
-___chkstk_darwin
 ___stack_chk_fail
 ___stack_chk_guard
 __tlv_bootstrap
@@ -6,7 +5,6 @@ _abort
 _bzero
 _free
 _malloc
-_memcmp
 _memcpy
 _memmove
 dyld_stub_binder
@@ -1,43 +0,0 @@
-#!/bin/bash
-
-set -euxo pipefail
-
-LLVM_VERSION="${LLVM_VERSION:-21}"
-MSAN_PREFIX="${MSAN_PREFIX:-$PWD/msan}"
-JOBS="${JOBS:-$(nproc)}"
-
-cd /tmp
-rm -rf libcxx-msan
-mkdir libcxx-msan
-cd libcxx-msan
-
-git clone --depth=1 "https://github.com/llvm/llvm-project.git" -b "release/${LLVM_VERSION}.x"
-
-cmake -S llvm-project/runtimes -B build_msan \
-  -DCMAKE_BUILD_TYPE=Release \
-  -DCMAKE_CXX_COMPILER="clang++-${LLVM_VERSION}" \
-  -DCMAKE_C_COMPILER="clang-${LLVM_VERSION}" \
-  -DCMAKE_INSTALL_PREFIX="${MSAN_PREFIX}" \
-  -DLLVM_ENABLE_RUNTIMES="libcxx;libcxxabi;libunwind" \
-  -DLLVM_USE_SANITIZER=MemoryWithOrigins
-
-cmake --build build_msan -j"${JOBS}"
-cmake --install build_msan
-
-cmake -S llvm-project/runtimes -B build_nomsan \
-  -DCMAKE_BUILD_TYPE=Release \
-  -DCMAKE_CXX_COMPILER="clang++-${LLVM_VERSION}" \
-  -DCMAKE_C_COMPILER="clang-${LLVM_VERSION}" \
-  -DCMAKE_INSTALL_PREFIX="${MSAN_PREFIX}" \
-  -DLLVM_ENABLE_RUNTIMES="libunwind"
-
-cmake --build build_nomsan -j"${JOBS}"
-cmake --install build_nomsan
-
-VERSION="$(clang-"${LLVM_VERSION}" --version | head -n1 | sed -E 's/.*clang version ([0-9.]+).*/\1/')"
-TARBALL="msan-toolchain-${VERSION}.tar.zst"
-
-tar --zstd -cf "${TARBALL}" -C "${MSAN_PREFIX}" .
-
-TARBALL_PATH="$(pwd)/${TARBALL}"
-echo "Created: ${TARBALL_PATH}"
@@ -27,37 +27,23 @@ class Result(enum.Enum):
    TOO_OLD = 2


-def _make_key(buf: bytes) -> tuple[_Key, bytearray]:
-    """Create a _Key and a backing bytearray that must be kept alive."""
-    backing = bytearray(buf)
-    array = (ctypes.c_ubyte * len(backing)).from_buffer(backing)
-    return _Key(array, len(array)), backing
-
-
 def write(begin: bytes, end: Optional[bytes] = None) -> WriteRange:
-    begin_key, begin_buf = _make_key(begin)
+    b = (ctypes.c_ubyte * len(begin)).from_buffer(bytearray(begin))
+
    if end is None:
-        end_key = _Key((ctypes.c_ubyte * 0)(), 0)
-        end_buf = None
+        e = (ctypes.c_ubyte * 0)()
    else:
-        end_key, end_buf = _make_key(end)
-    result = WriteRange(begin_key, end_key)
-    result._begin_buf = begin_buf
-    result._end_buf = end_buf
-    return result
+        e = (ctypes.c_ubyte * len(end)).from_buffer(bytearray(end))
+    return WriteRange(_Key(b, len(b)), _Key(e, len(e)))


 def read(version: int, begin: bytes, end: Optional[bytes] = None) -> ReadRange:
-    begin_key, begin_buf = _make_key(begin)
+    b = (ctypes.c_ubyte * len(begin)).from_buffer(bytearray(begin))
    if end is None:
-        end_key = _Key((ctypes.c_ubyte * 0)(), 0)
-        end_buf = None
+        e = (ctypes.c_ubyte * 0)()
    else:
-        end_key, end_buf = _make_key(end)
-    result = ReadRange(begin_key, end_key, version)
-    result._begin_buf = begin_buf
-    result._end_buf = end_buf
-    return result
+        e = (ctypes.c_ubyte * len(end)).from_buffer(bytearray(end))
+    return ReadRange(_Key(b, len(b)), _Key(e, len(e)), version)


 class ConflictSet:
@@ -102,7 +88,6 @@ class ConflictSet:
            ctypes.POINTER(ctypes.c_int),
            ctypes.c_int,
        )
-        self._lib.ConflictSet_check.restype = None

        self._lib.ConflictSet_addWrites.argtypes = (
            ctypes.c_void_p,
@@ -110,16 +95,13 @@ class ConflictSet:
            ctypes.c_int,
            ctypes.c_int64,
        )
-        self._lib.ConflictSet_addWrites.restype = None

        self._lib.ConflictSet_setOldestVersion.argtypes = (
            ctypes.c_void_p,
            ctypes.c_int64,
        )
-        self._lib.ConflictSet_setOldestVersion.restype = None

        self._lib.ConflictSet_destroy.argtypes = (ctypes.c_void_p,)
-        self._lib.ConflictSet_destroy.restype = None

        self._lib.ConflictSet_getBytes.argtypes = (ctypes.c_void_p,)
        self._lib.ConflictSet_getBytes.restype = ctypes.c_int64
--- a/Show More
+++ b/Show More
Author	SHA1	Message	Date
andrew	cc4306cfe9	Bump version CI / release (arm64, ubuntu-latest-arm64) (push) Successful in 1m49s Details CI / pre-commit (push) Successful in 2m0s Details CI / test (-DCMAKE_BUILD_TYPE=Debug, debug) (push) Successful in 2m11s Details CI / test (-DCMAKE_CXX_FLAGS=-DUSE_64_BIT=1, 64-bit-versions) (push) Successful in 2m12s Details CI / test (-DCMAKE_C_COMPILER=gcc -DCMAKE_CXX_COMPILER=g++, gcc) (push) Successful in 2m1s Details CI / test (-DUSE_SIMD_FALLBACK=ON, simd-fallback) (push) Successful in 2m9s Details CI / release (amd64, ubuntu-latest-amd64) (push) Successful in 4m20s Details CI / coverage (push) Successful in 2m43s Details	2026-07-14 15:27:09 -04:00
andrew	9b7199567b	Update README.md CI / pre-commit (push) Successful in 1m59s Details CI / release (arm64, ubuntu-latest-arm64) (push) Successful in 1m51s Details CI / test (-DCMAKE_BUILD_TYPE=Debug, debug) (push) Successful in 2m11s Details CI / test (-DCMAKE_CXX_FLAGS=-DUSE_64_BIT=1, 64-bit-versions) (push) Successful in 2m11s Details CI / test (-DCMAKE_C_COMPILER=gcc -DCMAKE_CXX_COMPILER=g++, gcc) (push) Successful in 2m1s Details CI / test (-DUSE_SIMD_FALLBACK=ON, simd-fallback) (push) Successful in 2m10s Details CI / release (amd64, ubuntu-latest-amd64) (push) Successful in 4m13s Details CI / coverage (push) Successful in 2m48s Details	2026-07-14 14:32:08 -04:00
andrew	7c6c116713	Add new coverage to corpus	2026-07-14 14:23:03 -04:00
andrew	5c9e9603de	Add GCOVR_EXCL_LINE CI / release (arm64, ubuntu-latest-arm64) (push) Successful in 1m51s Details CI / pre-commit (push) Successful in 2m58s Details CI / test (-DCMAKE_BUILD_TYPE=Debug, debug) (push) Successful in 3m32s Details CI / test (-DCMAKE_CXX_FLAGS=-DUSE_64_BIT=1, 64-bit-versions) (push) Successful in 3m32s Details CI / test (-DCMAKE_C_COMPILER=gcc -DCMAKE_CXX_COMPILER=g++, gcc) (push) Successful in 3m20s Details CI / test (-DUSE_SIMD_FALLBACK=ON, simd-fallback) (push) Successful in 3m36s Details CI / release (amd64, ubuntu-latest-amd64) (push) Successful in 6m56s Details CI / coverage (push) Successful in 4m23s Details This was showing as uncovered in CI for some reason	2026-07-14 13:38:15 -04:00
andrew	862b6a4886	Port CI from main CI / release (arm64, ubuntu-latest-arm64) (push) Successful in 1m51s Details CI / pre-commit (push) Successful in 2m59s Details CI / test (-DCMAKE_BUILD_TYPE=Debug, debug) (push) Successful in 8m0s Details CI / test (-DCMAKE_CXX_FLAGS=-DUSE_64_BIT=1, 64-bit-versions) (push) Successful in 3m34s Details CI / test (-DCMAKE_C_COMPILER=gcc -DCMAKE_CXX_COMPILER=g++, gcc) (push) Successful in 3m17s Details CI / test (-DUSE_SIMD_FALLBACK=ON, simd-fallback) (push) Successful in 3m30s Details CI / release (amd64, ubuntu-latest-amd64) (push) Successful in 6m43s Details CI / coverage (push) Failing after 3m57s Details	2026-07-14 12:28:08 -04:00
andrew	a69dac7f16	Merge pull request 'Fix move-assignment leak and self-assignment in ConflictSet' (#55 ) from weaselbot/conflict-set:weaselbot/issue-54 into main Reviewed-on: #55	2026-07-14 10:56:12 -04:00