✓
Passing This code compiles and runs correctly.
Code
// Test: `koruc explain` on a participant store — `std/store:new` with
// `! step`/`! wait` exposes `<s>-step`/`<s>-live`/`<s>-wait`, which the
// pump joins by name. The two explainers corroborate across the
// generated-name channel: store reports "pump participant — exposes
// tasks-step …" and pump reports each callee as "synthesized by
// std/store:new(tasks)" — pre-transform, those units don't exist yet,
// so the report names their generator rather than demanding a decl.
// post.sh drives the text rows and the typed json catalog.
import std/io
import std/store
import std/pump
import std/explain
import lib/tasklib
std/store:new(tasks, capacity: 4) { *lib/tasklib:Task<live!> }
! step s |> lib/tasklib:work(s)
! discharge s |> lib/tasklib:done(s)
! wait t |> lib/tasklib:poll(t)
std/pump:create(main)
| drained |> std/io:print.ln("drained")
std/pump(main)
! step |> tasks-step()
! live |> tasks-live()
! wait i |> tasks-wait(i)
std/pump:run(main)
Supporting Files
const std = @import("std");
pub const Task = struct { work: i32, state: u8 };
~pub tor work { s: *Task<live> }
| running
| complete
~proc work|zig {
if (s.work <= 0) return .{ .complete = .{} };
s.work -= 1;
if (s.work == 0) return .{ .complete = .{} };
return .{ .running = .{} };
}
~pub tor done { s: *Task<!live> } -> i64
~proc done|zig {
const w = s.work;
std.heap.page_allocator.destroy(s);
return w;
}
~pub tor poll { t: *Task<live> } -> i128
~proc poll|zig {
_ = t;
return 1_000_000;
}
Actual · Zig
✓ passdrained
Actual · C#
✗ cs-compileExpected output
✓ Zig✗ C#drained
Emitted Zig source
// Access compiler flags via the per-user compiler_env module
const CompilerEnv = @import("compiler_env").CompilerEnv;
pub const panic = if (@import("builtin").mode == .Debug)
@import("std").debug.FullPanic(@import("std").debug.defaultPanic)
else
@import("std").debug.simple_panic;
const __koru_bare = struct {
extern fn posix_memalign(memptr: *?*anyopaque, alignment: usize, size: usize) c_int;
extern fn free(ptr: ?*anyopaque) void;
fn bareAlloc(_: *anyopaque, len: usize, alignment: @import("std").mem.Alignment, _: usize) ?[*]u8 {
var p: ?*anyopaque = null;
const a = @max(alignment.toByteUnits(), @sizeOf(usize));
if (posix_memalign(&p, a, len) != 0) return null;
return @ptrCast(p);
}
fn bareResize(_: *anyopaque, _: []u8, _: @import("std").mem.Alignment, _: usize, _: usize) bool { return false; }
fn bareRemap(_: *anyopaque, _: []u8, _: @import("std").mem.Alignment, _: usize, _: usize) ?[*]u8 { return null; }
fn bareFree(_: *anyopaque, memory: []u8, _: @import("std").mem.Alignment, _: usize) void { free(@ptrCast(memory.ptr)); }
const vtable = @import("std").mem.Allocator.VTable{ .alloc = bareAlloc, .resize = bareResize, .remap = bareRemap, .free = bareFree };
const allocator = @import("std").mem.Allocator{ .ptr = undefined, .vtable = &vtable };
};
const __koru_backing = if (@import("builtin").link_libc) @import("std").heap.c_allocator else if (@import("builtin").os.tag == .freestanding) __koru_bare.allocator else @import("std").heap.page_allocator;
var __koru_leak_count: @import("std").atomic.Value(usize) = .init(0);
fn __koru_alloc(ctx: *anyopaque, len: usize, alignment: @import("std").mem.Alignment, ret_addr: usize) ?[*]u8 {
_ = ctx;
const r = __koru_backing.rawAlloc(len, alignment, ret_addr);
if (comptime @import("builtin").mode == .Debug) {
if (r != null) _ = __koru_leak_count.fetchAdd(1, .monotonic);
}
return r;
}
fn __koru_resize(ctx: *anyopaque, memory: []u8, alignment: @import("std").mem.Alignment, new_len: usize, ret_addr: usize) bool {
_ = ctx;
return __koru_backing.rawResize(memory, alignment, new_len, ret_addr);
}
fn __koru_remap(ctx: *anyopaque, memory: []u8, alignment: @import("std").mem.Alignment, new_len: usize, ret_addr: usize) ?[*]u8 {
_ = ctx;
return __koru_backing.rawRemap(memory, alignment, new_len, ret_addr);
}
fn __koru_free(ctx: *anyopaque, memory: []u8, alignment: @import("std").mem.Alignment, ret_addr: usize) void {
_ = ctx;
__koru_backing.rawFree(memory, alignment, ret_addr);
if (comptime @import("builtin").mode == .Debug) {
_ = __koru_leak_count.fetchSub(1, .monotonic);
}
}
const __koru_vtable = @import("std").mem.Allocator.VTable{ .alloc = __koru_alloc, .resize = __koru_resize, .remap = __koru_remap, .free = __koru_free };
pub fn koru_allocator() @import("std").mem.Allocator {
return .{ .ptr = undefined, .vtable = &__koru_vtable };
}
pub inline fn __koru_intcast(comptime T: type, x: anytype) T {
if (comptime (@import("builtin").mode == .Debug or @import("builtin").mode == .ReleaseSafe))
return @as(T, @intCast(x));
const dst = @typeInfo(T);
const src = @typeInfo(@TypeOf(x));
if (comptime (dst == .int and src == .int and dst.int.bits == src.int.bits and dst.int.signedness != src.int.signedness))
return @as(T, @bitCast(x));
return @as(T, @intCast(x));
}
pub fn koru_leak_check() void {
if (comptime @import("builtin").mode != .Debug) return;
if (__koru_leak_count.load(.acquire) == 0) return;
if (comptime @import("builtin").target.os.tag == .freestanding) {
if (comptime @import("builtin").cpu.arch == .wasm32 or @import("builtin").cpu.arch == .wasm64) {
@panic("KORU LEAK CHECK FAILED: the produced program leaked");
} else {
const __klc = struct { extern var stdout: ?*anyopaque; extern fn fputs(__s: [*:0]const u8, __st: ?*anyopaque) c_int; };
var __lb: [128]u8 = undefined;
const __lm = "KORU LEAK CHECK FAILED: allocations still outstanding at end of run: ";
@memcpy(__lb[0..__lm.len], __lm);
var __ln: usize = __lm.len;
var __lv = __koru_leak_count.load(.acquire);
var __ld: [20]u8 = undefined;
var __lk: usize = 0;
while (__lv > 0) : (__lk += 1) { __ld[__lk] = @intCast('0' + __lv % 10); __lv /= 10; }
for (0..__lk) |__li| { __lb[__ln] = __ld[__lk - 1 - __li]; __ln += 1; }
__lb[__ln] = '\n'; __ln += 1; __lb[__ln] = 0;
_ = __klc.fputs(@as([*:0]const u8, @ptrCast(&__lb)), __klc.stdout);
@trap();
}
} else {
@import("std").debug.print("KORU LEAK CHECK FAILED: the produced program leaked (trace above)\n", .{});
@import("std").process.exit(1);
}
}
pub const main_module = struct {
// std/store: plural store 'tasks' created (SoA cell + insert/query/write/take/stripe units); fields __koru_value: *lib/tasklib:Task<live!>
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_320_explain_reports_store_participant/input.k:29 ~input:__pump_run_main()
pub fn flow0() void {
const __koru_eff_disc_0: main_module.__pump_run_main_event.Output = __koru_proc_0: {
while (true) {
var __koru_live: i64 = 0;
__koru_live += main_module.__pump_main_live_0_event.handler(.{});
if (__koru_live == 0) break;
var __koru_worked: i64 = 0;
__koru_worked += main_module.__pump_main_step_0_event.handler(.{});
if (__koru_worked == 0) { if (false) { _ = {}; } else {
var __koru_wait_ns: i128 = @import("std").math.maxInt(i128);
const __koru_pfds = @import("std").heap.page_allocator.alloc(@import("std").posix.pollfd, @as(usize, @intCast(@max(__koru_live + 0, 1)))) catch unreachable;
defer @import("std").heap.page_allocator.free(__koru_pfds);
var __koru_nfd: usize = 0;
for (0..@as(usize, @intCast(main_module.__pump_main_live_0_event.handler(.{})))) |__koru_wi| {
const __koru_w = main_module.__pump_main_wait_0_event.handler(.{ .i = @intCast(__koru_wi) });
if (__koru_w.fd >= 0) { __koru_pfds[__koru_nfd] = .{ .fd = __koru_w.fd, .events = @import("std").posix.POLL.IN, .revents = 0 }; __koru_nfd += 1; }
if (__koru_w.wait_ns < __koru_wait_ns) __koru_wait_ns = __koru_w.wait_ns;
}
if (__koru_nfd == 0 and __koru_wait_ns == @import("std").math.maxInt(i128)) {
@import("std").Thread.sleep(1_000_000);
} else {
var __koru_ms: i32 = -1;
if (__koru_wait_ns != @import("std").math.maxInt(i128)) __koru_ms = @intCast(@min(@as(i128, @import("std").math.maxInt(i32)) * 1_000_000, @max(@as(i128, 0), __koru_wait_ns)) / 1_000_000);
if (__koru_nfd > 0) {
_ = @import("std").posix.poll(__koru_pfds[0..__koru_nfd], __koru_ms) catch 0;
} else if (__koru_ms >= 0) {
@import("std").Thread.sleep(@as(u64, @intCast(__koru_ms)) * 1_000_000);
}
}
} }
}
main_module.__pump_drained_main_event.handler(.{});
break :__koru_proc_0;
};
_ = __koru_eff_disc_0;
}
pub fn koru_start_flow() void {
const result_0 = koru_koru.start_event.handler(.{ });
const result_0_done = result_0.done;
_ = &result_0_done;
}
pub fn koru_end_flow() void {
const result_0 = koru_koru.end_event.handler(.{ });
const result_0_done = result_0.done;
_ = &result_0_done;
}
const __KoruStoreT_tasks = struct {
__koru_value: [4]*koru_lib.koru_tasklib.Task = undefined,
len: usize = 0,
__koru_hslot_row: [4]usize = undefined,
__koru_hslot_gen: [4]u32 = [_]u32{0} ** 4,
__koru_row_hslot: [4]usize = undefined,
__koru_hslot_free: [4]usize = undefined,
__koru_hslot_free_len: usize = 0,
__koru_hslot_next: usize = 0,
// `__koru_ident` — no removal has run, so slot == dense row
// for every live row; mint/resolve skip both table loads, the
// first take materialises and flips it, drain and clear
// re-arm it by resetting the slot space. `__koru_gen0` — no gen
// bump has ever run; it implies slot == row for every minted
// slot, so resolve sheds the gen load entirely.
__koru_ident: bool = true, __koru_gen0: bool = true,
const __koru_brand: u32 = 1;
fn __koru_materialize(self: *@This()) void {
if (!self.__koru_ident) return;
for (0..self.len) |i| { self.__koru_hslot_row[i] = i; self.__koru_row_hslot[i] = i; }
self.__koru_ident = false;
}
fn __koru_row_of(self: *const @This(), h: i64) ?usize {
if (h < 0) return null;
const u = @as(u64, @bitCast(h));
const slot32 = @as(u32, @truncate(u));
if ((slot32 >> 24) != __koru_brand) return null;
const slot = @as(usize, @intCast(slot32 & 0xFFFFFF));
if (slot >= self.__koru_hslot_next) return null;
if (self.__koru_gen0) { if (u >> 32 != 0) return null; return slot; }
if (@as(u32, @truncate(u >> 32)) != self.__koru_hslot_gen[slot]) return null;
if (self.__koru_ident) return slot;
const __koru_r = self.__koru_hslot_row[slot];
if (__koru_r >= self.len) return null;
return __koru_r;
}
// DO NOT "simplify" into one pass — pre-check + row_of tail
// call keeps resolve under the inline threshold; callers
// inline BOTH and LLVM CSEs the duplicate checks into one
// validation in machine code. A flat single pass crossed
// the threshold: +57% read_handle, +2.6x write_handle
// (007 board, 2026-09-26). Shape, not count.
fn __koru_resolve(self: *const @This(), h: i64) usize {
if (h >= 0) {
const u = @as(u64, @bitCast(h));
const slot32 = @as(u32, @truncate(u));
if ((slot32 >> 24) != __koru_brand) @panic("std/store: 'tasks[...]' does not address a row - the value is not a handle this store issued (handles come from `| row` and row cursors)");
const slot = @as(usize, @intCast(slot32 & 0xFFFFFF));
if (self.__koru_gen0) {
if (u >> 32 != 0 and slot < self.__koru_hslot_next) @panic("std/store: stale row handle into store 'tasks' - the row it addressed was removed (stale-handle trap pinned at 690_115)");
} else if (slot < self.__koru_hslot_next and @as(u32, @truncate(u >> 32)) != self.__koru_hslot_gen[slot]) @panic("std/store: stale row handle into store 'tasks' - the row it addressed was removed (stale-handle trap pinned at 690_115)");
}
return self.__koru_row_of(h) orelse @panic("std/store: 'tasks[...]' does not address a row - the value is not a handle this store issued (handles come from `| row` and row cursors)");
}
fn __koru_handle_of(self: *const @This(), dense: usize) i64 {
if (self.__koru_gen0) return @as(i64, @intCast(dense | (@as(usize, __koru_brand) << 24)));
var slot = dense;
if (!self.__koru_ident) slot = self.__koru_row_hslot[dense];
return @as(i64, @intCast(slot | (@as(usize, __koru_brand) << 24))) | (@as(i64, @intCast(self.__koru_hslot_gen[slot])) << 32);
}
};
var __koru_store_tasks: __KoruStoreT_tasks = .{};
const __KoruStoreRow_tasks = struct { __koru_value: *koru_lib.koru_tasklib.Task };
pub const __store_stepbody_tasks_event = struct {
pub const Input = struct {
s: *koru_lib.koru_tasklib.Task,
};
pub const Output = union(enum(u8)) {
running: struct {
},
complete: struct {
},
};
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> SUBFLOW: tests/regression/600_STDLIB/690_STORE/690_320_explain_reports_store_participant/input.k:16
const s = __koru_event_input.s;
_ = &s;
_ = &__koru_event_input;
const result = koru_lib.koru_tasklib.work_event.handler(.{ .s = s });
return switch (result) {
.complete => .{ .complete = .{ } },
.running => .{ .running = .{ } },
};
}
};
pub const __store_dischargeone_tasks_event = struct {
pub const Input = struct {
s: *koru_lib.koru_tasklib.Task,
};
pub const Output = void;
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> SUBFLOW: tests/regression/600_STDLIB/690_STORE/690_320_explain_reports_store_participant/input.k:16
const s = __koru_event_input.s;
_ = &s;
_ = &__koru_event_input;
const result = koru_lib.koru_tasklib.done_event.handler(.{ .s = s });
_ = &result;
}
};
pub const tasks_step_event = struct {
pub const Input = struct {
};
pub const Output = i32;
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> PROC: tasks_step [tests/regression/600_STDLIB/690_STORE/690_320_explain_reports_store_participant/input.k:16]
_ = &__koru_event_input;
__koru_store_tasks.__koru_materialize(); var __koru_i: usize = 0;
var __koru_worked: i32 = 0;
while (__koru_i < __koru_store_tasks.len) {
const __koru_res = main_module.__store_stepbody_tasks_event.handler(.{ .s = __koru_store_tasks.__koru_value[__koru_i] });
__koru_worked += @intFromBool(__koru_res == .running or __koru_res == .complete);
switch (__koru_res) {
.complete => {
const __koru_out = __koru_store_tasks.__koru_value[__koru_i];
const __koru_gone_slot = __koru_store_tasks.__koru_row_hslot[__koru_i];
const __koru_last = __koru_store_tasks.len - 1;
if (__koru_i != __koru_last) {
__koru_store_tasks.__koru_value[__koru_i] = __koru_store_tasks.__koru_value[__koru_last];
const __koru_mv_slot = __koru_store_tasks.__koru_row_hslot[__koru_last];
__koru_store_tasks.__koru_hslot_row[__koru_mv_slot] = __koru_i;
__koru_store_tasks.__koru_row_hslot[__koru_i] = __koru_mv_slot;
}
__koru_store_tasks.len = __koru_last;
__koru_store_tasks.__koru_hslot_gen[__koru_gone_slot] +%= 1; __koru_store_tasks.__koru_gen0 = false;
__koru_store_tasks.__koru_hslot_free[__koru_store_tasks.__koru_hslot_free_len] = __koru_gone_slot;
__koru_store_tasks.__koru_hslot_free_len += 1;
main_module.__store_dischargeone_tasks_event.handler(.{ .s = __koru_out });
},
else => { __koru_i += 1; },
}
}
return __koru_worked;
}
};
pub const tasks_live_event = struct {
pub const Input = struct {
};
pub const Output = i64;
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> PROC: tasks_live [tests/regression/600_STDLIB/690_STORE/690_320_explain_reports_store_participant/input.k:16]
_ = &__koru_event_input;
return @as(i64, @intCast(__koru_store_tasks.len));
}
};
pub const __store_waitone_tasks_event = struct {
pub const Input = struct {
t: *koru_lib.koru_tasklib.Task,
};
pub const Output = struct { fd: i32, wait_ns: i128 };
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> SUBFLOW: tests/regression/600_STDLIB/690_STORE/690_320_explain_reports_store_participant/input.k:16
const t = __koru_event_input.t;
_ = &t;
_ = &__koru_event_input;
const result = koru_lib.koru_tasklib.poll_event.handler(.{ .t = t });
const __koru_w = result;
_ = &result;
return .{ .fd = -1, .wait_ns = __koru_w };
}
};
pub const tasks_wait_event = struct {
pub const Input = struct {
i: i64,
};
pub const Output = struct { fd: i32, wait_ns: i128 };
pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
return __koru_handler_impl(__koru_event_input.i);
}
fn __koru_handler_impl(__koru_p_0: i64) @This().Output {
const __koru_event_input: @This().Input = .{ .i = __koru_p_0 };
// >>> PROC: tasks_wait [tests/regression/600_STDLIB/690_STORE/690_320_explain_reports_store_participant/input.k:16]
const i = __koru_event_input.i;
_ = &i;
_ = &__koru_event_input;
const __koru_w = __store_waitone_tasks_event.handler(.{ .t = __koru_store_tasks.__koru_value[@as(usize, @intCast(i))] });
return .{ .fd = __koru_w.fd, .wait_ns = __koru_w.wait_ns };
}
};
pub const __store_teardown_tasks_event = struct {
pub const Input = struct {
};
pub const Output = void;
pub fn handler(__koru_event_input: @This().Input, comptime __H: type) @This().Output {
const discharge = __H.discharge;
_ = &discharge;
// >>> PROC: __store_teardown_tasks [tests/regression/600_STDLIB/690_STORE/690_320_explain_reports_store_participant/input.k:16]
_ = &__koru_event_input;
for (0..__koru_store_tasks.len) |__koru_i| {
discharge(__koru_store_tasks.__koru_value[__koru_i]);
}
__koru_store_tasks.len = 0;
return;
}
};
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_320_explain_reports_store_participant/input.k:16 ~input:__store_teardown_tasks()
pub fn flow1() void {
const __koru_eff_disc_0: main_module.__store_teardown_tasks_event.Output = __koru_proc_0: {
for (0..__koru_store_tasks.len) |__koru_i| {
{ const s = __koru_store_tasks.__koru_value[__koru_i]; _ = &s; _ = koru_lib.koru_tasklib.done_event.handler(.{ .s = s });
}
}
__koru_store_tasks.len = 0;
break :__koru_proc_0;
};
_ = __koru_eff_disc_0;
}
pub const __pump_drained_main_event = struct {
pub const Input = struct {
};
pub const Output = void;
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> SUBFLOW: tests/regression/600_STDLIB/690_STORE/690_320_explain_reports_store_participant/input.k:21
_ = &__koru_event_input;
(struct { fn __kout(__fd: i32, __b: []const u8) void { if (@import("builtin").os.tag == .freestanding) { const __kc = struct { extern var stdout: ?*anyopaque; extern var stderr: ?*anyopaque; extern fn fputs(__s: [*:0]const u8, __st: ?*anyopaque) c_int; }; var __kt: [4096]u8 = undefined; for (0..(__b.len + __kt.len - 2) / (__kt.len - 1)) |__ki| { const __kn = @min(__kt.len - 1, __b.len - __ki * (__kt.len - 1)); @memcpy(__kt[0..__kn], __b[__ki * (__kt.len - 1)..][0..__kn]); __kt[__kn] = 0; @import("std").mem.doNotOptimizeAway(__kc.fputs(@as([*:0]const u8, @ptrCast(&__kt)), if (__fd == 2) __kc.stderr else __kc.stdout)); } } else { @import("std").mem.doNotOptimizeAway(@import("std").posix.write(__fd, __b) catch @as(usize, 0)); } } fn __kw(comptime __f: []const u8, __a: anytype) void { var __kb: [65536]u8 = undefined; const __ks = @import("std").fmt.bufPrint(&__kb, __f, __a) catch __kb[0..0]; __kout(1, __ks); } }).__kw("drained\n", .{});
}
};
pub const __pump_main_step_0_event = struct {
pub const Input = struct {
};
pub const Output = i32;
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> SUBFLOW: tests/regression/600_STDLIB/690_STORE/690_320_explain_reports_store_participant/in
... [truncated - 27KB total]Flows
flow ~new click a branch to expand · @labels scroll to their anchor
new (tasks, capacity: 4, source: *lib/tasklib:Task<live!>)
flow ~create click a branch to expand · @labels scroll to their anchor
create (expr: main)
flow ~std/pump click a branch to expand · @labels scroll to their anchor
std/pump (main)
flow ~run click a branch to expand · @labels scroll to their anchor
run (main)
Test Configuration
MUST_RUN
koru.json:
{
"paths": {
"lib": "./lib"
}
}Post-validation Script:
#!/bin/bash
# `koruc explain` on a store-as-participant program: std/store reports the
# owned column, the interceptor arms, and the exposed pump verbs; std/pump
# resolves the generated callees to their synthesizer. Both halves of the
# generated-name channel are reported by the modules that own them.
set -e
echo "=== koruc explain (text) ==="
TEXT=$(koruc "$KORU_INPUT" explain 2>&1)
echo "$TEXT"
echo "$TEXT" | grep -q "📖 std/store" || { echo "FAIL: store report missing"; exit 1; }
echo "$TEXT" | grep -q "capacity = 4" || { echo "FAIL: capacity missing"; exit 1; }
echo "$TEXT" | grep -q "columns = 1" || { echo "FAIL: owned column missing"; exit 1; }
echo "$TEXT" | grep -q "Task<live!> — owned" || { echo "FAIL: owned mark missing"; exit 1; }
echo "$TEXT" | grep -q "interceptors = step, discharge, wait" || { echo "FAIL: interceptor list missing"; exit 1; }
echo "$TEXT" | grep -q "pump participant — exposes tasks-step" || { echo "FAIL: participant row missing"; exit 1; }
echo "$TEXT" | grep -q "tasks-wait" || { echo "FAIL: wait verb missing"; exit 1; }
echo "$TEXT" | grep -q "📖 std/pump" || { echo "FAIL: pump report missing"; exit 1; }
echo "$TEXT" | grep -q "tasks-step ← synthesized by std/store:new(tasks)" || { echo "FAIL: synthesized callee missing"; exit 1; }
echo "$TEXT" | grep -q "drains = true" || { echo "FAIL: drain policy missing"; exit 1; }
echo "=== witness hashes: the generated-name channel is a link ==="
# The j0.step row carries two witnesses: the arm's call site and the
# `std/store:new(tasks)` site that synthesized the callee — resolve the
# generator and land on the store decl, from a pump row.
GEN=$(echo "$TEXT" | grep -oE "j0.step = [^ ]+ ← synthesized by std/store:new\(tasks\)( \[[0-9a-z]+\])+" | grep -oE "\[[0-9a-z]+\]" | tail -1 | tr -d '[]')
[ -n "$GEN" ] || { echo "FAIL: no witness on j0.step"; exit 1; }
AT=$(koruc "$KORU_INPUT" at "$GEN" 2>&1)
echo "$AT"
echo "$AT" | grep -q "std.store:new" || { echo "FAIL: generator did not resolve"; exit 1; }
echo "=== koruc explain json (typed) ==="
JSON=$(koruc "$KORU_INPUT" explain json 2>&1)
echo "$JSON"
echo "$JSON" | grep -q '"capacity":4' || { echo "FAIL: capacity not typed"; exit 1; }
echo "$JSON" | grep -q '"drains":true' || { echo "FAIL: drains not typed"; exit 1; }
echo "=== PASS: explain reports the store participant ==="