Tau Net & $AGRS embodies BTC's original cyberpunk vision and is explicitly built to remove centralized governance.
Tau Net ensures every user is counted, automatically implementing agreed updates without central control.👇
🧵2/6
Transactions on the Tau Net blockchain initially contain coin transfer orders and new requirement proposals.
Generally, transactions are tuples of Boolean algebra elements, e.g. Boolean functions, finite bit strings, Tau formulas, tables, or elements of any Boolean algebra supported by Tau. Initially, as above, the chain looks only at the first two elements of these tuples.
The tuples are then assembled as a table in a new proposed block. From there, coin transfer orders and new rule proposals follow two different paths.
🧵3/6 Requirement Proposals:
New requirements follow a different path; all new requirements in a block are conjuncted together, and this makes the part that everyone agrees on, denoted by “psi(Ψ)”.
In a third step, the “Agreed New Requirement Ψ” is fed to the “Update Built-in” output stream (having access to the rules at time T), which performs the Pointwise Revision procedure to produce the new requirement at time T+1.
🧵4/6
The coin transfer part of the transactions is expressed as “local deltas,” which are a table of addresses and amounts to transfer from each (positive or negative) transaction.
The local deltas are then summed by address to form the “Global delta”, which gives the net balance change for each address. Finally, the global delta is summed up with the current balances table, resulting in a new balances table. During the Balance Verification step, if any of the new balances are found to be negative, the entire proposed new block is rejected.
🧵5/6 The New State
Finally, the new balances table at time T+1 and the new rules at time T+1 form the new state at time T+1. The new rules at time T+1 will govern the calculation of the state at time T+2.
🧵6/6
Whats the latest update on Tau Net Test Net?
🛠 July Latest Dev Update – Building the Core of Tau Net’s TestNet Alpha
The team pushed further toward TestNet Alpha by finalizing block creation, improving parsing performance, and developing new algorithms for formula normalization.
Highlights:
- TestNet Alpha: Block creation, linking, and Merkle root storage completed
- SAT Solver: Migration from Z3 to CVC5 unlocked better normalization & satisfiability
- Parsing Engine: 60% performance boost + potential new parsing patent
- Language R&D: Anti-prenexing normalization & Boolean quantifier elimination spec ready.
Ohad has been reviewing the latest temporal logic papers. Tau Net and $AGRS remain far ahead of current academic progress in the field.
Timestamps:
00:12 - Karim’s Summary
03:48 - David (Lead Developer)
- Successfully switched from Z3 to CVC5, improving overall solver performance.
- Completed work on normalization, satisfiability, and interpreter modules with CVC5.
- Implemented Ohad’s suggested approach of deferring literal resolution for bit vector equations.
- Assisted Umar with code reviews and debugging.
05:36 - Lucca (Tau Language Developer)
- Developed the initial specification for an algorithm to eliminate function quantifiers for use in Tau’s table feature.
- Integrated it into the anti-prenexing normalization algorithm to handle formulas not covered by CVC5.
- Preparing to implement this algorithm now that the pseudo-code is finalized.
- Began using Tomáš’s new tree implementation and assisted in resolving its final issues.
08:30 - Andrei Korotkoff (Senior Developer)
- Completed testnet alpha milestone for block production and storage, including mempool handling, block linking, Merkle root computation, and database persistence.
- This work lays the foundation for the next milestone: persistent chain state based on block history.
- Developed a complex load testing tool to simulate Tau interpreter behavior and blockchain dynamics under pointwise revision.
11:20 - Tomáš Klapka (Senior Developer)
- Fixed several issues from the tree switch, including negation handling, grammar typos, and type inference errors.
- Refactored the parser library to be header-only.
- Created Docker support and nightly releases for the TGF tool and parser.
- Updated the Tau language to integrate the improved parser.
12:26 - Ohad (Founder & CTO)
- Focused on new algorithm design and team collaboration.
- Explored domain-independent languages to enhance decision procedures.
- Reviewed recent academic papers on temporal logic and confirmed Tau remains ahead of current research.
1.43K
40
The content on this page is provided by third parties. Unless otherwise stated, OKX is not the author of the cited article(s) and does not claim any copyright in the materials. The content is provided for informational purposes only and does not represent the views of OKX. It is not intended to be an endorsement of any kind and should not be considered investment advice or a solicitation to buy or sell digital assets. To the extent generative AI is utilized to provide summaries or other information, such AI generated content may be inaccurate or inconsistent. Please read the linked article for more details and information. OKX is not responsible for content hosted on third party sites. Digital asset holdings, including stablecoins and NFTs, involve a high degree of risk and can fluctuate greatly. You should carefully consider whether trading or holding digital assets is suitable for you in light of your financial condition.