Release Notes

Below is an English draft of the release notes comparing v3.1.0 against the current master.

Overview

This iteration brings a major expansion to Aleph-w, with emphasis on:

• New algorithmic modules
• Stronger concurrency infrastructure
• New persistent and probabilistic data structures
• Reusable frameworks for search and adversarial games
• Broad improvements in hashing, core utilities, tests, examples, and documentation

From v3.1.0 to master, the change set includes:

• 377 files changed
• 128721 insertions
• 18716 deletions

Highlights

• FFT and NTT
  A substantial Fast Fourier Transform implementation was added in fft.H, along with important improvements in ntt.H and modular arithmetic utilities. This expands the foundation for convolutions, algebraic processing, and related algorithms.

• Polynomial library
  A new polynomial arithmetic layer was introduced with tpl_polynomial.H and tpl_multi_polynomial.H, backed by examples, benchmarks, validation scripts, and dedicated documentation.

• Adversarial search framework
  Support was added for adversarial game engines through Negamax.H, move-ordering utilities, and transposition tables via Transposition_Table.H, including tests and examples for minimax/alpha-beta style scenarios.

• State-space search framework
  A reusable infrastructure for state-space search was added through State_Search.H, State_Search_IDA_Star.H, and state_search_common.H, including incremental evaluator support and examples.

• Concurrency v2
  thread_pool.H, experimental_async.H, and the new concurrency_utils.H significantly extend the library’s parallel execution and async support.

• B-Tree, B+ Tree, and file-backed variants
  New implementations were added for tpl_b_tree.H, tpl_bplus_tree.H, tpl_file_b_tree.H, tpl_file_bplus_tree.H, tpl_file_b_map.H, and tpl_file_bplus_map.H, expanding support for balanced trees and persistence.

• Probabilistic filters
  New probabilistic structures were introduced, including cuckoo-filter.H, compact-cuckoo-filter.H, quotient-filter.H, and compact-quotient-filter.H, along with updates to bloom-filter.H.

• Graph coloring
  Graph_Coloring.H was added with greedy, Welsh-Powell, and DSatur coloring algorithms, plus corresponding tests and examples.

• Additional algorithmic utilities
  New components also include Two_Sat.H, link-cut trees (tpl_link_cut_tree.H, tpl_link_cut_tree_with_edges.H), and updates across matching, shortest paths, and tree DP related modules.

Improvements and notable changes

• Core containers and data structures
  Additional operations such as clear() and contains() were implemented across multiple data structures.

• Hashing
  hash-fct.H, hash-fct.C, tpl_hash.H, tpl_lhash.H, tpl_linHash.H, tpl_odhash.H, tpl_olhash.H, and related components were expanded and revised, with new validation, restriction, and statistical tests.

• Error handling
  Error handling was consolidated and redundant namespace directives were removed, improving internal consistency.

• Existing algorithms
  Multiple existing modules were updated, including:
  Hungarian.H, Min_Cost_Matching.H, Subset_Sum.H, Planarity_Test.H, Floyd_Warshall.H, Knapsack.H, LCA.H, LIS.H, Matrix_Chain.H, Tree_DP.H, and others.

• Documentation
  Documentation was significantly expanded with new guides covering:
  FFT, NTT, adversarial search, state-space search, B/B+ trees, ranges, geometry, error handling, and algorithm selection.

• Tests and examples
  A large number of new tests and examples were added to cover the newly introduced modules and strengthen regression coverage.

Notes for users

• Major functional expansion
  This release extends Aleph-w beyond classic data structures and algorithms by introducing reusable frameworks for search, modern concurrency, and computational algebra.

• Improved ecosystem maturity
  The growth in Tests/, Examples/, and docs/ reflects a clear improvement in maintainability, validation, and usability of the new modules.

• Potential integration impact
  While the Git summary does not immediately suggest a single global breaking API change, many public headers and foundational components were modified. Consumers should rebuild dependent code and review integration points, especially if relying on:
  hashing, concurrency, dynamic containers, or error-handling utilities.