diff --git a/CHANGES.md b/CHANGES.md
index b05f6dc96..2f654052b 100644
--- a/CHANGES.md
+++ b/CHANGES.md
@@ -1,9 +1,10 @@
 * Hackage: <http://hackage.haskell.org/package/sbv>
-* GitHub:  <http://leventerkok.github.io/sbv/>
+* GitHub:  <http://github.com/LeventErkok/sbv>
 
-* Latest Hackage released version: 10.5, 2024-02-20
+* Latest Hackage released version: 10.6, 2024-03-16
+
+### Version 10.6, 2024-03-16
 
-### Version 10.5.5, Not yet released
   * Added Data.SBV.Tools.BVOptimize module, which implements a custom optimizer for unsigned bit-vector
     values. See 'minBV' and 'maxBV' methods. These algorithms use the incremental solver instead of
     the optimizer engines, and they can be more performant in certain cases. (For instance, z3's
@@ -11,6 +12,8 @@
     problems.) These algorithms scan the bits from most to least significant bit, and individually
     set/unset them in an incremental fashion to optimize quickly.
 
+  * SBV web-page is no longer maintained. The info is put into the README.md instead.
+
 ### Version 10.5, 2024-02-20
 
   * Export svFloatingPointAsSWord through Data.SBV.Internals
diff --git a/sbv.cabal b/sbv.cabal
index 851c63bb2..70333609e 100644
--- a/sbv.cabal
+++ b/sbv.cabal
@@ -1,7 +1,7 @@
 Cabal-Version: 2.2
 
 Name        : sbv
-Version     : 10.5.5
+Version     : 10.6
 Category    : Formal Methods, Theorem Provers, Bit vectors, Symbolic Computation, Math, SMT
 Synopsis    : SMT Based Verification: Symbolic Haskell theorem prover using SMT solving.
 Description : Express properties about Haskell programs and automatically prove them using SMT