March's #Tau Dev Update! (Episode 46): 🎥 https://youtu.be/1QGLztXgNRc 👈 Summary: 🔹Ohad has been working on taking the logic we’ve developed into a software specification language. One of the directions was to study infinite systems of boolean versions. On this front, we’ve made a significant breakthrough. We’ve had a positive result, and it appears to be the direction to go in. It’s given the answers to the questions we were looking for and will be considered in the bigger picture. 🔹Juan is continuing the effort of integrating Umar’s work on the type system and Bit Universe. - Refactoring the entire TML codebase with Ohad to accomplish this. - Revisiting safety checks, guards, program transformations, strings, and grammar processing. 🔹Tomas has finished his work on the Earley's parser and has made it Unicode capable 🔹Umar has started the challenging task of Binary optimization forest generation in the case of highly ambiguous grammar. With help from Ohad, he’s making progress. 🔹David has finished fact generation and made additional changes. He’s also working on the TML parser and removing the possibility of negation of facts. He’s also working on grouping the different optimizations for TML programs. With a PhD himself, he’s contributing on the theoretical front in the academic panel discussions. 🔹Lucca has been assigned theoretical work to show decidability of theories can be done by encoding using second-order logic over finite binary trees. 🔹Agoras Live bug fixing. Testing has begun. Andrei added further login improvements using popular wallet API integrations.