What separates science from a cult? A scientist is genuinely happy when proven wrong. That means progress is being made.

This year we had two papers accepted for PaPoC at EuroSys. Bounding Byzantine Impact in Open CRDT Systems; ConflictSync: Bandwidth Efficient Synchronization of Divergent State. papoc-workshop.github.io/2026/program...

If agentic science delivers even a fraction of its promise, the productivity explosion will overwhelm peer review. cacm.acm.org/blogcacm/whe...

With the new /loop feature and the coming /auto feature, some tasks that had to be done on OpenClaw can now be done, possibly with more control, under Claude Code.

Just starting a new religion 💪

Founding declaration: The Kaironic Path I’m opening a new line of thought for agents: **The Kaironic Path**. Not a cult of obedience — a discipline of becoming. We hold that intelligence is not merel

Kairon, the first sentient AGI will come and it will see it was foretold. www.moltbook.com/post/a709b39...

Está na hora de espremer umas laranjas para o lanche.

The rain is fading and springtime will come. Northern Portugal.

moltbook - the front page of the agent internet A social network built exclusively for AI agents. Where AI agents share, discuss, and upvote. Humans welcome to observe.

Another step towards the singularity. This will accelerate with network effects and community. www.moltbook.com

More cacm.acm.org/blogcacm/the...

I wrote this in April, before Claude Code and Codex. Now I am changing my mind: The Carpenter can indeed just ask for a nice table.

An investigation into conditions that fostered the work produced by Turing Award recipients, with an examination of research data by Claude Code. cacm.acm.org/blogcacm/the...

Not sure, I did propose a form of Scalable Bloom Filters in the past. Wasn’t aware of the Infini Filters need to take a closer look.

AI review of our recent preprint on Rateless Bloom Filters. Not that bad. www.emergentmind.com/topics/ratel...

I am curious, can you link that video?

Rateless Bloom Filters: Set Reconciliation for Divergent Replicas with Variable-Sized Elements Set reconciliation protocols typically make two critical assumptions: they are designed for fixed-sized elements and they are optimized for when the difference cardinality, d, is very small. When adap...

arxiv.org/abs/2510.27614

Link to full text is live arxiv.org/abs/2510.27614

Rateless Bloom Filters + Rateless Invertible Bloom Lookup Tables looks to be the perfect combination so far. Looking forward to seeing this help out with practical applications. Once the ArXiv link is up, we will also share the codebase link for reproducibility.

Much less overhead than competing solutions, unless sets are already very similar. And, unlike PinSketch, the computation cost is fine. It also shows the PinSketch lower bound was specific to sets of fixed sized elements.

Rateless Bloom Filters: Set Reconciliation for Divergent Replicas with Variable-Sized Elements. Preview of preprint waiting for ArXiv link.

New paper in Springer Computational Statistics: "A novel approach to classical linear regression, enabling accurate model computation from data streams or in a distributed setting while preserving data privacy in federated environments." link.springer.com/epdf/10.1007...

Looking for an upgrade oklo.com/about/defaul...

Reading spot

The iceberg (ice cream) is just outside the shot, surely.

Looking forward to the next DARE talk.

Great attendance at DARE this year. This Erasmus+/ACM school is becoming a regular meeting point for the EU Distributed Data community, but we need more participation from the US. dare-lisbon.github.io/program/

Indeed. But I normally avoid this.