LOWER-STATE SIGNAL00%
STATE n_00MOVE THROUGH THE FIELD
CURRENT BASELINE100ORIGIN / n_00
LOWER FLOOR FOUNDTHIS COORDINATE BECOMES THE NEXT ORIGIN
DISCOVERROUTECOMPRESS

00 / THE LIVING COORDINATE

Find the next
lower state.

Every Yukora cycle begins from the current business state. Move through the field to discover a lower-cost coordinate. Once verified, it becomes the origin of the next cycle.

UNDERSTAND THE PROTOCOL ↓
T.C.A.P. / MANIFEST 000

A machine should earn the right to exist.

THE MACHINE
THAT REMOVES
ITSELF.

Yukora maps the work of a business, decides what deserves intelligence, and recursively compresses everything else toward zero.

ENTER THE PROTOCOL
I

THE FIRST LAW OF YUKORA

Use no more intelligence
than the truth requires.

Every token is a cost. Every handoff is latency. Every unnecessary process is a claim on the future.

NECESSARY WORKLOWEST VALID COST= Y

THE THREE DOORS

Every operation
must choose.

Yukora begins with judgment—not automation. Before work runs, it is classified by the kind of thinking it truly needs.

01 / KNOWN

COMPUTE

Predictable inputs. Repeatable rules. Route directly to deterministic code.

0INFERENCE TOKENS
02 / AMBIGUOUS
?

REASON

Context matters. Judgment compounds. Give one agent one bounded purpose.

1LOCAL INTELLIGENCE LAYER
03 / UNNECESSARY
×

REMOVE

No necessary output. No justification. The optimal implementation is absence.

0ONGOING COMPUTE
02

PROCESS DISCOVERY

Before choosing a tool,
find the real work.

Yukora does not optimize job titles or org charts. It decomposes the business into observable processes with inputs, decisions, outputs, and costs.

PROCESS ANATOMY / PRC_102

Customer
onboarding

  1. 01
    INPUT

    What enters the process?

    Account data
  2. 02
    TRANSFORM

    What changes?

    Validate + enrich
  3. 03
    DECISION

    Where is judgment used?

    Risk classification
  4. 04
    OUTPUT

    What necessary truth exits?

    Activated account
  5. 05
    COST

    What does the path consume?

    Time + tokens + coordination

03 / THE CLASSIFIER

Complexity is a signal.
Predictability is the gate.

Big-O describes how computational work grows. But the routing decision also needs to know whether the path is stable, whether context changes the answer, and how costly an error would be.

HIGH PREDICTABILITY / LOW CONTEXTDETERMINISTIC

Rules, sorting, validation, mapping.

LOW PREDICTABILITY / HIGH CONTEXTAGENTIC

Interpretation, synthesis, exceptions.

HIGH COST / LOW VALUEELIMINATE

Redundant approvals and unused outputs.

MIXED REQUIREMENTSHYBRID

Code handles the path. Intelligence handles the fork.

CONTEXT REQUIRED ↑ PREDICTABILITY →

04 / THE RECURSIVE DESCENT

What survives
must become
lighter.

Each cycle returns its cost as the next cycle’s problem. The system measures itself against itself until another pass can no longer defend the work it consumes.

CYCLECOST REMAININGSTATE
31
% OF ORIGINAL
OPERATING COST

05 / EPHEMERAL EXECUTION

Zip.
Run.
Detonate.

An agent exists only long enough to govern one bounded process. It receives the minimum relevant context, performs the work, records the result, and disappears.

01

PACKAGE

Assemble one purpose, one context, and one measurable objective.

02

EXECUTE

Run the localized agent without exposing the rest of the business.

03

SCORE

Write the verified result and cost trajectory back to the repository.

04×

REMOVE

Destroy the runtime. Preserve no ambient memory and no idle agent.

WHAT SURVIVES THE CYCLECODE · RESULT · SCOREZERO RUNTIME RESIDUE
06

THE EXECUTIVE MODEL

Local experts.
One global view.

Process agents optimize from inside. The executive layer sees across them, finding system-level opportunities no isolated agent can detect.

A01PAYMENTS24
A02ONBOARDING31
A03FULFILLMENT19
A04SUPPORT42
A05REPORTING0
A06ROUTING27
EXECUTIVEΣ

MERGE · COORDINATE · ELIMINATE

CONSOLIDATE

Two locally efficient processes become one globally efficient system.

ELIMINATE

A process whose output no longer justifies its cost resolves to zero.

07 / ONE PROCESS / BEFORE AND AFTER

The result
does not change.

The machinery does.

PRC_102

Customer
onboarding

Illustrative workflow
after twelve cycles.

BEFORE
12
HANDOFFS
8,400
TOKENS
4.2s
RUNTIME
AFTER
05
DETERMINISTIC STEPS
2,150
TOKENS
1.8s
RUNTIME
THE DISTANCE−74%

TOKEN CONSUMPTION

−57%

LATENCY

Illustrative protocol model. Performance depends on workflow structure and implementation.
08

DYNAMIC COMPOSITION

The score follows
the shape of reality.

A business is not static, so its efficiency metric cannot be static. The aggregate changes whenever work is discovered, divided, combined, or removed.

+
DISCOVER

A new process enters the map.

It receives its own baseline, routing decision, and cost trajectory.

÷
FRACTIONALIZE

One workflow becomes measurable parts.

Each subprocess can now receive the method appropriate to its nature.

CONSOLIDATE

Separate paths become one system.

Cross-process redundancy disappears from the global operating surface.

ELIMINATE

Unnecessary work resolves to zero.

The Yukora Score improves because the process permanently ceases to run.

THE YUKORA THESIS / 2026 → ∞

THE FUTURE IS NOT
MORE SOFTWARE.

IT IS LESS.

MAP YOUR FIRST PROCESS
TORRESJCHRISTOPHER@YUKORA.ORGMINIMIZE / VERIFY / REPEATTHE REPO IS THE STATE