vyre-conform 0.1.0

Conformance suite for vyre backends — proves byte-identical output to CPU reference
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
use vyre::ir::{AtomicOp, BinOp, BufferDecl, DataType, Expr, Node, Program};
use vyre_conform::{reference::interp, spec::value::Value};

fn bytes(words: &[u32]) -> Vec<u8> {
    words.iter().flat_map(|word| word.to_le_bytes()).collect()
}

fn words(bytes: &[u8]) -> Vec<u32> {
    bytes
        .chunks_exact(4)
        .map(|chunk| u32::from_le_bytes([chunk[0], chunk[1], chunk[2], chunk[3]]))
        .collect()
}

fn output_bytes(value: &Value) -> &[u8] {
    let Value::Bytes(bytes) = value else {
        panic!("reference output must be raw bytes");
    };
    bytes
}

#[test]
fn binop_i32_negative_adds_without_u32_coercion() {
    let program = Program::new(
        vec![BufferDecl::read_write("out", 0, DataType::I32)],
        [1, 1, 1],
        vec![Node::store(
            "out",
            Expr::u32(0),
            Expr::add(Expr::i32(-1), Expr::i32(1)),
        )],
    );

    let outputs = interp::run(&program, &[Value::Bytes(vec![0; 4])])
        .expect("i32 addition must not coerce through u32");

    assert_eq!(output_bytes(&outputs[0]), 0i32.to_le_bytes());
}

#[test]
fn binop_u64_preserves_upper_word() {
    let mut input = 0x1_0000_0000u64.to_le_bytes().to_vec();
    input.extend_from_slice(&1u64.to_le_bytes());
    let program = Program::new(
        vec![
            BufferDecl::read("input", 0, DataType::U64),
            BufferDecl::read_write("out", 1, DataType::U64),
        ],
        [1, 1, 1],
        vec![Node::store(
            "out",
            Expr::u32(0),
            Expr::add(
                Expr::load("input", Expr::u32(0)),
                Expr::load("input", Expr::u32(1)),
            ),
        )],
    );

    let outputs = interp::run(&program, &[Value::Bytes(input), Value::Bytes(vec![0; 8])])
        .expect("u64 addition must preserve all 64 bits");

    assert_eq!(output_bytes(&outputs[0]), 0x1_0000_0001u64.to_le_bytes());
}

#[test]
fn unop_negate_i32_min_wraps_without_panic() {
    let program = Program::new(
        vec![BufferDecl::read_write("out", 0, DataType::I32)],
        [1, 1, 1],
        vec![Node::store(
            "out",
            Expr::u32(0),
            Expr::negate(Expr::i32(i32::MIN)),
        )],
    );

    let outputs = interp::run(&program, &[Value::Bytes(vec![0; 4])])
        .expect("i32::MIN negation must use wrapping semantics");

    assert_eq!(output_bytes(&outputs[0]), i32::MIN.to_le_bytes());
}

/// Verifies vector-add OOB guards ignore excess invocations, closing corruption from stores past declared output length.
#[test]
fn executes_vector_add_with_oob_invocations_ignored_by_program_guard() {
    let idx = Expr::var("idx");
    let program = Program::new(
        vec![
            BufferDecl::read("a", 0, DataType::U32),
            BufferDecl::read("b", 1, DataType::U32),
            BufferDecl::read_write("out", 2, DataType::U32),
        ],
        [4, 1, 1],
        vec![
            Node::let_bind("idx", Expr::gid_x()),
            Node::if_then(
                Expr::lt(idx.clone(), Expr::buf_len("out")),
                vec![Node::store(
                    "out",
                    idx.clone(),
                    Expr::add(Expr::load("a", idx.clone()), Expr::load("b", idx)),
                )],
            ),
        ],
    );

    let outputs = interp::run(
        &program,
        &[
            Value::Bytes(bytes(&[1, 2, 3, 4, 5, 6])),
            Value::Bytes(bytes(&[10, 20, 30, 40, 50, 60])),
            Value::Bytes(bytes(&[0; 6])),
        ],
    )
    .expect("interpreter should execute vector add");

    assert_eq!(
        words(output_bytes(&outputs[0])),
        vec![11, 22, 33, 44, 55, 66]
    );
}

/// Verifies OOB load, store, and atomic operations are defined, closing corruption from unchecked memory access.
#[test]
fn enforces_oob_load_store_and_atomic_contract() {
    let program = Program::new(
        vec![
            BufferDecl::read("input", 0, DataType::U32),
            BufferDecl::read_write("out", 1, DataType::U32),
        ],
        [1, 1, 1],
        vec![
            Node::store("out", Expr::u32(0), Expr::load("input", Expr::u32(99))),
            Node::store("out", Expr::u32(99), Expr::u32(123)),
            Node::store(
                "out",
                Expr::u32(1),
                Expr::Atomic {
                    op: AtomicOp::Add,
                    buffer: "out".to_string(),
                    index: Box::new(Expr::u32(99)),
                    expected: None,
                    value: Box::new(Expr::u32(1)),
                },
            ),
        ],
    );

    let outputs = interp::run(
        &program,
        &[Value::Bytes(bytes(&[7])), Value::Bytes(bytes(&[55, 66]))],
    )
    .expect("OOB operations are defined");

    assert_eq!(words(output_bytes(&outputs[0])), vec![0, 0]);
}

/// Verifies round-robin atomic ordering, closing corruption from non-deterministic atomic sequencing.
#[test]
fn atomics_are_sequentially_consistent_in_round_robin_order() {
    let gid = Expr::gid_x();
    let program = Program::new(
        vec![
            BufferDecl::read_write("counter", 0, DataType::U32),
            BufferDecl::read_write("out", 1, DataType::U32),
        ],
        [4, 1, 1],
        vec![Node::store(
            "out",
            gid,
            Expr::atomic_add("counter", Expr::u32(0), Expr::u32(1)),
        )],
    );

    let outputs = interp::run(
        &program,
        &[Value::Bytes(bytes(&[0])), Value::Bytes(bytes(&[0; 4]))],
    )
    .expect("atomic add should execute");

    assert_eq!(words(output_bytes(&outputs[0])), vec![4]);
    assert_eq!(words(output_bytes(&outputs[1])), vec![0, 1, 2, 3]);
}

/// Verifies barriers synchronize workgroup memory, closing corruption from reading stale peer writes.
#[test]
fn barrier_synchronizes_workgroup_memory_per_workgroup() {
    let local = Expr::LocalId { axis: 0 };
    let gid = Expr::gid_x();
    let peer = Expr::BinOp {
        op: BinOp::BitXor,
        left: Box::new(local.clone()),
        right: Box::new(Expr::u32(1)),
    };
    let program = Program::new(
        vec![
            BufferDecl::read_write("out", 0, DataType::U32),
            BufferDecl::workgroup("scratch", 2, DataType::U32),
        ],
        [2, 1, 1],
        vec![
            Node::store("scratch", local, gid.clone()),
            Node::Barrier,
            Node::store("out", gid, Expr::load("scratch", peer)),
        ],
    );

    let outputs = interp::run(&program, &[Value::Bytes(bytes(&[0; 4]))])
        .expect("barrier should synchronize local workgroup memory");

    assert_eq!(words(output_bytes(&outputs[0])), vec![1, 0, 3, 2]);
}

/// Verifies divergent barrier conditions are rejected, closing corruption from non-uniform control flow.
#[test]
fn detects_non_uniform_barrier_condition() {
    let program = Program::new(
        vec![BufferDecl::read_write("out", 0, DataType::U32)],
        [2, 1, 1],
        vec![Node::if_then(
            Expr::eq(Expr::LocalId { axis: 0 }, Expr::u32(0)),
            vec![
                Node::Barrier,
                Node::store("out", Expr::u32(0), Expr::u32(1)),
            ],
        )],
    );

    let error = interp::run(&program, &[Value::Bytes(bytes(&[0; 2]))])
        .expect_err("divergent barrier must fail");

    let message = error.to_string();
    assert!(message.contains("program violates uniform-control-flow rule"));
    assert!(message.contains("Fix:"));
}

/// Verifies completed invocations are excluded from barrier uniformity checks, closing Kimi finding #1 stale finished-invocation corruption.
#[test]
fn completed_invocations_do_not_poison_later_barrier_uniformity() {
    let program = Program::new(
        vec![BufferDecl::read_write("out", 0, DataType::U32)],
        [2, 1, 1],
        vec![Node::if_then(
            Expr::eq(Expr::LocalId { axis: 0 }, Expr::u32(1)),
            vec![
                Node::Barrier,
                Node::store("out", Expr::LocalId { axis: 0 }, Expr::u32(9)),
            ],
        )],
    );

    let outputs = interp::run(&program, &[Value::Bytes(bytes(&[0, 0]))])
        .expect("finished invocation checks must not poison the live barrier");

    assert_eq!(words(output_bytes(&outputs[0])), vec![0, 9]);
}

/// Verifies loop barrier checks clear at barrier boundaries, closing Kimi finding #2 stale prior-iteration uniformity corruption.
#[test]
fn loop_iteration_uniform_checks_are_cleared_at_barriers() {
    let program = Program::new(
        vec![BufferDecl::read_write("out", 0, DataType::U32)],
        [1, 1, 1],
        vec![
            Node::loop_for(
                "i",
                Expr::u32(0),
                Expr::u32(2),
                vec![Node::if_then_else(
                    Expr::eq(Expr::var("i"), Expr::u32(0)),
                    vec![Node::Barrier],
                    vec![Node::Barrier],
                )],
            ),
            Node::store("out", Expr::u32(0), Expr::u32(7)),
        ],
    );

    let outputs = interp::run(&program, &[Value::Bytes(bytes(&[0]))])
        .expect("uniform loop barriers must not retain prior iteration checks");

    assert_eq!(words(output_bytes(&outputs[0])), vec![7]);
}

/// Verifies U64 casts preserve all eight bytes, closing Kimi finding #3 upper-word truncation corruption.
#[test]
fn cast_to_u64_preserves_upper_word() {
    let input = 0x1234_5678_9ABC_DEF0u64.to_le_bytes().to_vec();
    let program = Program::new(
        vec![
            BufferDecl::read("input", 0, DataType::U64),
            BufferDecl::read_write("out", 1, DataType::U64),
        ],
        [1, 1, 1],
        vec![Node::store(
            "out",
            Expr::u32(0),
            Expr::Cast {
                target: DataType::U64,
                value: Box::new(Expr::load("input", Expr::u32(0))),
            },
        )],
    );

    let outputs = interp::run(
        &program,
        &[Value::Bytes(input.clone()), Value::Bytes(vec![0; 8])],
    )
    .expect("u64 cast should preserve the full payload");

    assert_eq!(output_bytes(&outputs[0]), input.as_slice());
}

/// Verifies Vec2U32 casts preserve both lanes, closing Kimi finding #4 trailing-lane truncation corruption.
#[test]
fn cast_to_vec2_preserves_all_lanes() {
    let input = bytes(&[0x1111_2222, 0x3333_4444]);
    let program = Program::new(
        vec![
            BufferDecl::read("input", 0, DataType::Vec2U32),
            BufferDecl::read_write("out", 1, DataType::Vec2U32),
        ],
        [1, 1, 1],
        vec![Node::store(
            "out",
            Expr::u32(0),
            Expr::Cast {
                target: DataType::Vec2U32,
                value: Box::new(Expr::load("input", Expr::u32(0))),
            },
        )],
    );

    let outputs = interp::run(
        &program,
        &[Value::Bytes(input.clone()), Value::Bytes(vec![0; 8])],
    )
    .expect("vec2 cast should preserve both lanes");

    assert_eq!(output_bytes(&outputs[0]), input.as_slice());
}

/// Verifies Vec4U32 casts preserve all four lanes, closing Kimi finding #5 multi-lane truncation corruption.
#[test]
fn cast_to_vec4_preserves_all_lanes() {
    let input = bytes(&[1, 2, 3, 4]);
    let program = Program::new(
        vec![
            BufferDecl::read("input", 0, DataType::Vec4U32),
            BufferDecl::read_write("out", 1, DataType::Vec4U32),
        ],
        [1, 1, 1],
        vec![Node::store(
            "out",
            Expr::u32(0),
            Expr::Cast {
                target: DataType::Vec4U32,
                value: Box::new(Expr::load("input", Expr::u32(0))),
            },
        )],
    );

    let outputs = interp::run(
        &program,
        &[Value::Bytes(input.clone()), Value::Bytes(vec![0; 16])],
    )
    .expect("vec4 cast should preserve all lanes");

    assert_eq!(output_bytes(&outputs[0]), input.as_slice());
}

/// Verifies Call arguments preserve full byte payloads, closing Kimi finding #6 cpu_fn input truncation corruption.
#[test]
fn eval_call_passes_full_bytes_to_cpu_reference() {
    let program = Program::new(
        vec![
            BufferDecl::read("input", 0, DataType::Bytes),
            BufferDecl::read_write("out", 1, DataType::Bytes),
        ],
        [1, 1, 1],
        vec![Node::store(
            "out",
            Expr::u32(0),
            Expr::Call {
                op_id: "primitive.encoding.hex".to_string(),
                args: vec![Expr::load("input", Expr::u32(0))],
            },
        )],
    );

    let outputs = interp::run(
        &program,
        &[
            Value::Bytes(b"414243".to_vec()),
            Value::Bytes(vec![0xAA; 3]),
        ],
    )
    .expect("primitive.encoding.hex call should receive the full byte buffer");

    assert_eq!(output_bytes(&outputs[0]), b"ABC");
}

/// Verifies atomic indices use declared element stride, closing Kimi finding #7 overlapping wide-element atomic corruption.
#[test]
fn atomic_index_uses_declared_element_stride() {
    let mut input = 0xAAAA_BBBB_CCCC_DDDDu64.to_le_bytes().to_vec();
    input.extend_from_slice(&5u64.to_le_bytes());
    let mut expected = 0xAAAA_BBBB_CCCC_DDDDu64.to_le_bytes().to_vec();
    expected.extend_from_slice(&6u64.to_le_bytes());
    let program = Program::new(
        vec![BufferDecl::read_write("wide", 0, DataType::U64)],
        [1, 1, 1],
        vec![Node::let_bind(
            "old",
            Expr::Atomic {
                op: AtomicOp::Add,
                buffer: "wide".to_string(),
                index: Box::new(Expr::u32(1)),
                expected: None,
                value: Box::new(Expr::u32(1)),
            },
        )],
    );

    let outputs = interp::run(&program, &[Value::Bytes(input)])
        .expect("atomic add on second u64 element should execute");

    assert_eq!(output_bytes(&outputs[0]), expected.as_slice());
}

/// Verifies BufLen counts trailing partial elements, closing Kimi finding #8 length under-count corruption.
#[test]
fn buflen_counts_trailing_partial_element() {
    let program = Program::new(
        vec![
            BufferDecl::read("input", 0, DataType::U32),
            BufferDecl::read_write("out", 1, DataType::U32),
        ],
        [1, 1, 1],
        vec![
            Node::store("out", Expr::u32(0), Expr::buf_len("input")),
            Node::store("out", Expr::u32(1), Expr::load("input", Expr::u32(1))),
        ],
    );

    let outputs = interp::run(
        &program,
        &[
            Value::Bytes(vec![1, 2, 3, 4, 5]),
            Value::Bytes(bytes(&[0, 0])),
        ],
    )
    .expect("partial trailing element should count toward BufLen");

    assert_eq!(words(output_bytes(&outputs[0])), vec![2, 0]);
}