Update README.md
diff --git a/README.md b/README.md
index 4646995..be15bb7 100644
--- a/README.md
+++ b/README.md
@@ -311,48 +311,3 @@
a clean, checked-out repository periodically, or run it during CI tests
before any build artifacts have been created.
-### Special Thanks
-A huge thanks to Google for partnering with us and enabling this system to be open sourced.
-
-Thank you to [Esri - Environmental Systems Research Institute](https://www.esri.com/) for sponsoring the encoder optimization work in the v1.13 release, and the KTX2 work in the v1.15 release.
-
-Thanks to the Khronos Group for building an open ecosystem that supports ETC1S/UASTC.
-
-Thanks to a number of companies or groups who have supported or helped out Binomial over the years: Intel, SpaceX, Netflix, Forgotten Empires, Microsoft, Polystream, Hothead Games, BioDigital, Magic Leap, Blizzard Entertainment, Insomniac Games, Rockstar Games, Facebook, Activision, the Khronos Group, and the organizers at CppCon.
-
-Thanks to Dave Wilkinson (AMD/Khronos) for supporting us and giving us very valuable feedback while we developed Basis Universal.
-
-Thanks to Chris Wein (Netflix), who showed us the path to Texture Video.
-
-Thanks to Mike Dussault (SpaceX) and Elon Musk for supporting Binomial in the early days.
-
-Thanks to Graeme Devine at Magic Leap.
-
-Thanks to Matt Pritchard, formerly of Valve Software and Microsoft, for helping me with the computer hardware I used while building this system and its predecessor.
-
-Thanks to John Brooks at Blue Shift, Inc. for inspiring this work by showing me his Dreamcast texture compression system around 2002, and for releasing etc2comp. I first saw the subblock flip estimation approach (used in basisu_etc.cpp) in etc2comp.
-
-Thanks to Colt McAnlis, for advertising one of my earlier open source texture compression libraries at GDC, and Won Chun, who originally suggested making a universal system.
-
-Thanks to Chas Boyd (Microsoft), for inspiring us to work on texture compression full-time. Chas also gave us great feedback about UASTC before it was released.
-
-Thanks to Mark Callow at Edgewise Consulting for his work on glTF and the KTX2 file format.
-
-I first saw using precomputed tables for quickly computing optimal encodings of solid color blocks in ryg_dxt. The method that limits the canonical Huffman codelengths to a maximum codesize was used in Yoshizaki's lharc. The canonical Huffman codelength compression system is similar to Katz's Deflate method.
-
-### Possible improvements
-The codebook generation process is basically a high quality, but slow and brute force reference. It's possible to massively speed up codebook gen in several ways. One way is to not throw away the tree structures constructed during the creation of the initial codebooks.
-
-The way the -q (quality) option is converted to codebook sizes is very simple (fixed formulas), and could be improved. It has a tendency to plateau on some files.
-
-The various Huffman codes could be divided up into groups (like Zstd), for much faster Huffman decoding in the transcoder. Also, larger slices could be divided up into multiple segments, and each segment transcoded using a different thread. Both of these changes would modify the format.
-
-PVRTC1 modulation values could be determined using multiple threads and/or SIMD code.
-
-PVRTC1 2bpp support wouldn't be hard to add.
-
-The transcoder's BC7 tables are a bit large, and can be reduced, which would allow the transcoder to be downloaded more quickly.
-
-3-bit selectors for alpha would greatly improve the quality of the alpha, but would break the file format and require extensive additions to the compressor/transcoder.
-
-Fast 6x6 ASTC support may be possible.
