Fractal Self-Describing Nodes

01  What FSDN is

A node is any unit of organization - a whole portfolio, a project, a sub-tool, a single catalog entry. The word is deliberate: a node is never just an item; it is a thing among other things that knows its place among them. Under FSDN, each one carries its own overview inside itself, named for it - made by the same rule as every other node, at every depth - so what lies below any node is computed, never written. Nothing is kept, so nothing goes stale.

02  The mechanism

A single rule of construction makes the law concrete: a container's overview is named after the container. Because the description lives inside the thing and carries its name, it can't separate from it - that co-location is what the law structurally enforces; completeness and accuracy stay a discipline.

Written as code, the rule is one function that calls itself - the way a fractal tree is drawn:

There is no depth parameter. A fractal tree drawn by code is draw(branch, depth - 1): its branches don't exist until the rule invents them, so the rule has to carry its own stopping point. This one stops where the data stops - at a node with no children - which is why the law can say at every depth without naming one.

What the rule asks of you. Every container gets a self-named overview - don't create a node that can't describe itself - but only containers, and only when there is something to say: a leaf describes itself in-band, in its own header, and a grouping folder whose contents are self-evident can go without. The law governs the name, not the file type - a code package already describes itself through its docstring or README and needs no parallel .md. The test: would a human navigate here to understand the system? If yes, it earns the overview. A parent may still curate a list of what's below it; nothing may depend on that list.

03  Why it matters

Why enforce FSDN instead of keeping a good index by hand? Because the law buys what a maintained map can't. The description can't drift from the thing: it lives inside what it describes and carries its name, so rename, move, or delete a node and its description travels with it. Navigation doesn't dead-end: land at any depth and you can read where you are, step up to its context, or down into its parts, with no guide who already knows the layout. It scales without a center: no master document has to know everything, so add a thousand nodes and nothing is rewired. And it's traversable by machines as well as people: one rule at every depth means a tool - or an AI agent - can walk the whole structure with no instructions for any of it. Self-similarity is an API.

04  A worked example

Say you add pho to the Y3K Cookbook. The law decides the shape before you do:

One rule produced all of it - front matter, a chapter opener, recipe cards, and, because a broth is a recipe, a recipe inside the recipe: describe(pho) calls describe(broth). The photos are named for what they show, not for the dish; the folder already says pho. The table of contents is ls, and the index at the back is generated from the cards - every cookbook you own already computes both. Skip the rule and you get the folder everyone has: hero.jpg and nothing beside it. You can see what it was. You can't make it again.

05  Lineage

This is a deliberate synthesis, not a coinage from nothing. What's genuinely new is none of the pieces below but their fusion - and the insistence on enforcing it: the synthesis becomes a rule of construction rather than a description added after the fact - a self-naming overview at every depth, so a structure can never drift from the thing that explains it. The ideas it fuses:

• Self-similarityfractal Mandelbrot, 1975 - a shape made by one generator applied at every depth without end, so that any part, magnified, is the whole again. FSDN is that construction with describe() as the generator and nodes in place of segments. The name is not a metaphor.
• The Composite patternin code Gang of Four - a leaf and a composition present the same interface, so the caller never branches on which one it holds. Look again at the generator: nothing in it asks whether a node has children. For a leaf, the loop simply runs zero times.
• Holon & holarchywhole-and-part Koestler, 1967 - a thing that is simultaneously a whole and a part. The closest single-named ancestor.
• HATEOAS · Zettelkasten · Maps of Contentup/down links Hypermedia that carries its own links; atomic notes, each self-contained yet an index to others. The “no dead-ends” property.