RusDyn

6 ms·

1. 1.▲
   Capture-Quiet Decomposition: A Verification Theorem for Chess Endgame Tablebases(arxiv.org)

   1 points by RusDyn 7mo ago|0 comments
2. 2.▲
   WritBase – Open-source task management for AI agent fleets (MCP-native)(github.com)

   1 points by RusDyn 8mo ago|2 comments
3. 3.▲
   by RusDyn 8mo ago

   I built WritBase because AI agents need a shared, persistent task registry - not ephemeral state that vanishes between sessions. It's an MCP server that gives your agent fleet: - Scoped permissions (6 types: read, create, update, assig
4. 4.▲
   2M DNS domains compressed into 253 bytes – with proof of correctness(proofcodec.github.io)

   4 points by RusDyn 8mo ago|2 comments
5. 5.▲
   by RusDyn 8mo ago

   ProofCodec compresses deterministic policy tables (WAF rules, DNS filters, routing tables) by compressing the decision function, not the data. Every compressed artifact carries a proof that every input produces the correct output. Results:
6. 6.▲
   by RusDyn 8mo ago

   One concrete application we've been working on: exhaustive verification of deterministic policy tables - WAF rules, DNS filter lists, routing tables. The AI angle cuts both ways here. AI makes it cheaper to generate policy logic, which