Explanation
Work that keeps its meaning.
Radiolaria organises continuing application work. It connects a task’s purpose to actual computation, the results that are consumed, changing conditions, useful memory and the decisions of independent owners.
Website explanation ·
Start with a task
Suppose you are examining photographs while media services help present the work. An audio resource disappears. The useful question is what can continue, which result is still valid and what must now be done differently.
Radiolaria makes those relationships explicit. It is an architecture and application execution kernel/reference. “OS” describes this organisation of application work; it does not promise a bootable replacement for your computer’s operating system. The public source repository retains the earlier name Hedgehog.
The Workspace demonstration is a complete first path through this explanation. The Vision describes the human purpose and larger horizon behind it.
From a human question to an inspectable mechanism
Begin with what someone is trying to do and what changed. Then name the mechanism that carries that relationship: Work is bounded computation with a real input and result; Root is an owner's local decision role; DRS qualifies sources and useful memory for current use. A BSEP, or Bounded Semantic Evidence Packet, supplies structured context for semantic work, including uncertainty and limits.
Follow that explanation to the contracts, identifiers and recorded fields when you need to inspect it. The names give the story precision; they do not replace the task or imply a human click for every internal computation.
A map of the relationships
The following is an explanatory map, not a claim that every connection ran together in one recorded experiment.
Purpose → bounded Work → actual results → later consumption.
Time and memory qualify which sources and retained results can be used now.
Computing participants contribute proposals, calculations and observations.
Independent owners decide within their own scope; a consequential effect needs current permission.
Capability creation → examination → admission can make new work available for later tasks.
Seven relationships give this map its substance.
Intent becomes Work
An intention describes what someone wants to accomplish. Work turns a bounded part of that intention into computation with declared inputs, sources, scope, budget and results. A semantic model may help interpret the task and propose structure. Runtime materialises and validates the actual execution topology.
A plan written in prose is therefore distinguishable from a program that has run. This matters when asking what a model contributed: its actual fields must reach downstream computation, rather than appearing only in a caption.
Results are composed and consumed
Work can depend on other Work. A parent consumes the exact output of a child under a defined binding. One result may be retained while another is recomputed, with the parent using both in their proper places.
This makes composition more than a collection of named tools. There is a concrete relationship between a producer field and the computation that uses it. A hash or a reference to an upstream program helps identify material, but does not alone establish that the material was consumed.
Time makes continuation explicit
A task, a resource, a result and a permission can have different lifetimes. The loss of a resource can require new work while leaving another result useful. An expired action packet remains expired even if fresh information becomes available.
Workspace records that distinction. Photo work is retained; selected media work is recomputed; an old packet is refused. Separately approved saving later writes a selection sidecar. Reading the sequence makes clear what continued and what required a new decision.
Memory needs current applicability
Memory preserves provenance, history and previous results. Retrieval also asks whether a record is eligible for the current purpose, policy and time. A historical result can remain intact while becoming unsuitable for current use.
Three levels of reuse are useful to keep separate:
- Within a task: retain an applicable result and selectively recompute affected work.
- Between tasks: reuse an available capability or qualified history with a fresh applicability check. This is not model-weight training, and it does not renew a previous permission.
- Across organisations and devices: a proposed native ecosystem could make common capabilities reusable more widely. Its infrastructure, compatibility and adoption remain further work.
The reference includes bounded mechanisms for the first two levels. The wider economic idea concerns shared development plus local configuration, compatibility, execution and maintenance, rather than a promise that every later application costs nothing.
Independent owners keep independent decisions
A client, a venue, an airline or a bank can each have a local Root. These Roots express separate ownership boundaries. They are not steps in one business hierarchy, and computational nesting does not create a new owner at every level.
Capability ≠ authority. A valid foreign signature can identify signed bytes. It does not supply local consent or establish the truth of every external observation. A result can be accepted for information without authorising an effect. Consequential action requires a current, scoped local permission and the supported effect path.
Root is a local decision role. It does not mean that a human must click “yes” for every internal computation. Integrators still have to define the owner’s policy, evidence checks and any human approval requirements.
Different computers can contribute
A language model, ordinary typed code, a numerical solver and a QPU can have different jobs in one computation. Their outputs need a defined form and an actual consumer. A solver searches; a checker evaluates the candidate against the original conditions. Successful transport from a device does not establish a correct result.
Wedding makes these distinctions visible. Its recorded semantic input changes computation; a separate QPU episode supplies samples that are checked before consumption. That establishes a bounded role for heterogeneous computation, without establishing a general quantum advantage.
Capabilities can be created and admitted
A missing ability is also a development task. The domain defines what is needed; an author builds a candidate using supported interfaces; examination assesses the result; source and capability admission have their own scope. The capability can then participate in future Work.
The reference also contains bounded discovery and reuse paths for missing pure capabilities. These do not establish arbitrary autonomous plugin installation or a finished global capability marketplace. Creating code, admitting it and permitting a particular action are separate decisions.
Build explains the engineering route. Workshop shows how a person and assistants can organise that work in practice.
A small glossary
| Term | Meaning here |
|---|---|
| Work | Bounded typed computation with explicit input, source, scope, budget, result and consumption. A task description alone is not evidence that Work ran. |
| Root | The local final decision and commit role for an owner. Root is distinct from the human interface and from the concrete execution Host. |
| DRS | The system’s source and memory route for discovering material and controlling access with provenance, time, scope and policy. Discovery is distinct from obtaining a body or permission to act. |
| BSEP | Bounded Semantic Evidence Packet: structured context for semantic work, including relevant facts, uncertainty, rejected routes and required guards. It is neither truth nor consent. |
| Capability | An available, bounded ability to perform a kind of computation or operation. Having it does not itself authorise every use. |
| Effect | A consequential operation on state outside pure computation. Its permitted scope, actual execution, receipt and any later history remain distinct. |
Follow one complete example
Continue with Workspace: a resource changes, useful work remains. It connects the human task to exact recorded fields and their source file. Then use the Research map to explore the contracts, seven Geometry Atlas views and limits behind the wider architecture.
Fresh for which decision?
An observation's event time, arrival time, logical ordering and permission window answer different questions. Late delivery cannot refresh an old measurement. Sentinel makes purpose, statistic, unit and independent lineage part of admissible knowledge; Testflix separates paid period, playback session, device grant and explicit renewal.
History stays. Current use is checked again
A remembered success remains history when permission expires or a source is revoked. External DRS qualifies material for the local consumer using current source status. Experience shows reusable informational Work alongside a current read and two current Root reviews. Root names a local decision role, not an obligatory manual click for every internal operation.
A better score cannot buy a forbidden action
AVF and finite budget profiles compare eligible alternatives. A stronger advisory score cannot relax a hard condition or grant a business effect. The G4 account shows changed performed Work with the same budget; its units are not money or tokens. FullAVF and StrongGT remain separate mathematical horizons.
Different demonstrations. One execution model.
The eight relationships connect these stories. Growth follows changed input, affected continuation, child composition, retrieval of an existing pure capability and independent creation of new code. Geometry Atlas supplies seven complementary views with exact sources.
Work and authority
These seven editorial relationships distinguish a useful contribution from an owner's decision. They are reading aids, not seven new theorems or API identifiers. Root remains a local decision role under an owner's policy.
Proposal ≠ Authority — A proposal is still a contribution to an owner's decision. Meaning becomes bounded Work →
Capability ≠ Authority — The ability to compute does not give power over another owner's action. Independent local decisions →
Result ≠ Permission — A returned result does not authorise a later effect. An offer and a mock booking →
Measurement ≠ Decision — A measurement needs an applicability check and a separate decision about its use. Measured, checked and consumed →
Memory ≠ Renewed Consent — Preserved history does not extend an expired permission. History and current applicability →
Evidence ≠ Permission — Checked evidence informs a decision; it does not replace it. A foreign result, a local decision →
Delegating Work ≠ Delegating Authority — Entrusting work to a participant does not automatically transfer all of the owner's decisions. Delegate work. Keep authorship. →
Sources and scope
Full references and publication scope
Intent and continuing work
— publication explanation; ref800f38c3407b3f4ec93dc943c977ffeecb614881; pathdocs/showcase/radiolaria_os_v01/chapters/01_intent.md. Source date: 2026-09-29. Access: HTTP_200; complete chapter text read; checked 2026-10-02.Architecture and relationships
— publication explanation; ref800f38c3407b3f4ec93dc943c977ffeecb614881; pathdocs/showcase/radiolaria_os_v01/chapters/02_geometry.md. Source date: 2026-09-29. Access: HTTP_200; complete chapter text read; checked 2026-10-02.Time, memory and continuation
— publication explanation; ref800f38c3407b3f4ec93dc943c977ffeecb614881; pathdocs/showcase/radiolaria_os_v01/chapters/03_time_memory.md. Source date: 2026-09-29. Access: HTTP_200; complete chapter text read; checked 2026-10-02.Different computing participants
— publication explanation; ref800f38c3407b3f4ec93dc943c977ffeecb614881; pathdocs/showcase/radiolaria_os_v01/chapters/04_compute.md. Source date: 2026-09-29. Access: HTTP_200; complete chapter text read; checked 2026-10-02.Experience, choice and finite expenditure
— publication explanation; ref800f38c3407b3f4ec93dc943c977ffeecb614881; pathdocs/showcase/radiolaria_os_v01/chapters/05_experience.md. Source date: 2026-09-29. Access: HTTP_200; complete chapter text read; checked 2026-10-02.Integration and authorship
— publication explanation; ref800f38c3407b3f4ec93dc943c977ffeecb614881; pathdocs/showcase/radiolaria_os_v01/chapters/11_integration.md. Source date: 2026-09-29. Access: HTTP_200; complete chapter text read; checked 2026-10-02.Accepted architecture lock
— accepted architecture contract; ref2e965ecb18e545e428380eb8e9aa5a7037a388be; pathspecs/current_architecture_lock_v01.md. Source date: accepted technical basis A. Access: HTTP_200; orientation passages inspected; explanatory handoff consulted; checked 2026-10-02.Public Work Assistant Handoff
— author supplied engineering context explanatory companion; refpublic snapshot 2026-10-01; pathpublic/downloads/RADIOLARIA_PUBLIC_WORK_HANDOFF_EN_V01_20261001.txt. Source date: 2026-10-01. Access: complete supplied text read; expected bytes and SHA-256 verified locally by task intake; checked 2026-10-02.
This page is a website explanation, updated 2026-10-02. Its explanation does not create a new execution result or change the status of its sources.
