verit 0.2.0

Exavian Veritate — zero-copy, self-describing, schema-evolvable binary serialization, safe on untrusted bytes, no unsafe, byte-identical across independent implementations.
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
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
//! Benchmarks: Veritate vs protobuf (prost), Cap'n Proto (capnp), FlatBuffers,
//! and serde_json — a headline record plus a small/medium/large shape sweep.
//! Run with:
//!
//!   cargo run --release --example bench
//!
//! Methodology (see the benchmarks doc for machine/variance): every op is measured
//! with a calibrated inner loop (>=200ms), best of 4 runs, checksummed through
//! black_box to defeat dead-code elim. One policy for everyone: fresh output
//! allocation per encode iteration, and decode/access always starts from raw
//! bytes. FlatBuffers is measured both with its safety verifier (`root`) and
//! without (`root_unchecked`, unsafe); Cap'n Proto uses its default
//! bounds-checked reader. Veritate needs no upfront verify because every
//! access is bounds-checked.

#[allow(
    dead_code,
    unused_imports,
    clippy::all,
    mismatched_lifetime_syntaxes,
    unsafe_op_in_unsafe_fn
)]
#[path = "logevent_generated.rs"]
mod logevent_generated;

// Cap'n Proto generated code (from logevent.capnp). Committed to the repo so
// the bench builds without the capnp schema compiler — same policy as the
// FlatBuffers output above. Regenerate: capnp compile -orust examples/bench/logevent.capnp
#[allow(dead_code, unused, clippy::all)]
#[path = "logevent_capnp.rs"]
mod logevent_capnp;

/// Veritate's own generated code (see examples/gen.rs to regenerate). Skipped
/// by rustfmt so it stays byte-for-byte equal to `codegen::generate_rust`.
#[rustfmt::skip]
#[path = "verit_gen.rs"]
mod verit_gen;

use std::hint::black_box;
use std::time::{Duration, Instant};

use capnp::message::ReaderOptions;
use capnp::serialize;
use logevent_capnp::log_event as cp;
use logevent_generated::bench as fb;
use prost::Message as ProstMessage;
use serde::{Deserialize, Serialize};
use verit::{encode, Budget, Message, Ref, Resolver, Schema, SchemaMode, Value};
use verit_gen as vg;

// ---------------------------------------------------------------------------
// The workload: one mid-size record.
// ---------------------------------------------------------------------------

const SERVICE: &str = "checkout-service";
const MESSAGE: &str = "payment gateway timed out after 3 retries";
const LEVEL: u32 = 2;
const LATENCY: u32 = 2_500_000;
const N_POINTS: usize = 10;
const N_CODES: usize = 16;

/// A message shape: how many point structs and how many u32 codes the record
/// carries. Encoders below are parameterized over a `Shape` so the same code
/// paths are measured on small, medium (the headline record), and large
/// payloads — the "fastest X" ordering shifts with shape (see the benchmarks doc).
#[derive(Clone, Copy)]
struct Shape {
    name: &'static str,
    n_points: usize,
    n_codes: usize,
}

const SHAPES: [Shape; 3] = [
    Shape {
        name: "small (1 pt, 2 codes)",
        n_points: 1,
        n_codes: 2,
    },
    Shape {
        name: "medium (10 pt, 16 codes)",
        n_points: N_POINTS,
        n_codes: N_CODES,
    },
    Shape {
        name: "large (200 pt, 500 codes)",
        n_points: 200,
        n_codes: 500,
    },
];

fn point_x(i: usize) -> f64 {
    i as f64 * 1.5
}
fn point_y(i: usize) -> f64 {
    i as f64 * -0.5
}
fn code(i: usize) -> u32 {
    (i as u32) * 7 + 1
}

// ---------------------------------------------------------------------------
// Contender type definitions
// ---------------------------------------------------------------------------

#[derive(Serialize, Deserialize)]
struct JPoint {
    x: f64,
    y: f64,
}

#[derive(Serialize, Deserialize)]
struct JEvent {
    service: String,
    level: u32,
    message: String,
    latency_us: u32,
    points: Vec<JPoint>,
    codes: Vec<u32>,
}

#[derive(Clone, PartialEq, prost::Message)]
struct PbPoint {
    #[prost(double, tag = "1")]
    x: f64,
    #[prost(double, tag = "2")]
    y: f64,
}

#[derive(Clone, PartialEq, prost::Message)]
struct PbEvent {
    #[prost(string, tag = "1")]
    service: String,
    #[prost(uint32, tag = "2")]
    level: u32,
    #[prost(string, tag = "3")]
    message: String,
    #[prost(uint32, tag = "4")]
    latency_us: u32,
    #[prost(message, repeated, tag = "5")]
    points: Vec<PbPoint>,
    #[prost(uint32, repeated, tag = "6")]
    codes: Vec<u32>,
}

/// The Veritate schema is embedded in the generated module (dense Point,
/// sparse LogEvent — the same shape the other formats use).
fn veritate_schema() -> Schema {
    vg::schema()
}

fn vg_points(n: usize) -> Vec<vg::PointArgs> {
    (0..n)
        .map(|i| vg::PointArgs {
            x: point_x(i),
            y: point_y(i),
        })
        .collect()
}

fn vg_scan(root: &vg::LogEventRef) -> u64 {
    let mut acc = 0u64;
    acc = acc.wrapping_add(root.service().unwrap().unwrap().len() as u64);
    acc = acc.wrapping_add(root.level().unwrap().unwrap() as u64);
    acc = acc.wrapping_add(root.message().unwrap().unwrap().len() as u64);
    acc = acc.wrapping_add(root.latency_us().unwrap().unwrap() as u64);
    let points = root.points().unwrap().unwrap();
    let mut fsum = 0.0f64;
    // Fast bulk scan on the identity path (the common case); fall back to the
    // general per-element reader when the writer used a different schema.
    if let Some(blocks) = points.blocks() {
        for p in blocks {
            fsum += p.x() + p.y();
        }
    } else {
        for p in points.iter() {
            let p = p.unwrap();
            fsum += p.x().unwrap().unwrap() + p.y().unwrap().unwrap();
        }
    }
    acc = acc.wrapping_add(fsum as i64 as u64);
    let codes = root.codes().unwrap().unwrap();
    if let Some(values) = codes.values() {
        for c in values {
            acc = acc.wrapping_add(c as u64);
        }
    } else {
        for c in codes.iter() {
            acc = acc.wrapping_add(c.unwrap() as u64);
        }
    }
    acc
}

// ---------------------------------------------------------------------------
// Encoders
// ---------------------------------------------------------------------------

fn veritate_value(np: usize, nc: usize) -> Value {
    Value::Struct(vec![
        (1, Value::str(SERVICE)),
        (2, Value::U32(LEVEL)),
        (3, Value::str(MESSAGE)),
        (4, Value::U32(LATENCY)),
        (
            5,
            Value::List(
                (0..np)
                    .map(|i| {
                        Value::Struct(vec![
                            (1, Value::F64(point_x(i))),
                            (2, Value::F64(point_y(i))),
                        ])
                    })
                    .collect(),
            ),
        ),
        (
            6,
            Value::List((0..nc).map(|i| Value::U32(code(i))).collect()),
        ),
    ])
}

fn json_event(np: usize, nc: usize) -> JEvent {
    JEvent {
        service: SERVICE.into(),
        level: LEVEL,
        message: MESSAGE.into(),
        latency_us: LATENCY,
        points: (0..np)
            .map(|i| JPoint {
                x: point_x(i),
                y: point_y(i),
            })
            .collect(),
        codes: (0..nc).map(code).collect(),
    }
}

fn pb_event(np: usize, nc: usize) -> PbEvent {
    PbEvent {
        service: SERVICE.into(),
        level: LEVEL,
        message: MESSAGE.into(),
        latency_us: LATENCY,
        points: (0..np)
            .map(|i| PbPoint {
                x: point_x(i),
                y: point_y(i),
            })
            .collect(),
        codes: (0..nc).map(code).collect(),
    }
}

fn fb_encode(np: usize, nc: usize) -> Vec<u8> {
    let mut b = flatbuffers::FlatBufferBuilder::new();
    let service = b.create_string(SERVICE);
    let message = b.create_string(MESSAGE);
    let points: Vec<_> = (0..np)
        .map(|i| {
            fb::Point::create(
                &mut b,
                &fb::PointArgs {
                    x: point_x(i),
                    y: point_y(i),
                },
            )
        })
        .collect();
    let points = b.create_vector(&points);
    let codes: Vec<u32> = (0..nc).map(code).collect();
    let codes = b.create_vector(&codes);
    let ev = fb::LogEvent::create(
        &mut b,
        &fb::LogEventArgs {
            service: Some(service),
            level: LEVEL,
            message: Some(message),
            latency_us: LATENCY,
            points: Some(points),
            codes: Some(codes),
        },
    );
    b.finish(ev, None);
    b.finished_data().to_vec()
}

fn capnp_encode(np: usize, nc: usize) -> Vec<u8> {
    let mut message = capnp::message::Builder::new_default();
    {
        let mut ev = message.init_root::<cp::Builder>();
        ev.set_service(SERVICE);
        ev.set_level(LEVEL);
        ev.set_message(MESSAGE);
        ev.set_latency_us(LATENCY);
        {
            let mut points = ev.reborrow().init_points(np as u32);
            for i in 0..np {
                let mut p = points.reborrow().get(i as u32);
                p.set_x(point_x(i));
                p.set_y(point_y(i));
            }
        }
        {
            let mut codes = ev.reborrow().init_codes(nc as u32);
            for i in 0..nc {
                codes.set(i as u32, code(i));
            }
        }
    }
    let mut buf = Vec::new();
    serialize::write_message(&mut buf, &message).unwrap();
    buf
}

fn capnp_scan(ev: cp::Reader) -> u64 {
    let mut acc = 0u64;
    acc = acc.wrapping_add(ev.get_service().unwrap().len() as u64);
    acc = acc.wrapping_add(ev.get_level() as u64);
    acc = acc.wrapping_add(ev.get_message().unwrap().len() as u64);
    acc = acc.wrapping_add(ev.get_latency_us() as u64);
    let mut fsum = 0.0f64;
    let points = ev.get_points().unwrap();
    for p in points.iter() {
        fsum += p.get_x() + p.get_y();
    }
    acc = acc.wrapping_add(fsum as i64 as u64);
    let codes = ev.get_codes().unwrap();
    for c in codes.iter() {
        acc = acc.wrapping_add(c as u64);
    }
    acc
}

// ---------------------------------------------------------------------------
// Scans (read every field, fold into a checksum)
// ---------------------------------------------------------------------------

fn veritate_scan(root: &verit::StructReader) -> u64 {
    let mut acc = 0u64;
    acc = acc.wrapping_add(root.get_str(1).unwrap().unwrap().len() as u64);
    acc = acc.wrapping_add(root.get_u32(2).unwrap().unwrap() as u64);
    acc = acc.wrapping_add(root.get_str(3).unwrap().unwrap().len() as u64);
    acc = acc.wrapping_add(root.get_u32(4).unwrap().unwrap() as u64);
    let points = root.get_list(5).unwrap().unwrap();
    let mut fsum = 0.0f64;
    for i in 0..points.len() {
        if let Ref::Struct(p) = points.get(i).unwrap() {
            fsum += p.get_f64(1).unwrap().unwrap() + p.get_f64(2).unwrap().unwrap();
        }
    }
    acc = acc.wrapping_add(fsum as i64 as u64);
    let codes = root.get_list(6).unwrap().unwrap();
    for i in 0..codes.len() {
        if let Ref::U32(c) = codes.get(i).unwrap() {
            acc = acc.wrapping_add(c as u64);
        }
    }
    acc
}

fn fb_scan(ev: &fb::LogEvent) -> u64 {
    let mut acc = 0u64;
    acc = acc.wrapping_add(ev.service().map(|s| s.len()).unwrap_or(0) as u64);
    acc = acc.wrapping_add(ev.level() as u64);
    acc = acc.wrapping_add(ev.message().map(|s| s.len()).unwrap_or(0) as u64);
    acc = acc.wrapping_add(ev.latency_us() as u64);
    let mut fsum = 0.0f64;
    if let Some(points) = ev.points() {
        for p in points.iter() {
            fsum += p.x() + p.y();
        }
    }
    acc = acc.wrapping_add(fsum as i64 as u64);
    if let Some(codes) = ev.codes() {
        for c in codes.iter() {
            acc = acc.wrapping_add(c as u64);
        }
    }
    acc
}

fn typed_scan(
    service: &str,
    level: u32,
    message: &str,
    latency: u32,
    points_sum: f64,
    codes_sum: u64,
) -> u64 {
    (service.len() as u64)
        .wrapping_add(level as u64)
        .wrapping_add(message.len() as u64)
        .wrapping_add(latency as u64)
        .wrapping_add(points_sum as i64 as u64)
        .wrapping_add(codes_sum)
}

// ---------------------------------------------------------------------------
// Harness
// ---------------------------------------------------------------------------

fn bench(name: &str, mut f: impl FnMut() -> u64) -> f64 {
    let mut n: u64 = 1;
    let mut elapsed;
    loop {
        let t = Instant::now();
        let mut acc = 0u64;
        for _ in 0..n {
            acc = acc.wrapping_add(f());
        }
        black_box(acc);
        elapsed = t.elapsed();
        if elapsed >= Duration::from_millis(200) || n >= 1 << 30 {
            break;
        }
        n *= 2;
    }
    let mut best = elapsed.as_nanos() as f64 / n as f64;
    for _ in 0..3 {
        let t = Instant::now();
        let mut acc = 0u64;
        for _ in 0..n {
            acc = acc.wrapping_add(f());
        }
        black_box(acc);
        best = best.min(t.elapsed().as_nanos() as f64 / n as f64);
    }
    println!("  {name:<42} {best:>12.1} ns/op");
    best
}

fn main() {
    let schema = veritate_schema();
    let resolver = Resolver::identity(&schema).unwrap();

    let v_bytes = encode(
        &schema,
        &veritate_value(N_POINTS, N_CODES),
        SchemaMode::HashOnly,
    )
    .unwrap();
    let v_inline = encode(
        &schema,
        &veritate_value(N_POINTS, N_CODES),
        SchemaMode::Inline,
    )
    .unwrap();
    let j_bytes = serde_json::to_vec(&json_event(N_POINTS, N_CODES)).unwrap();
    let p_bytes = pb_event(N_POINTS, N_CODES).encode_to_vec();
    let f_bytes = fb_encode(N_POINTS, N_CODES);
    let c_bytes = capnp_encode(N_POINTS, N_CODES);

    println!("workload: 2 strings, 2 u32, {N_POINTS} point structs, {N_CODES} u32 codes\n");
    println!("--- wire size (bytes) ---");
    println!("  veritate (hash-only)   {:>6}", v_bytes.len());
    println!(
        "  veritate (inline schema, self-contained) {:>6}",
        v_inline.len()
    );
    println!("  protobuf (prost)       {:>6}", p_bytes.len());
    println!("  capnp                  {:>6}", c_bytes.len());
    println!("  flatbuffers            {:>6}", f_bytes.len());
    println!("  json                   {:>6}", j_bytes.len());

    println!("\n--- encode (build + serialize, fresh allocations) ---");
    bench("veritate (dynamic Value tree)", || {
        encode(
            &schema,
            &veritate_value(N_POINTS, N_CODES),
            SchemaMode::HashOnly,
        )
        .unwrap()
        .len() as u64
    });
    let cg_points = vg_points(N_POINTS);
    let cg_codes: Vec<u32> = (0..N_CODES).map(code).collect();
    bench("veritate (codegen, direct)", || {
        let args = vg::LogEventArgs {
            service: Some(SERVICE),
            level: Some(LEVEL),
            message: Some(MESSAGE),
            latency_us: Some(LATENCY),
            points: Some(&cg_points),
            codes: Some(&cg_codes),
        };
        vg::encode_log_event(&args, SchemaMode::HashOnly)
            .unwrap()
            .len() as u64
    });
    bench("protobuf (prost)", || {
        pb_event(N_POINTS, N_CODES).encode_to_vec().len() as u64
    });
    bench("capnp", || capnp_encode(N_POINTS, N_CODES).len() as u64);
    bench("flatbuffers", || fb_encode(N_POINTS, N_CODES).len() as u64);
    bench("json (serde)", || {
        serde_json::to_vec(&json_event(N_POINTS, N_CODES))
            .unwrap()
            .len() as u64
    });

    println!("\n--- partial access: bytes -> 2 fields (service.len + latency) ---");
    bench("veritate (dynamic)", || {
        let msg = Message::parse(&v_bytes).unwrap();
        let root = msg.root(&resolver).unwrap();
        root.get_str(1).unwrap().unwrap().len() as u64 + root.get_u32(4).unwrap().unwrap() as u64
    });
    bench("veritate (codegen identity fast path)", || {
        let msg = Message::parse(&v_bytes).unwrap();
        let root = vg::LogEventRef::read(&msg, &resolver).unwrap();
        root.service().unwrap().unwrap().len() as u64 + root.latency_us().unwrap().unwrap() as u64
    });
    bench("veritate (codegen bounded, untrusted)", || {
        let msg = Message::parse(&v_bytes).unwrap();
        let budget = Budget::new(msg.suggested_budget());
        let root = vg::LogEventRef::read_bounded(&msg, &resolver, &budget).unwrap();
        root.service().unwrap().unwrap().len() as u64 + root.latency_us().unwrap().unwrap() as u64
    });
    bench("protobuf (prost, must decode all)", || {
        let ev = PbEvent::decode(&p_bytes[..]).unwrap();
        ev.service.len() as u64 + ev.latency_us as u64
    });
    bench("capnp (safe, bounds-checked)", || {
        let reader =
            serialize::read_message_from_flat_slice(&mut &c_bytes[..], ReaderOptions::new())
                .unwrap();
        let ev = reader.get_root::<cp::Reader>().unwrap();
        ev.get_service().unwrap().len() as u64 + ev.get_latency_us() as u64
    });
    bench("flatbuffers (verified root)", || {
        let ev = flatbuffers::root::<fb::LogEvent>(&f_bytes).unwrap();
        ev.service().map(|s| s.len()).unwrap_or(0) as u64 + ev.latency_us() as u64
    });
    bench("flatbuffers (root_unchecked, unsafe)", || {
        let ev = unsafe { flatbuffers::root_unchecked::<fb::LogEvent>(&f_bytes) };
        ev.service().map(|s| s.len()).unwrap_or(0) as u64 + ev.latency_us() as u64
    });
    bench("json (serde, must decode all)", || {
        let ev: JEvent = serde_json::from_slice(&j_bytes).unwrap();
        ev.service.len() as u64 + ev.latency_us as u64
    });

    println!("\n--- full scan: bytes -> every field ---");
    bench("veritate (dynamic)", || {
        let msg = Message::parse(&v_bytes).unwrap();
        let root = msg.root(&resolver).unwrap();
        veritate_scan(&root)
    });
    bench("veritate (codegen identity fast path)", || {
        let msg = Message::parse(&v_bytes).unwrap();
        let root = vg::LogEventRef::read(&msg, &resolver).unwrap();
        vg_scan(&root)
    });
    // Untrusted-input mode: the budgeted fast path. Same constant-offset
    // getters as the row above, plus one budget decrement per offset-follow —
    // the amplification guard engaged per read. This is the like-for-like
    // comparison to Cap'n Proto's always-bounded reads.
    bench("veritate (codegen bounded, untrusted)", || {
        let msg = Message::parse(&v_bytes).unwrap();
        let budget = Budget::new(msg.suggested_budget());
        let root = vg::LogEventRef::read_bounded(&msg, &resolver, &budget).unwrap();
        vg_scan(&root)
    });
    // Alternative untrusted mode: one budgeted verify pass, then unbounded fast
    // scans — amortizes to the trusted number when a message is read many times.
    bench("veritate (verify once + codegen scan)", || {
        let msg = Message::parse(&v_bytes).unwrap();
        msg.verify(&resolver, &Budget::new(msg.suggested_budget()))
            .unwrap();
        let root = vg::LogEventRef::read(&msg, &resolver).unwrap();
        vg_scan(&root)
    });
    bench("protobuf (prost)", || {
        let ev = PbEvent::decode(&p_bytes[..]).unwrap();
        let fsum: f64 = ev.points.iter().map(|p| p.x + p.y).sum();
        let csum: u64 = ev.codes.iter().map(|&c| c as u64).sum();
        typed_scan(
            &ev.service,
            ev.level,
            &ev.message,
            ev.latency_us,
            fsum,
            csum,
        )
    });
    bench("capnp (safe, bounds-checked)", || {
        let reader =
            serialize::read_message_from_flat_slice(&mut &c_bytes[..], ReaderOptions::new())
                .unwrap();
        capnp_scan(reader.get_root::<cp::Reader>().unwrap())
    });
    bench("flatbuffers (verified root)", || {
        let ev = flatbuffers::root::<fb::LogEvent>(&f_bytes).unwrap();
        fb_scan(&ev)
    });
    bench("flatbuffers (root_unchecked, unsafe)", || {
        let ev = unsafe { flatbuffers::root_unchecked::<fb::LogEvent>(&f_bytes) };
        fb_scan(&ev)
    });
    bench("json (serde)", || {
        let ev: JEvent = serde_json::from_slice(&j_bytes).unwrap();
        let fsum: f64 = ev.points.iter().map(|p| p.x + p.y).sum();
        let csum: u64 = ev.codes.iter().map(|&c| c as u64).sum();
        typed_scan(
            &ev.service,
            ev.level,
            &ev.message,
            ev.latency_us,
            fsum,
            csum,
        )
    });

    // Sanity: all scans agree on the checksum, and the codegen encoder's
    // bytes read back identically through the dynamic reader.
    let msg = Message::parse(&v_bytes).unwrap();
    let root = msg.root(&resolver).unwrap();
    let v = veritate_scan(&root);
    let cg = {
        let args = vg::LogEventArgs {
            service: Some(SERVICE),
            level: Some(LEVEL),
            message: Some(MESSAGE),
            latency_us: Some(LATENCY),
            points: Some(&cg_points),
            codes: Some(&cg_codes),
        };
        let bytes = vg::encode_log_event(&args, SchemaMode::HashOnly).unwrap();
        let m = Message::parse(&bytes).unwrap();
        let r = m.root(&resolver).unwrap();
        veritate_scan(&r)
    };
    assert_eq!(v, cg, "codegen-encoded bytes must scan identically");
    let ev = PbEvent::decode(&p_bytes[..]).unwrap();
    let fsum: f64 = ev.points.iter().map(|p| p.x + p.y).sum();
    let csum: u64 = ev.codes.iter().map(|&c| c as u64).sum();
    let p = typed_scan(
        &ev.service,
        ev.level,
        &ev.message,
        ev.latency_us,
        fsum,
        csum,
    );
    let f = fb_scan(&flatbuffers::root::<fb::LogEvent>(&f_bytes).unwrap());
    let c = {
        let reader =
            serialize::read_message_from_flat_slice(&mut &c_bytes[..], ReaderOptions::new())
                .unwrap();
        capnp_scan(reader.get_root::<cp::Reader>().unwrap())
    };
    let jev: JEvent = serde_json::from_slice(&j_bytes).unwrap();
    let jf: f64 = jev.points.iter().map(|p| p.x + p.y).sum();
    let jc: u64 = jev.codes.iter().map(|&c| c as u64).sum();
    let j = typed_scan(
        &jev.service,
        jev.level,
        &jev.message,
        jev.latency_us,
        jf,
        jc,
    );
    assert!(
        v == p && p == c && c == f && f == j,
        "checksum mismatch: {v} {p} {c} {f} {j}"
    );
    println!("\nchecksums agree across all formats ({v})");

    shapes_sweep(&schema, &resolver);
}

/// Sweep the same code paths over small / medium / large payloads. One record
/// is not a benchmark: the "fastest encode" and "fastest scan" orderings shift
/// with shape (protobuf's varints win on small ints; Cap'n Proto's contiguous
/// lists pull ahead on large sequential scans). Reported: wire size, encode,
/// and full-scan for the safe binary formats.
fn shapes_sweep(schema: &Schema, resolver: &Resolver) {
    println!("\n=== message-shape sweep (safe formats) ===");
    for s in SHAPES {
        let (np, nc) = (s.n_points, s.n_codes);
        let v_bytes = encode(schema, &veritate_value(np, nc), SchemaMode::HashOnly).unwrap();
        let p_bytes = pb_event(np, nc).encode_to_vec();
        let c_bytes = capnp_encode(np, nc);
        let f_bytes = fb_encode(np, nc);
        let j_bytes = serde_json::to_vec(&json_event(np, nc)).unwrap();
        let cg_points = vg_points(np);
        let cg_codes: Vec<u32> = (0..nc).map(code).collect();

        println!("\n--- shape: {} ---", s.name);
        println!(
            "  wire size (B): veritate {}  protobuf {}  capnp {}  flatbuffers {}  json {}",
            v_bytes.len(),
            p_bytes.len(),
            c_bytes.len(),
            f_bytes.len(),
            j_bytes.len()
        );
        println!("  encode (ns/op):");
        bench("    veritate (codegen)", || {
            let args = vg::LogEventArgs {
                service: Some(SERVICE),
                level: Some(LEVEL),
                message: Some(MESSAGE),
                latency_us: Some(LATENCY),
                points: Some(&cg_points),
                codes: Some(&cg_codes),
            };
            vg::encode_log_event(&args, SchemaMode::HashOnly)
                .unwrap()
                .len() as u64
        });
        bench("    protobuf (prost)", || {
            pb_event(np, nc).encode_to_vec().len() as u64
        });
        bench("    capnp", || capnp_encode(np, nc).len() as u64);
        bench("    flatbuffers", || fb_encode(np, nc).len() as u64);
        println!("  full scan (ns/op):");
        bench("    veritate (codegen)", || {
            let msg = Message::parse(&v_bytes).unwrap();
            let root = vg::LogEventRef::read(&msg, resolver).unwrap();
            vg_scan(&root)
        });
        bench("    protobuf (prost)", || {
            let ev = PbEvent::decode(&p_bytes[..]).unwrap();
            let fsum: f64 = ev.points.iter().map(|p| p.x + p.y).sum();
            let csum: u64 = ev.codes.iter().map(|&c| c as u64).sum();
            typed_scan(
                &ev.service,
                ev.level,
                &ev.message,
                ev.latency_us,
                fsum,
                csum,
            )
        });
        bench("    capnp (safe)", || {
            let reader =
                serialize::read_message_from_flat_slice(&mut &c_bytes[..], ReaderOptions::new())
                    .unwrap();
            capnp_scan(reader.get_root::<cp::Reader>().unwrap())
        });
        bench("    flatbuffers (verified)", || {
            let ev = flatbuffers::root::<fb::LogEvent>(&f_bytes).unwrap();
            fb_scan(&ev)
        });
        // Partial access: read exactly 2 of 6 fields (service.len + latency).
        // Veritate/capnp/flatbuffers are O(1) here (indexed access, size-
        // independent); protobuf/json must decode the whole record, so their
        // cost grows with shape — the point of measuring it per shape.
        println!("  partial access, 2 of 6 fields (ns/op):");
        bench("    veritate (codegen)", || {
            let msg = Message::parse(&v_bytes).unwrap();
            let root = vg::LogEventRef::read(&msg, resolver).unwrap();
            root.service().unwrap().unwrap().len() as u64
                + root.latency_us().unwrap().unwrap() as u64
        });
        bench("    protobuf (prost)", || {
            let ev = PbEvent::decode(&p_bytes[..]).unwrap();
            ev.service.len() as u64 + ev.latency_us as u64
        });
        bench("    capnp (safe)", || {
            let reader =
                serialize::read_message_from_flat_slice(&mut &c_bytes[..], ReaderOptions::new())
                    .unwrap();
            let ev = reader.get_root::<cp::Reader>().unwrap();
            ev.get_service().unwrap().len() as u64 + ev.get_latency_us() as u64
        });
        bench("    flatbuffers (verified)", || {
            let ev = flatbuffers::root::<fb::LogEvent>(&f_bytes).unwrap();
            ev.service().map(|s| s.len()).unwrap_or(0) as u64 + ev.latency_us() as u64
        });
    }
}