Search site

Type a word or phrase to search public pages.

    Distributed task trees

    Keep identity, authority, execution, and accounting connected as work spans machines.

    One accountable work hierarchy

    Tasks are distributed by design. A tree often starts on or near the user's own hardware, then spans gateways, query hosts, and workers. Each task retains the user or accountable principal it serves, alongside the machine executing it.

    A child task can perform a remote query, fetch external information, or contribute another step without losing its connection to the original operation.

    Many transactions, one operation

    A tree can contain many workspace transactions, also called database transactions, across multiple workspaces. Each transaction records its own changes and outcome. The tree connects them into the larger activity.

    For an assessment, one branch may gather information, another task calculate a result, and later transactions record the decision and its accounting. Their relationship remains inspectable even when different machines perform the steps.

    An umbrella for usage and cost

    Measurements attach to the tasks that consumed resources. The tree connects those observations to token calculation and transaction accounting, including multiple paying parties and their wallets. The acting user need not be the payer; contributing providers can have separate receiving wallets.

    Payments and budgets explains the financial controls. End-to-end observability brings execution and accounting into view.

    Cancellation and deadlines.

    Developer reference

    Technical details

    Identity and execution

    TaskTreeId identifies the operation; TaskNodeId identifies one node with immutable parentage. The trace/span mapping uses 128-bit trace IDs and 64-bit span IDs, matching OpenTelemetry's trace model. An owning session propagates to remote descendants without merging unrelated trees from that session.

    A block-persisting leaf owns a workspace transaction; a compute-only leaf can finish without committing graph state. A distributed task tree is not one atomic database transaction. Parent/child execution edges and commit predecessor edges encode different dependencies.

    Funding context

    Claims bind contribution, quantity, unit price, payer, recipient and task/transaction IDs. They survive aggregation across machines. Transaction-linked audit trail covers durable publication and settlement evidence.