Submit
A known workload enters with a bounded payload.
Kalkey coordinates approved workers, records every attempt, and turns interrupted work into recoverable progress.
A known workload enters with a bounded payload.
One worker owns the job for a limited time.
The result and its attempt history remain visible.
Kalkey starts with deterministic coordination—not an open-ended agent with unlimited reach.
Workers execute only workload types and payload shapes the operator has explicitly approved.
A job belongs to one worker at a time, preventing duplicate completion during concurrent operation.
Expired leases return safely to the queue with bounded retries and a preserved attempt history.
Operational improvements can be proposed with evidence; permission and spending changes remain human decisions.
Results, errors, and improvement proposals carry a record that can be reviewed.
Interrupted work is recovered deliberately instead of disappearing or running forever.
New workers, capabilities, and costs arrive only after the smaller system has proved itself.
The coordinator, persistent job store, recovery loop, localhost console, and independent worker package have been exercised with synthetic workloads.