New patch release 3.2.53 is out with fixes in storage and network, please update asap, release notes https://github.com/orientechnologies/orientdb/releases/tag/3.2.53
New patch release 3.2.53 is out with fixes in storage and network, please update asap, release notes https://github.com/orientechnologies/orientdb/releases/tag/3.2.53
Patch release 3.2.52 out with fixes in query engine and date conversion more at https://github.com/orientechnologies/orientdb/releases/tag/3.2.52
Let me use this time to write down what I'm building. Not what's in my git repos. What's in my head.
The system is distributed. And distribution is optional. Each node has their own state, their own runtime, their own persistence. All one thing.
Each node in the system is a content-addressed Merkle Tree. Not SHA. Coincidence. A spectral coincidence hash. 5 dimensions. (1 more than spacetime.)
A spectral coincidence hash describes the structure of the data. You can do math on that. Spectral graph analysis. The world becomes navigatable. Because everything has an address.
Each computation. Each inference. Each failure. Each partial success. Each time information was lost. All of it enters the graph. All of it local. All of it distributed if needed. (For the BEAM engineers: it's an mnesia backend.)
A system that doesn't only know what it knows and what it doesn't. A system that knows how it got there. And AI that lives inside that knowledge.
That's what I'm building.
#SovereignTechFellowship grant application open. Release on the horizon. Wish me luck!
First quarter 2026 update for #OrientDB https://orientdb.dev/news/orientdb-work-in-progress-update-2026-q1/ have a good read
Also if you are into #rdf and #knowledgegraph you have heard of tinker pop gremlin 馃懝 then the following pipeline might remind you some good souvenir:
麓麓麓
(let ((g (make-graph gremlin-n gremlin-e 10 12345)))
(display "Graph: ")
(display gremlin-n)
(display " vertices, ")
(display gremlin-e)
(display " edges/vertex, 10 groups")
(newline)
(let ((tri (time
(traverse g
(V)
(as a)
(out)
(as b)
(where (same-group? g a b))
(out)
(as c)
(where (same-group? g a c))
(where (edge? g c a))
(count)))))
(display tri)
(display " triangles")
(newline)))
麓麓麓
ref: https://github.com/amirouche/seed/blob/seed3/src/src/seed3/benchmarks/gremlin-pipeline.seed3
New patch release out with minor fixes in backup scheduling and view refresh, release notes https://github.com/orientechnologies/orientdb/releases/tag/3.2.50
A deep ontology is a virtue, but recursion scales poorly.
In the humanities, we crave nuance. In the engine room, we crave performance.
By trading recursive graph traversals for materialized paths, we achieve both without sacrifice.
https://resonism.substack.com/p/breaking-the-curse-of-recursion