fgf 2.0.0

Faster Galois Fields: SIMD and portable finite-field arithmetic (binary towers and prime fields) and vector kernels
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
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
//! `QuadMersenne31` (`(re, im)` Mersenne31 limb pairs) AVX2 kernels.
//!
//! Four complex elements per 256-bit vector: eight 32-bit lanes holding
//! `[re0, im0, re1, im1, re2, im2, re3, im3]`, little-endian, so the even
//! 32-bit lanes are the real limbs and the odd lanes the imaginary limbs.
//! The limb arithmetic — fold, canonicalizing min chain, and the
//! doubled-odd-limb multiply — is the Mersenne31 discipline shared with
//! [`crate::kernel::x86::mersenne31`]; this module adds the complex layer on top of it.
//!
//! A complex product costs two limb multiplies when one factor is a
//! loop-invariant coefficient: the coefficient is prepared once as `cr`
//! broadcast to all lanes plus a sign-mixed `ci` vector (`p - ci` on the
//! real lanes, `ci` on the imaginary lanes), and the two multiplies take
//! the operand itself and its per-pair real/imaginary swap (`pshufd`
//! `0xB1`), so `cr * x + ci_mixed * swap(x)` yields
//! `(cr*re - ci*im, cr*im + ci*re)` per pair in one multiply-add. The
//! elementwise product, where both factors vary, uses the direct four-limb
//! form `(ar*br - ai*bi, ar*bi + ai*br)` recombined with one odd-lane
//! blend. The tests validate every lane construction against an
//! independent `u128 % p` limb model.
//!
//! Buffers meet the packed canonical-lane contract: every input limb is
//! below the modulus and every stored limb is canonical, the same contract
//! as [`crate::ops`]. Coefficients are total — any raw `Elem` limbs
//! canonicalize once per call.
//!
//! These entries sit outside process dispatch, which serves
//! `QuadMersenne31` from the portable path. Reaching them directly is an
//! `internals` surface, like the other direct x86 kernels: each is a safe
//! capability-token function taking an `X64V3Token`, validating its own
//! geometry, and handing whole-element tails to the portable
//! [`crate::kernel::prime`] path. The zero and one coefficient shortcuts
//! mirror the scalar control exactly, byte for byte.

use crate::field::quad_mersenne31::{Elem, QuadMersenne31};
use crate::field::{Field, mersenne31};
use crate::kernel::proven_checks::{check_elem_multiple, check_equal};
use crate::kernel::x86::mersenne31::{P, fold_avx2, min_chain_avx2, mulmod_avx2};
use crate::kernel::{prime, scalar};

#[cfg(target_arch = "x86")]
use core::arch::x86::*;
#[cfg(target_arch = "x86_64")]
use core::arch::x86_64::*;

/// Duplicate each element's real limb into both lanes of its pair
/// (`moveldup` operates per 128-bit half, and no element straddles one).
#[archmage::rite(v3)]
#[must_use]
fn dup_re(x: __m256i) -> __m256i {
    _mm256_castps_si256(_mm256_moveldup_ps(_mm256_castsi256_ps(x)))
}

/// Duplicate each element's imaginary limb into both lanes of its pair.
#[archmage::rite(v3)]
#[must_use]
fn dup_im(x: __m256i) -> __m256i {
    _mm256_castps_si256(_mm256_movehdup_ps(_mm256_castsi256_ps(x)))
}

/// Swap each pair's real and imaginary limbs (`pshufd` with the dword
/// selectors `1, 0, 3, 2`).
#[archmage::rite(v3)]
#[must_use]
fn swap_re_im(x: __m256i) -> __m256i {
    _mm256_shuffle_epi32::<0b1011_0001>(x)
}

/// `a + b (mod p)` over eight folded lanes (`0..=p` in, canonical out).
#[archmage::rite(v3)]
#[must_use]
fn addmod(a: __m256i, b: __m256i, p: __m256i) -> __m256i {
    min_chain_avx2(_mm256_add_epi32(a, b), p) // sum <= 2p
}

/// `a - b (mod p)` over eight folded lanes (`0..=p` in, canonical out).
#[archmage::rite(v3)]
#[must_use]
fn submod(a: __m256i, b: __m256i, p: __m256i) -> __m256i {
    let diff = _mm256_sub_epi32(a, b); // wraps iff negative
    let fixed = _mm256_min_epu32(diff, _mm256_add_epi32(diff, p));
    min_chain_avx2(fixed, p)
}

/// Multiply four folded complex elements by a prepared coefficient:
/// `cr` broadcast to all lanes, `ci_mixed` holding `p - ci` on the real
/// lanes and `ci` on the imaginary lanes. The real lane computes
/// `cr*re + (p-ci)*im = cr*re - ci*im`; the imaginary lane computes
/// `cr*im + ci*re` off the swapped pair.
#[archmage::rite(v3)]
#[must_use]
fn cmul(x: __m256i, cr: __m256i, ci_mixed: __m256i, p: __m256i) -> __m256i {
    addmod(
        mulmod_avx2(cr, x, p),
        mulmod_avx2(ci_mixed, swap_re_im(x), p),
        p,
    )
}

/// Complex multiply of two folded vectors, `(ar*br - ai*bi, ar*bi + ai*br)`
/// per element, recombined with one odd-lane blend.
#[archmage::rite(v3)]
#[must_use]
fn cmul_vec(a: __m256i, b: __m256i, p: __m256i) -> __m256i {
    let ar = dup_re(a);
    let ai = dup_im(a);
    let br = dup_re(b);
    let bi = dup_im(b);
    let re = submod(mulmod_avx2(ar, br, p), mulmod_avx2(ai, bi, p), p);
    let im = addmod(mulmod_avx2(ar, bi, p), mulmod_avx2(ai, br, p), p);
    _mm256_blend_epi32::<0b1010_1010>(re, im)
}

/// The coefficient vectors every coefficient multiply entry builds: `cr`
/// broadcast, and `ci` mixed-sign. Both limbs enter canonical.
#[archmage::rite(v3)]
#[allow(clippy::cast_possible_wrap)]
fn coeff_vectors(cr: u32, ci: u32) -> (__m256i, __m256i) {
    let neg_ci = if ci == 0 { 0 } else { mersenne31::MODULUS - ci };
    let cr_v = _mm256_set1_epi32(cr as i32);
    // Even (real) lanes negate ci by p - ci; odd (imaginary) lanes keep ci.
    let ci_mixed = _mm256_blend_epi32::<0b1010_1010>(
        _mm256_set1_epi32(neg_ci as i32),
        _mm256_set1_epi32(ci as i32),
    );
    (cr_v, ci_mixed)
}

/// `dst += src` in GF((2^31 - 1)^2), AVX2.
///
/// Both buffers hold canonical lanes — every 32-bit limb below the
/// modulus — and every stored lane is canonical.
///
/// # Panics
/// Panics if the slices differ in length or hold a partial element.
#[allow(clippy::used_underscore_binding)]
#[archmage::arcane(import_intrinsics)]
pub fn add_assign_avx2(_token: archmage::X64V3Token, dst: &mut [u8], src: &[u8]) {
    check_equal(
        "quad_mersenne31::add_assign_avx2",
        "dst",
        dst.len(),
        "src",
        src.len(),
    );
    check_elem_multiple("quad_mersenne31::add_assign_avx2", dst.len(), 8);
    let p = _mm256_set1_epi32(P);
    let (dst_lanes, dst_tail) = dst.as_chunks_mut::<32>();
    let (src_lanes, src_tail) = src.as_chunks::<32>();
    for (dst_lane, src_lane) in dst_lanes.iter_mut().zip(src_lanes) {
        let d = fold_avx2(_mm256_loadu_si256(&*dst_lane), p);
        let s = fold_avx2(_mm256_loadu_si256(src_lane), p);
        _mm256_storeu_si256(dst_lane, addmod(d, s, p));
    }
    prime::add_assign::<QuadMersenne31>(dst_tail, src_tail);
}

/// `dst -= src` in GF((2^31 - 1)^2), AVX2.
///
/// Both buffers hold canonical lanes — every 32-bit limb below the
/// modulus — and every stored lane is canonical.
///
/// # Panics
/// Panics if the slices differ in length or hold a partial element.
#[allow(clippy::used_underscore_binding)]
#[archmage::arcane(import_intrinsics)]
pub fn sub_assign_avx2(_token: archmage::X64V3Token, dst: &mut [u8], src: &[u8]) {
    check_equal(
        "quad_mersenne31::sub_assign_avx2",
        "dst",
        dst.len(),
        "src",
        src.len(),
    );
    check_elem_multiple("quad_mersenne31::sub_assign_avx2", dst.len(), 8);
    let p = _mm256_set1_epi32(P);
    let (dst_lanes, dst_tail) = dst.as_chunks_mut::<32>();
    let (src_lanes, src_tail) = src.as_chunks::<32>();
    for (dst_lane, src_lane) in dst_lanes.iter_mut().zip(src_lanes) {
        let d = fold_avx2(_mm256_loadu_si256(&*dst_lane), p);
        let s = fold_avx2(_mm256_loadu_si256(src_lane), p);
        _mm256_storeu_si256(dst_lane, submod(d, s, p));
    }
    prime::sub_assign::<QuadMersenne31>(dst_tail, src_tail);
}

/// `dst += coeff * src` in GF((2^31 - 1)^2), AVX2.
///
/// Both buffers hold canonical lanes; the coefficient may hold any raw
/// limbs, canonicalized once before the loop. A zero coefficient leaves
/// `dst` untouched and the coefficient `1 + 0i` adds `src` elementwise,
/// mirroring the scalar control.
///
/// # Panics
/// Panics if the slices differ in length or hold a partial element.
#[allow(clippy::cast_possible_wrap, clippy::used_underscore_binding)]
#[archmage::arcane(import_intrinsics)]
pub fn mul_add_avx2(_token: archmage::X64V3Token, dst: &mut [u8], coeff: Elem, src: &[u8]) {
    check_equal(
        "quad_mersenne31::mul_add_avx2",
        "dst",
        dst.len(),
        "src",
        src.len(),
    );
    check_elem_multiple("quad_mersenne31::mul_add_avx2", dst.len(), 8);
    let (cr, ci) = coeff.canonical().to_raw();
    if cr == 0 && ci == 0 {
        return;
    }
    if cr == 1 && ci == 0 {
        add_assign_avx2(_token, dst, src);
        return;
    }
    let p = _mm256_set1_epi32(P);
    let (cr_v, ci_mixed) = coeff_vectors(cr, ci);
    let (dst_lanes, dst_tail) = dst.as_chunks_mut::<32>();
    let (src_lanes, src_tail) = src.as_chunks::<32>();
    for (dst_lane, src_lane) in dst_lanes.iter_mut().zip(src_lanes) {
        let prod = cmul(
            fold_avx2(_mm256_loadu_si256(src_lane), p),
            cr_v,
            ci_mixed,
            p,
        );
        let d = fold_avx2(_mm256_loadu_si256(&*dst_lane), p);
        _mm256_storeu_si256(dst_lane, addmod(d, prod, p));
    }
    prime::mul_add::<QuadMersenne31>(dst_tail, coeff, src_tail);
}

/// `dst *= coeff` in GF((2^31 - 1)^2), AVX2.
///
/// The buffer holds canonical lanes; the coefficient may hold any raw
/// limbs, canonicalized once before the loop. A zero coefficient zeroes
/// `dst` and the coefficient `1 + 0i` leaves it untouched, mirroring the
/// scalar control.
///
/// # Panics
/// Panics on a partial trailing element.
#[allow(clippy::cast_possible_wrap, clippy::used_underscore_binding)]
#[archmage::arcane(import_intrinsics)]
pub fn mul_assign_avx2(_token: archmage::X64V3Token, dst: &mut [u8], coeff: Elem) {
    check_elem_multiple("quad_mersenne31::mul_assign_avx2", dst.len(), 8);
    let (cr, ci) = coeff.canonical().to_raw();
    if cr == 0 && ci == 0 {
        dst.fill(0);
        return;
    }
    if cr == 1 && ci == 0 {
        return;
    }
    let p = _mm256_set1_epi32(P);
    let (cr_v, ci_mixed) = coeff_vectors(cr, ci);
    let (dst_lanes, dst_tail) = dst.as_chunks_mut::<32>();
    for dst_lane in dst_lanes {
        let d = fold_avx2(_mm256_loadu_si256(&*dst_lane), p);
        _mm256_storeu_si256(dst_lane, cmul(d, cr_v, ci_mixed, p));
    }
    prime::mul_assign::<QuadMersenne31>(dst_tail, coeff);
}

/// `dst = coeff * src` in GF((2^31 - 1)^2), AVX2. The destination is
/// write-only: its prior contents are ignored, never read.
///
/// Both buffers hold canonical lanes; the coefficient may hold any raw
/// limbs, canonicalized once before the loop. A zero coefficient zeroes
/// `dst`, mirroring the scalar control.
///
/// # Panics
/// Panics if the slices differ in length or hold a partial element.
#[allow(clippy::cast_possible_wrap, clippy::used_underscore_binding)]
#[archmage::arcane(import_intrinsics)]
pub fn mul_into_avx2(_token: archmage::X64V3Token, dst: &mut [u8], coeff: Elem, src: &[u8]) {
    check_equal(
        "quad_mersenne31::mul_into_avx2",
        "dst",
        dst.len(),
        "src",
        src.len(),
    );
    check_elem_multiple("quad_mersenne31::mul_into_avx2", dst.len(), 8);
    let (cr, ci) = coeff.canonical().to_raw();
    if cr == 0 && ci == 0 {
        dst.fill(0);
        return;
    }
    let p = _mm256_set1_epi32(P);
    let (cr_v, ci_mixed) = coeff_vectors(cr, ci);
    let (dst_lanes, dst_tail) = dst.as_chunks_mut::<32>();
    let (src_lanes, src_tail) = src.as_chunks::<32>();
    for (dst_lane, src_lane) in dst_lanes.iter_mut().zip(src_lanes) {
        let s = fold_avx2(_mm256_loadu_si256(src_lane), p);
        _mm256_storeu_si256(dst_lane, cmul(s, cr_v, ci_mixed, p));
    }
    // Whole-element scalar tail.
    for (d, s) in dst_tail.chunks_exact_mut(8).zip(src_tail.chunks_exact(8)) {
        let v = coeff * QuadMersenne31::decode(s);
        d.copy_from_slice(&v.to_bytes());
    }
}

/// `dst[i] = a[i] * b[i]` in GF((2^31 - 1)^2), AVX2.
///
/// All three buffers hold canonical lanes — every 32-bit limb below the
/// modulus — and every stored lane is canonical.
///
/// # Panics
/// Panics unless all three buffers match in length (whole elements).
#[allow(clippy::used_underscore_binding)]
#[archmage::arcane(import_intrinsics)]
pub fn mul_elementwise_avx2(_token: archmage::X64V3Token, dst: &mut [u8], a: &[u8], b: &[u8]) {
    check_equal(
        "quad_mersenne31::mul_elementwise_avx2",
        "dst",
        dst.len(),
        "a",
        a.len(),
    );
    check_equal(
        "quad_mersenne31::mul_elementwise_avx2",
        "dst",
        dst.len(),
        "b",
        b.len(),
    );
    check_elem_multiple("quad_mersenne31::mul_elementwise_avx2", dst.len(), 8);
    let p = _mm256_set1_epi32(P);
    let (dst_lanes, dst_tail) = dst.as_chunks_mut::<32>();
    let (a_lanes, a_tail) = a.as_chunks::<32>();
    let (b_lanes, b_tail) = b.as_chunks::<32>();
    for ((dst_lane, a_lane), b_lane) in dst_lanes.iter_mut().zip(a_lanes).zip(b_lanes) {
        let va = fold_avx2(_mm256_loadu_si256(a_lane), p);
        let vb = fold_avx2(_mm256_loadu_si256(b_lane), p);
        _mm256_storeu_si256(dst_lane, cmul_vec(va, vb, p));
    }
    prime::mul_elementwise::<QuadMersenne31>(dst_tail, a_tail, b_tail);
}

/// `dst[i] = dst[i] * src[i]` in GF((2^31 - 1)^2), AVX2.
///
/// All buffers hold canonical lanes — every 32-bit limb below the modulus —
/// and every stored lane is canonical.
///
/// # Panics
/// Panics if the slices differ in length or hold a partial element.
#[allow(clippy::used_underscore_binding)]
#[archmage::arcane(import_intrinsics)]
pub fn mul_elementwise_assign_avx2(_token: archmage::X64V3Token, dst: &mut [u8], src: &[u8]) {
    check_equal(
        "quad_mersenne31::mul_elementwise_assign_avx2",
        "dst",
        dst.len(),
        "src",
        src.len(),
    );
    check_elem_multiple("quad_mersenne31::mul_elementwise_assign_avx2", dst.len(), 8);
    let p = _mm256_set1_epi32(P);
    let (dst_lanes, dst_tail) = dst.as_chunks_mut::<32>();
    let (src_lanes, src_tail) = src.as_chunks::<32>();
    for (dst_lane, src_lane) in dst_lanes.iter_mut().zip(src_lanes) {
        let vd = fold_avx2(_mm256_loadu_si256(&*dst_lane), p);
        let vs = fold_avx2(_mm256_loadu_si256(src_lane), p);
        _mm256_storeu_si256(dst_lane, cmul_vec(vd, vs, p));
    }
    scalar::mul_elementwise_assign::<QuadMersenne31>(dst_tail, src_tail);
}

/// `dst[i] += value` in GF((2^31 - 1)^2), AVX2. The raw `value` limbs are
/// canonicalized once on entry.
///
/// The destination lanes are canonicalized on load; the broadcast value is
/// used as given.
///
/// # Panics
/// Panics on a partial trailing element.
#[allow(clippy::cast_possible_wrap, clippy::used_underscore_binding)]
#[archmage::arcane(import_intrinsics)]
pub fn add_assign_scalar_avx2(_token: archmage::X64V3Token, dst: &mut [u8], value: Elem) {
    check_elem_multiple("quad_mersenne31::add_assign_scalar_avx2", dst.len(), 8);
    // The broadcast value is loop-invariant: canonicalize the raw limbs once.
    let (vr, vi) = value.canonical().to_raw();
    // Broadcast the (re, im) pair onto the alternating limb lanes.
    let svec = _mm256_blend_epi32::<0b1010_1010>(
        _mm256_set1_epi32(vr as i32),
        _mm256_set1_epi32(vi as i32),
    );
    let p = _mm256_set1_epi32(P);
    let (dst_lanes, dst_tail) = dst.as_chunks_mut::<32>();
    for dst_lane in dst_lanes {
        let d = fold_avx2(_mm256_loadu_si256(&*dst_lane), p);
        _mm256_storeu_si256(dst_lane, addmod(d, svec, p));
    }
    prime::add_assign_scalar::<QuadMersenne31>(dst_tail, value);
}

/// `dst[i] -= value` in GF((2^31 - 1)^2), AVX2. The raw `value` limbs are
/// canonicalized once on entry.
///
/// The destination lanes are canonicalized on load; the broadcast value is
/// used as given.
///
/// # Panics
/// Panics on a partial trailing element.
#[allow(clippy::cast_possible_wrap, clippy::used_underscore_binding)]
#[archmage::arcane(import_intrinsics)]
pub fn sub_assign_scalar_avx2(_token: archmage::X64V3Token, dst: &mut [u8], value: Elem) {
    check_elem_multiple("quad_mersenne31::sub_assign_scalar_avx2", dst.len(), 8);
    let (vr, vi) = value.canonical().to_raw();
    let svec = _mm256_blend_epi32::<0b1010_1010>(
        _mm256_set1_epi32(vr as i32),
        _mm256_set1_epi32(vi as i32),
    );
    let p = _mm256_set1_epi32(P);
    let (dst_lanes, dst_tail) = dst.as_chunks_mut::<32>();
    for dst_lane in dst_lanes {
        let d = fold_avx2(_mm256_loadu_si256(&*dst_lane), p);
        _mm256_storeu_si256(dst_lane, submod(d, svec, p));
    }
    prime::sub_assign_scalar::<QuadMersenne31>(dst_tail, value);
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::kernel::{KernelDispatch, RawDispatch};
    use archmage::SimdToken as _;

    /// Lengths in bytes straddling the 32-byte vector lane: empty, one
    /// element, sub-vector tails of one and three elements, exact vectors,
    /// vector-plus-tail, and a large odd size.
    const LENS: &[usize] = &[0, 8, 16, 24, 32, 40, 64, 72, 128, 264, 1024];

    /// Coefficients: zero, one, the imaginary unit, canonical limb
    /// extremes, mixed values, the field generator, and raw non-canonical
    /// limbs — the last two exercise the coefficient canonicalization the
    /// contract allows.
    const COEFFS: [Elem; 9] = [
        Elem::ZERO,
        Elem::ONE,
        Elem::I,
        Elem::from_raw(mersenne31::MODULUS - 1, mersenne31::MODULUS - 1),
        Elem::from_raw(1, mersenne31::MODULUS - 1),
        Elem::from_raw(0x5555_5555, 0x1234_5678),
        Elem::from_raw(mersenne31::MODULUS, 0), // non-canonical zero
        Elem::from_raw(u32::MAX, 2),            // raw limb, value 1 + 2i
        Elem::from_raw(1, 12),                  // the field generator
    ];

    /// A full-work coefficient: canonical, neither zero nor one, both
    /// limbs nonzero.
    const FULL_WORK: Elem = Elem::from_raw(0x1234_5678, 0x3FFF_FFF1);

    fn noise(len: usize, seed: u64) -> Vec<u8> {
        let mut state = seed | 1;
        (0..len)
            .map(|_| {
                state = state
                    .wrapping_mul(6_364_136_223_846_793_005)
                    .wrapping_add(1);
                (state >> 33).to_le_bytes()[0]
            })
            .collect()
    }

    /// Random whole elements with canonical limbs, meeting the packed
    /// canonical-lane contract.
    fn canonical(len: usize, seed: u64) -> Vec<u8> {
        let mut out = noise(len, seed);
        for chunk in out.chunks_exact_mut(8) {
            let e = Elem::from_bytes(chunk.try_into().unwrap());
            chunk.copy_from_slice(&e.canonical().to_bytes());
        }
        out
    }

    /// Canonical edge elements tiled to `len` bytes: zero, both-limb and
    /// single-limb `p - 1` (the largest canonical limb), one, and a mixed
    /// pair — the range edges in the source operands themselves.
    fn edges(len: usize) -> Vec<u8> {
        const EDGES: [Elem; 5] = [
            Elem::ZERO,
            Elem::from_raw(mersenne31::MODULUS - 1, mersenne31::MODULUS - 1),
            Elem::from_raw(mersenne31::MODULUS - 1, 0),
            Elem::ONE,
            Elem::from_raw(0x5555_5555, 0x1234_5678),
        ];
        let mut out = Vec::with_capacity(len);
        for i in 0..len / 8 {
            out.extend_from_slice(&EDGES[i % EDGES.len()].to_bytes());
        }
        out
    }

    // Independent `u128 % p` limb model: deliberately sharing no reduction
    // shape with the kernels or the field type.
    fn o_canon(x: u32) -> u32 {
        u32::try_from(u128::from(x) % u128::from(mersenne31::MODULUS)).unwrap()
    }
    fn o_add(a: u32, b: u32) -> u32 {
        u32::try_from(
            (u128::from(o_canon(a)) + u128::from(o_canon(b))) % u128::from(mersenne31::MODULUS),
        )
        .unwrap()
    }
    fn o_sub(a: u32, b: u32) -> u32 {
        let d = i128::from(o_canon(a)) - i128::from(o_canon(b));
        u32::try_from(d.rem_euclid(i128::from(mersenne31::MODULUS))).unwrap()
    }
    fn o_mul(a: u32, b: u32) -> u32 {
        u32::try_from(
            (u128::from(o_canon(a)) * u128::from(o_canon(b))) % u128::from(mersenne31::MODULUS),
        )
        .unwrap()
    }

    fn model_elem_add(a: Elem, b: Elem) -> Elem {
        let (ar, ai) = a.to_raw();
        let (br, bi) = b.to_raw();
        Elem::from_raw(o_add(ar, br), o_add(ai, bi))
    }
    fn model_elem_sub(a: Elem, b: Elem) -> Elem {
        let (ar, ai) = a.to_raw();
        let (br, bi) = b.to_raw();
        Elem::from_raw(o_sub(ar, br), o_sub(ai, bi))
    }
    fn model_elem_mul(a: Elem, b: Elem) -> Elem {
        let (ar, ai) = a.to_raw();
        let (br, bi) = b.to_raw();
        Elem::from_raw(
            o_sub(o_mul(ar, br), o_mul(ai, bi)),
            o_add(o_mul(ar, bi), o_mul(ai, br)),
        )
    }

    /// Decode a whole-element buffer, apply `f` elementwise, re-encode.
    fn model_map(buf: &[u8], f: impl Fn(Elem) -> Elem) -> Vec<u8> {
        let mut out = buf.to_vec();
        for chunk in out.chunks_exact_mut(8) {
            let e = f(Elem::from_bytes(chunk.try_into().unwrap()));
            chunk.copy_from_slice(&e.to_bytes());
        }
        out
    }

    /// Decode two whole-element buffers positionally, apply `f` pairwise,
    /// re-encode.
    fn model_zip(a: &[u8], b: &[u8], f: impl Fn(Elem, Elem) -> Elem) -> Vec<u8> {
        assert_eq!(a.len(), b.len());
        let mut out = a.to_vec();
        for (ca, cb) in out.chunks_exact_mut(8).zip(b.chunks_exact(8)) {
            let e = f(
                Elem::from_bytes(ca.try_into().unwrap()),
                Elem::from_bytes(cb.try_into().unwrap()),
            );
            ca.copy_from_slice(&e.to_bytes());
        }
        out
    }

    /// Whether the host resolves to V3 — the same single-source selection
    /// the shared differential tests use, honoring `SIMD_BACKEND`.
    fn host_v3() -> bool {
        simdispatch::Selection::new("SIMD_BACKEND")
            .supports(&[crate::kernel::Backend::V3])
            .resolve()
            != crate::kernel::Backend::Scalar
    }

    /// Every operation matches the independent limb model across boundary
    /// lengths, canonical random fixtures, and canonical edge elements in
    /// the source operands.
    #[test]
    fn avx2_matches_independent_model() {
        if !host_v3() {
            eprintln!("skipping: no AVX2 on this host");
            return;
        }
        let token = archmage::X64V3Token::summon().expect("guard passed: AVX2 summons here");
        for &len in LENS {
            for (src, base, b2) in [
                (
                    canonical(len, 0xa1 + len as u64),
                    canonical(len, 0xb2 + len as u64),
                    canonical(len, 0xc3 + len as u64),
                ),
                (edges(len), edges(len), edges(len)),
            ] {
                let mut got = base.clone();
                add_assign_avx2(token, &mut got, &src);
                assert_eq!(
                    got,
                    model_zip(&base, &src, model_elem_add),
                    "add_assign len {len}"
                );

                let mut got = base.clone();
                sub_assign_avx2(token, &mut got, &src);
                assert_eq!(
                    got,
                    model_zip(&base, &src, model_elem_sub),
                    "sub_assign len {len}"
                );

                let mut got = vec![0u8; len];
                mul_elementwise_avx2(token, &mut got, &src, &b2);
                assert_eq!(
                    got,
                    model_zip(&src, &b2, model_elem_mul),
                    "mul_elementwise len {len}"
                );

                for &coeff in &COEFFS {
                    let mut got = base.clone();
                    mul_add_avx2(token, &mut got, coeff, &src);
                    assert_eq!(
                        got,
                        model_zip(&base, &src, |d, s| {
                            model_elem_add(d, model_elem_mul(coeff, s))
                        }),
                        "mul_add len {len} coeff {coeff:?}"
                    );

                    let mut got = vec![0u8; len];
                    mul_into_avx2(token, &mut got, coeff, &src);
                    assert_eq!(
                        got,
                        model_map(&src, |e| model_elem_mul(coeff, e)),
                        "mul_into len {len} coeff {coeff:?}"
                    );

                    let mut got = base.clone();
                    mul_assign_avx2(token, &mut got, coeff);
                    assert_eq!(
                        got,
                        model_map(&base, |e| model_elem_mul(coeff, e)),
                        "mul_assign len {len} coeff {coeff:?}"
                    );
                }
            }
        }
    }

    /// Every operation agrees with the portable [`prime`] differential
    /// oracle over lengths straddling the vector lane.
    #[test]
    fn avx2_matches_portable_reference() {
        if !host_v3() {
            eprintln!("skipping: no AVX2 on this host");
            return;
        }
        let token = archmage::X64V3Token::summon().expect("guard passed: AVX2 summons here");
        // Vector-plus-tail, exact vectors, and a different tail.
        for &len in &[40usize, 64, 72] {
            let src = edges(len);
            let base = canonical(len, 0xb2 + len as u64);
            let b2 = canonical(len, 0xc3 + len as u64);

            let mut got = base.clone();
            let mut want = base.clone();
            add_assign_avx2(token, &mut got, &src);
            prime::add_assign::<QuadMersenne31>(&mut want, &src);
            assert_eq!(got, want, "add_assign vs reference len {len}");

            let mut got = base.clone();
            let mut want = base.clone();
            sub_assign_avx2(token, &mut got, &src);
            prime::sub_assign::<QuadMersenne31>(&mut want, &src);
            assert_eq!(got, want, "sub_assign vs reference len {len}");

            let mut got = vec![0u8; len];
            let mut want = vec![0u8; len];
            mul_elementwise_avx2(token, &mut got, &src, &b2);
            prime::mul_elementwise::<QuadMersenne31>(&mut want, &src, &b2);
            assert_eq!(got, want, "mul_elementwise vs reference len {len}");

            let mut got = base.clone();
            let mut want = base.clone();
            mul_add_avx2(token, &mut got, FULL_WORK, &src);
            prime::mul_add::<QuadMersenne31>(&mut want, FULL_WORK, &src);
            assert_eq!(got, want, "mul_add vs reference len {len}");

            let mut got = vec![0u8; len];
            let mut want = src.clone();
            mul_into_avx2(token, &mut got, FULL_WORK, &src);
            prime::mul_assign::<QuadMersenne31>(&mut want, FULL_WORK);
            assert_eq!(got, want, "mul_into vs reference len {len}");

            let mut got = base.clone();
            let mut want = base.clone();
            mul_assign_avx2(token, &mut got, FULL_WORK);
            prime::mul_assign::<QuadMersenne31>(&mut want, FULL_WORK);
            assert_eq!(got, want, "mul_assign vs reference len {len}");
        }
    }

    /// The zero and one coefficient shortcuts preserve the scalar
    /// control's observable behavior. The zero arms never read `dst`, so a
    /// raw destination pattern defends the byte-preserving contract; the
    /// one shortcut adds, so its destination holds canonical elements.
    #[test]
    fn avx2_zero_one_shortcuts_match_control() {
        if !host_v3() {
            eprintln!("skipping: no AVX2 on this host");
            return;
        }
        let token = archmage::X64V3Token::summon().expect("guard passed: AVX2 summons here");

        let len = 40;
        let src = canonical(len, 0x71);
        // Zero, including a non-canonical limb spelling of it: the no-op
        // for mul_add and the fill for mul_assign and mul_into.
        for coeff in [Elem::ZERO, Elem::from_raw(mersenne31::MODULUS, 0)] {
            let mut got = vec![0xA5u8; len];
            let mut want = vec![0xA5u8; len];
            mul_add_avx2(token, &mut got, coeff, &src);
            <QuadMersenne31 as KernelDispatch>::mul_add(RawDispatch, &mut want, &coeff, &src);
            assert_eq!(got, want, "shortcut mul_add {coeff:?}");

            let mut got = vec![0xA5u8; len];
            let mut want = vec![0xA5u8; len];
            mul_assign_avx2(token, &mut got, coeff);
            <QuadMersenne31 as KernelDispatch>::mul_assign(RawDispatch, &mut want, &coeff);
            assert_eq!(got, want, "shortcut mul_assign {coeff:?}");

            let mut got = vec![0xA5u8; len];
            let mut want = vec![0xA5u8; len];
            mul_into_avx2(token, &mut got, coeff, &src);
            <QuadMersenne31 as KernelDispatch>::mul_into(RawDispatch, &mut want, &coeff, &src);
            assert_eq!(got, want, "shortcut mul_into {coeff:?}");
        }
        // The one shortcut: mul_add adds, mul_assign is the identity.
        let mut got = canonical(len, 0x72);
        let mut want = got.clone();
        mul_add_avx2(token, &mut got, Elem::ONE, &src);
        <QuadMersenne31 as KernelDispatch>::mul_add(RawDispatch, &mut want, &Elem::ONE, &src);
        assert_eq!(got, want, "shortcut mul_add one");

        let mut got = canonical(len, 0x72);
        let mut want = got.clone();
        mul_assign_avx2(token, &mut got, Elem::ONE);
        <QuadMersenne31 as KernelDispatch>::mul_assign(RawDispatch, &mut want, &Elem::ONE);
        assert_eq!(got, want, "shortcut mul_assign one");
    }

    /// Unaligned but whole-element slices are legal: every access is an
    /// unaligned load or store. Each offset window holds canonical element
    /// bytes copied in; only its address is odd.
    #[test]
    fn avx2_unaligned_slices() {
        if !host_v3() {
            eprintln!("skipping: no AVX2 on this host");
            return;
        }
        let token = archmage::X64V3Token::summon().expect("guard passed: AVX2 summons here");
        let len = 72;
        let src_elems = edges(len);
        let dst_elems = canonical(len, 0x82);
        let coeff = Elem::from_raw(3, 5);
        for offset in [0usize, 1, 3, 5] {
            let mut src_storage = vec![0u8; len + 8];
            src_storage[offset..offset + len].copy_from_slice(&src_elems);
            let src = &src_storage[offset..offset + len];
            let mut got = vec![0u8; len];
            mul_into_avx2(token, &mut got, coeff, src);
            assert_eq!(
                got,
                model_map(src, |e| model_elem_mul(coeff, e)),
                "unaligned mul_into offset {offset}"
            );

            // Unaligned destination as well as source.
            let mut dst_storage = vec![0u8; len + 8];
            dst_storage[offset..offset + len].copy_from_slice(&dst_elems);
            let dst = &mut dst_storage[offset..offset + len];
            add_assign_avx2(token, dst, src);
            assert_eq!(
                &dst_storage[offset..offset + len],
                &model_zip(&dst_elems, &src_elems, model_elem_add)[..],
                "unaligned add_assign offset {offset}"
            );
        }
    }

    /// The invocation must panic on bad geometry and leave `dst`
    /// unchanged: validation precedes every write.
    fn expect_geometry_panic(label: &str, dst: &mut [u8], invoke: impl FnOnce(&mut [u8])) {
        let before = dst.to_vec();
        let panicked =
            std::panic::catch_unwind(std::panic::AssertUnwindSafe(|| invoke(dst))).is_err();
        assert!(panicked, "{label} must panic");
        assert_eq!(
            &*dst,
            &before[..],
            "{label} must not write before validating"
        );
    }

    /// Geometry validation fires before any write: every entry rejects a
    /// partial trailing element, and every multi-operand entry rejects a
    /// length mismatch.
    #[test]
    fn avx2_geometry_validation_precedes_writes() {
        if !host_v3() {
            eprintln!("skipping: no AVX2 on this host");
            return;
        }
        let token = archmage::X64V3Token::summon().expect("guard passed: AVX2 summons here");
        let coeff = Elem::from_raw(3, 5);

        let mut partial = [1u8; 12];
        let partial_src = [1u8; 12];
        expect_geometry_panic("add partial", &mut partial, |d| {
            add_assign_avx2(token, d, &partial_src);
        });
        let mut partial = [1u8; 12];
        let partial_src = [1u8; 12];
        expect_geometry_panic("sub partial", &mut partial, |d| {
            sub_assign_avx2(token, d, &partial_src);
        });
        let mut partial = [1u8; 12];
        let partial_src = [1u8; 12];
        expect_geometry_panic("mul_add partial", &mut partial, |d| {
            mul_add_avx2(token, d, coeff, &partial_src);
        });
        let mut partial = [1u8; 12];
        expect_geometry_panic("mul_assign partial", &mut partial, |d| {
            mul_assign_avx2(token, d, coeff);
        });
        let mut partial = [1u8; 12];
        let partial_src = [1u8; 12];
        expect_geometry_panic("mul_into partial", &mut partial, |d| {
            mul_into_avx2(token, d, coeff, &partial_src);
        });
        let mut partial = [1u8; 12];
        let partial_src = [1u8; 12];
        expect_geometry_panic("mul_elementwise partial", &mut partial, |d| {
            mul_elementwise_avx2(token, d, &partial_src, &partial_src);
        });

        let mut mismatched = [1u8; 16];
        let short_src = [1u8; 8];
        expect_geometry_panic("add length mismatch", &mut mismatched, |d| {
            add_assign_avx2(token, d, &short_src);
        });
        let mut mismatched = [1u8; 16];
        let full_src = [1u8; 16];
        let short_src = [1u8; 8];
        expect_geometry_panic("mul_elementwise b mismatch", &mut mismatched, |d| {
            mul_elementwise_avx2(token, d, &full_src, &short_src);
        });
    }
}