# 2024.10.21 - 2024.10.27

## 2024.10.26

Official BitVM Project Update: Several corner cases for `u32_compress` have been fixed. <https://github.com/BitVM/BitVM/commit/99929dc19346f713c56269f3ba9e16ebb186ca90>

## 2024.10.22

1. Official BitVM Project Update: It has been clarified that the BitVM repository will adopt the MIT license.<https://github.com/BitVM/BitVM/commit/d5a58260ca9b22bf2ab0f1e37e1f4e03c84152e6>
2. ZeroSync @ZeroSync\_ announces the formation of the BitVM Alliance! We will work together to deliver the first BitVM bridges by the end of the year. Stay tuned!

<figure><img src="https://sigweb3labs.sg.larksuite.com/space/api/box/stream/download/asynccode/?code=ZmRhNzI0NzkxMDQyY2YxNmU0MDU5MzU2OGNiMDE3OGJfM0RRaFY1blJuaTQySUJsMUZMS2lQRDFKaUVyZGxHZHVfVG9rZW46RGh0OWJld1F5b2hMbTh4eHl5eWxJYmFlZzZjXzE3MzAxODY1ODQ6MTczMDE5MDE4NF9WNA" alt=""><figcaption></figcaption></figure>

3. Bitlayer [@BitlayerLabs](https://x.com/BitlayerLabs) In continuation of our previous research on STARK, the Bitlayer research team has conducted a deep dive on the Binius STARK proof system. Our findings are as follows:

* Previous STARK systems (252, 64, 32-bit) improved the encoding process yet continued to waste space. Binius employs compact bit-level operations, potentially positioning it as the next-generation STARK.
* Binius boosts efficiency with binary field arithmetic, enhanced HyperPlonk checks, and small-field polynomial commitments.
* Further optimization in binary multiplication, ZeroCheck, SumCheck, and PCS may increase speed and reduce proof size.

&#x20;  For details, see Dr. Lynndell's ([@lynndell11](https://x.com/lynndell11)) latest article. [https://blog.bitlayer.org/Binius\_STARKs\_Analysis\_and\_Its\_Optimization/](https://t.co/s5PWMqbnYg)

<figure><img src="https://3108104246-files.gitbook.io/~/files/v0/b/gitbook-x-prod.appspot.com/o/spaces%2FPnERj3Xhhe12rsTnDkRv%2Fuploads%2FEVdIJYhEgfQ4NGSFE5zM%2Fimage.png?alt=media&#x26;token=4bc0900d-a1eb-457b-8673-9db7b22af150" alt=""><figcaption></figcaption></figure>