temz

* help me help you *GEARED and Guided* help you help me*

[Tau Net @Tau_Net]

Formal verification engines that orchestrate LLMs as bounded oracles rather than replacing structured reasoning with token prediction. That's where the trillion dollars gets unlocked.

The honest answer is you need a different paradigm for structured reasoning. Logical AI handles this natively. Probabilistic models don't, by design.

[Tau Net @Tau_Net]

"Never access secrets without approval" written as policy gets checked at runtime and hoped for. Write it as a formal constraint in the agent's own specification language, and the synthesizer provably satisfies it across all code paths, including future updates that haven't been written yet.

We've spent years making "never do X" constraints work in a decidable system. We invite you to check out our progress.

https://t.co/y30MD43UC3

[temz @temz1991]

@jerrybanfield @XMoneyPay Now do @Tau_Net

[temz @temz1991]

@Zeb63195904 @Kabelo_Prinxe Obviously #agoras

[temz @temz1991]

@covenant_ai have you lads ever considered looking into @Tau_Net as a decentralized alternative

Bless you :D

[CriptoSHAman @cript0shaman]

@lopp Code restrictions... here is your solution! https://t.co/bwgZ0BB8l2

[Tau Net @Tau_Net]

Tau Language just got dev docs for extending the system with new base Boolean Algebras.

The structures Tau uses to abstract sentences, enabling the only formal language that can decidably refer to its own rules without paradoxes. A critical ingredient for Safe Agentic AI.

5-step guide for implementing custom BAs: template specialization, logical operators, comparison, constant parsing, and hash support.

Sharing breakthroughs with the community. Not just another EVM fork!

🔗 https://t.co/nWkymLwjvr

[Tau Net @Tau_Net]

Yes, picking up pennies in front of a steamroller.

Circuit breakers help but this situation indicates that DeFi currently lacks a mechanism to enforce safety invariants that persist regardless of governance changes.

Defi protocols need a formally guarantee the safety conditions users agreed to. No future upgrade, vote, or parameter change should violate these conditions.

Currently, smart contracts are write-then-verify and then hope the next governance proposal does not introduce a contradiction.

We’re implementing Ohad Asor’s research. In his system, users can specify: 'If any future command contradicts these safety conditions, do not perform those commands.' This cannot be done in any formal language except Tau.

Instead of writing code and then checking if it's safe, you specify what the system must guarantee. This includes the safety conditions. The program is then built from this specification, making it correct by construction rather than by audit.

The key innovation is a language capable of referencing its own rules, including those governing change. For instance, one might specify, 'If a future governance change contradicts these safety conditions, reject it.' This is enforceable at the language level, rather than through a social contract. While mathematically impossible in other formal languages, the Tau team addressed this using their novel temporal logic, GS.

We’re building Tau Net and using the Tau Language to directly address the need for persistent, provable safety guarantees that can withstand governance evolution.

- GS Paper (arXiv): arxiv .org/abs/2407.06214
- Tau Language repo: github .com/IDNI/tau-lang

Look forward to your thoughts🙏
Thanks, The Tau Team!

[Fox @realfox1337]

New interactive demo:
“Is Monero’s Future Truly Private?”
https://t.co/PMzfFPLMKE

Privacy is not just about stronger primitives or a bigger anonymity set.
It’s whether the rules of the system still hold over time.

Highly relevant for Monero’s FCMP++ era:

It compares 4 approaches side by side:
• simulation
• formal verification
• AI pattern matching
• Tau temporal verification

#Monero #Tau #Privacy #Cryptography @Tau_Net @TauLogicAI

[Tau Net @Tau_Net]

The plateau is real, but it's specific to probabilistic AI. LLMs approximate, and there's a natural limit to how much approximation can be extracted from training data.

There is also Symbolic AI. Systems that reason through formal logic, have different scaling properties. The ceiling is the expressibility of the specification language apposed to compute and those are tractably solvable problems.

Not all AI is probabilistic. :)

https://t.co/g5MGFYDzhK

[Tau Net @Tau_Net]

🛠 March Dev Update - Tau API Complete, Docker Gone, Tables Algorithm Settled

Three main accomplishments this month:

1. The Tau API is fully implemented with a complete test suite. The REPL now goes through the API. This is the foundation every external tool will build on.

2. Tau Net nodes now call Tau Language directly via native bindings. The Docker workaround is gone.

3. A first algorithm for Boolean function quantifier elimination has been settled. This unlocks table support, which is a feature the team has been working toward for a long time. Tables make it possible to implement real-life programs in the Tau Language. Handling arrays that may themselves contain arrays, which is essential for any practical application built on the network

But, there is more:

- Bitvector simplification rebuilt using reverse Polish notation. Single post-order traversal and faster than before
- Web wallet refreshed, now connects to main mining node by default
- BDD library being built for Tau formulas, which enables long-planned normalization optimizations
- Docker containers created for easy local node setup (two commands)
- Ohad's temporal extensions paper in progress - making Tau Language strictly more expressive than LTL

"Now that the long effort of supporting tables is finally settled, I'm working on the paper with the temporal extensions of the Tau Language. It will be strictly more than LTL, and hopefully much more appealing to researchers in the field of formal methods and software synthesis."
— Ohad Asor

Timestamps & Speakers:
0:10 – Karim Kaddeche (Development Overview)
6:24 – Tomáš Klapka (Tau Language Developer)
7:45 – David Castro Esteban (Lead Developer)
10:16 – Lucca Tiemens (Tau Language Developer)
13:19 – Andrei Korotkoff (Senior Developer)
16:54 – Ohad Asor (Founder & CTO)

[temz @temz1991]

@Tau_Net @ChristosTzamos

[Tau Net @Tau_Net]

@ChristosTzamos Nice! Here is Tau's Sudoku Solver doing the same Sudoku.

Our approach is to express the Sudoku as logical constraints, and our SMT solver does the rest.

[CriptoSHAman @cript0shaman]

@ChristosTzamos When the program understands the rules, brute force isn't necessary... https://t.co/DhI6LK8a2w

[Tau Net @Tau_Net]

7/ - Test stability

Stabilized test teardown and refreshed pytest config. More reliable CI means fewer false failures blocking progress.

If you've been hesitant to contribute because CI felt unreliable — that's fixed. PRs now get trustworthy test results.

https://t.co/HHRC2GV0pb

[temz @temz1991]

@Fola_Adejumo Same

[Fola @Fola_Adejumo]

I truly believe we're the one project doing the right thing, in a sea projects doing the wrong thing.

[temz @temz1991]

@boobillions

[temz @temz1991]

@DrunkM66 Check $agoras / #taunet

I genuinely Believe

[Tau Net @Tau_Net]

There's a better path that does't infer preferences.

97% of DAO holders never participate. The answer to this is architecture where stating your conditions once gives you continuous representation.

Formal specifications + MPC is strictly more powerful than natural language + MPC. You can prove consistency of logical statements and also without revealing them.

https://t.co/1kNlmkrdX8