eproc

commit 05542c668916429b9dd6b0ddafe42c88da145ffb
parent d9ce56dd4e90a053e8c8e67b1fa96d272ab42724
Author: Jared Tobin <jared@jtobin.io>
Date:   Thu,  2 Jul 2026 16:50:35 -0230

release: v0.2.2

Diffstat:
M
CHANGELOG
 | 
18
+++---------------
M
ppad-eproc.cabal
 | 
2
+-

2 files changed, 4 insertions(+), 16 deletions(-)
diff --git a/CHANGELOG b/CHANGELOG
@@ -1,20 +1,8 @@
 # Changelog
 
-- unreleased
-  * New module 'Numeric.Eproc.Bernoulli.TwoSided' providing a
-    two-sided Bernoulli rate test (H_0: p = p_0). Canonical use is
-    the sign test at p_0 = 1/2. Implemented as a newtype wrapper
-    over 'Numeric.Eproc.Bounded' (following the pattern
-    'Numeric.Eproc.Paired' uses), with the same 'config' /
-    'initial' / 'update' / 'decide' / 'log_wealth' / 'samples'
-    shape as the sibling one-sided 'Numeric.Eproc.Bernoulli'.
-
-  * Per-step performance improvements to 'Bounded.update' (and
-    hence 'Paired.update' and 'Bernoulli.TwoSided.update' via
-    wrapping): log1p replaces log-of-(1+x) for the wealth factor,
-    and log_sum_exp is skipped when a cheap upper bound guarantees
-    the running max-log-sum can't change. Under H_0 workloads the
-    fold is ~40% faster on two-sided tests.
+- 0.2.2 (2026-07-02)
+  * Adds a Numeric.Eproc.Bernoulli.TwoSided module for a two-sided
+    Bernoulli rate test.
 
 - 0.2.1 (2026-07-02)
   * Two-sided bounded-mean tests now reject faster, or at least never
diff --git a/ppad-eproc.cabal b/ppad-eproc.cabal
@@ -1,6 +1,6 @@
 cabal-version:      3.0
 name:               ppad-eproc
-version:            0.2.1
+version:            0.2.2
 synopsis:           Anytime-valid sequential testing via e-processes.
 license:            MIT
 license-file:       LICENSE