January 2020 monthly dev update video for Tauchain is now out!
https://youtu.be/oProG45QeowText Summary:
Tomas
- Improved TML debugging capabilities which allows step by step debugging
- Added ability to see changes in the program made in the database and adding debugging features to the bot. Also will soon allow adding info about database changes and reason about these changes in the program itself, eg setting up breakpoints depending on some change in the database
Andrei
- Working on TML interaction playground
- Supports creating a discussion and replying in English
- Automatically creates a discussion tree for every time within the discussion
Juan
- Continued work on arithmetic support
- BDDs multiplication problem mentioned last month was more difficult than expected. We'll soon have a prototype of a working solution better than a direct approach
- Gives an example of pairwise multiplication and 1024 bits numbers multiplication over BDDs, reducing exponential complexity
Refer to minute 7 of the video for more detailed technical explanation
Fola
- Legal work mostly done, which enables us to get onto European exchanges. Spoken to many exchanges, narrowing down what would be suitable and valuable for us. We are looking at Bittrex Global as a possibility, which the community has been asking about, among others
- Hiring: Hoping to get Umar on board next month, as well as looking for an RND manager
- Redesiging website and improve branding
- Whitepaper coming together and hopefully ready by mid March
Ohad
- Dragan continuing work on reording BDDs to make them dynamic
- Consensus detection is already working and now we can see an opinion map functioning from Andrei's update. Tomas enhanced the repl
- Helping an engineering professor complete the whitepaper
- Made some progress on second order logic mainly in adapting from the literature solving boolean equation in full second order logic. I've been considering three things:
1. gives more depth to BDDs and BDDs represent shallow data, a set of string of bits, but what if the bits represent something like a tree?
2. Considering how a generic solver would be like (fwd/bwd propagation based on unification of consequences with premises) which is set theory and is written in this way. So supporting data one step beyond BDDs allows us to get a solver for virtually any theory, especially the decidable theories.
3. Time for us to work on Agoras. We need to create the Agoras team and commence work. Made a major improvement in one of Agoras' aspects in the form of a theoretical breakthrough, but not yet ready to share details publicly yet.