--- liblzf/Changes	2010/06/01 01:15:34	1.49
+++ liblzf/Changes	2012/03/30 20:58:09	1.57
@@ -1,10 +1,30 @@
 
+TODO: try unaligned copy again in decompressor
+TODO: allow size-optimised binaries by avoiding unrolling
+TODO: implement lzf_c_best in lzf.
+TODO: fix lzf_c_best.
+
+	- switch to a multiplicative hash (developed with Steinar Gunderson),
+          which is faster on modern cpus and compresses a bit better. The old
+          hash function which uses only shifts is still available.
+        - allow user configurable hash table slots, which makes it possible
+          to use e.g. 16 bit offsets for a smaller hashtable (if your data is
+          always < 64kb).
+	- use _WIN32, not WIN32, when testing for windows (fails with bcc),
+          patch by Tamas Tevesz.
+        - try to port to win64+gcc, which is non-posix but doesn't have _int64
+          (reported by Maciej Adamczyk).
+
+3.6  Mon Feb  7 17:37:31 CET 2011
 	- fixed hash calculation in C♯ version (Tiago Freitas Leal).
         - unroll copy for small sizes, use memcpy for larger sizes,
           greatly speeding up decompression in most cases.
         - finally disable rep movsb - it's a big loss on modern intel cpus,
           and only a small win on amd cpus.
-        - improve c++ compatibility of the code.
+        - improve C++ compatibility of the code.
+        - slightly improve compressor speed.
+        - halved memory requirements for compressor on 64 bit architectures,
+          which can improve the speed quite a bit on older cpus.
 
 3.5  Fri May  1 02:28:42 CEST 2009
 	- lzf_compress did sometimes write one octet past the given output