aprender-core 0.34.0

Next-generation machine learning library in pure Rust
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
// `transpose-kernel-v1` algorithm-level PARTIAL discharge for
// FALSIFY-TP-001..006.
//
// Contract: `contracts/transpose-kernel-v1.yaml`.
//
// Pure-Rust verdicts for the 6 falsification gates plus a reference
// row-major transpose helper.
//
// TP-001: element correctness — transpose(A)[j][i] == A[i][j]
// TP-002: involution — transpose(transpose(A)) == A bitwise
// TP-003: non-8-aligned dimensions handled correctly
// TP-004: AVX2 vs scalar bit-exact parity
// TP-005: transpose(I) == I for square identity
// TP-006: attention shape 2048×128 matches naive reference

#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum TpVerdict {
    Pass,
    Fail,
}

/// Reference row-major transpose: out[j*rows + i] = src[i*cols + j].
/// Returns `None` if `src.len() != rows * cols`.
#[must_use]
pub fn transpose_rowmajor(src: &[f32], rows: usize, cols: usize) -> Option<Vec<f32>> {
    if src.len() != rows.checked_mul(cols)? {
        return None;
    }
    let mut out = vec![0.0_f32; src.len()];
    for i in 0..rows {
        for j in 0..cols {
            out[j * rows + i] = src[i * cols + j];
        }
    }
    Some(out)
}

/// TP-001: transpose(A)[j][i] == A[i][j] for the given (i, j).
/// `transposed` is the kernel's output as a flat row-major buffer.
#[must_use]
pub fn verdict_from_element_correctness(
    src: &[f32],
    transposed: &[f32],
    rows: usize,
    cols: usize,
    i: usize,
    j: usize,
) -> TpVerdict {
    if rows == 0 || cols == 0 {
        return TpVerdict::Fail;
    }
    if i >= rows || j >= cols {
        return TpVerdict::Fail;
    }
    if src.len() != rows * cols || transposed.len() != rows * cols {
        return TpVerdict::Fail;
    }
    let original = src[i * cols + j];
    let mapped = transposed[j * rows + i];
    if original.to_bits() == mapped.to_bits() {
        TpVerdict::Pass
    } else {
        TpVerdict::Fail
    }
}

/// TP-002: transpose(transpose(A)) == A bitwise.
#[must_use]
pub fn verdict_from_involution(src: &[f32], rows: usize, cols: usize) -> TpVerdict {
    let Some(once) = transpose_rowmajor(src, rows, cols) else {
        return TpVerdict::Fail;
    };
    let Some(twice) = transpose_rowmajor(&once, cols, rows) else {
        return TpVerdict::Fail;
    };
    if src.len() != twice.len() {
        return TpVerdict::Fail;
    }
    for (a, b) in src.iter().zip(twice.iter()) {
        if a.to_bits() != b.to_bits() {
            return TpVerdict::Fail;
        }
    }
    TpVerdict::Pass
}

/// TP-003: non-8-aligned dimensions transpose correctly.
#[must_use]
pub fn verdict_from_non_aligned_correctness(rows: usize, cols: usize) -> TpVerdict {
    if rows == 0 || cols == 0 {
        return TpVerdict::Fail;
    }
    let n = rows.checked_mul(cols).unwrap_or(0);
    if n == 0 {
        return TpVerdict::Fail;
    }
    // Build a deterministic test matrix where src[i*cols+j] = i*1000+j
    let src: Vec<f32> = (0..rows)
        .flat_map(|i| (0..cols).map(move |j| (i * 1000 + j) as f32))
        .collect();
    let Some(t) = transpose_rowmajor(&src, rows, cols) else {
        return TpVerdict::Fail;
    };
    for i in 0..rows {
        for j in 0..cols {
            let expected = src[i * cols + j];
            let got = t[j * rows + i];
            if expected.to_bits() != got.to_bits() {
                return TpVerdict::Fail;
            }
        }
    }
    TpVerdict::Pass
}

/// TP-004: AVX2 output bit-exact equal to scalar output.
#[must_use]
pub fn verdict_from_avx2_scalar_parity(avx2_out: &[f32], scalar_out: &[f32]) -> TpVerdict {
    if avx2_out.is_empty() || avx2_out.len() != scalar_out.len() {
        return TpVerdict::Fail;
    }
    for (a, s) in avx2_out.iter().zip(scalar_out.iter()) {
        if a.to_bits() != s.to_bits() {
            return TpVerdict::Fail;
        }
    }
    TpVerdict::Pass
}

/// TP-005: transpose of N×N identity is itself.
#[must_use]
pub fn verdict_from_identity(n: usize) -> TpVerdict {
    if n == 0 {
        return TpVerdict::Fail;
    }
    let mut id = vec![0.0_f32; n * n];
    for i in 0..n {
        id[i * n + i] = 1.0;
    }
    let Some(t) = transpose_rowmajor(&id, n, n) else {
        return TpVerdict::Fail;
    };
    if id.len() != t.len() {
        return TpVerdict::Fail;
    }
    for (a, b) in id.iter().zip(t.iter()) {
        if a.to_bits() != b.to_bits() {
            return TpVerdict::Fail;
        }
    }
    TpVerdict::Pass
}

/// TP-006: 2048×128 attention shape — kernel matches naive reference.
///
/// Caller passes `(kernel_output, naive_reference)` for the canonical
/// 2048×128 case. Pass iff bit-exact, length-matched, and dims correct.
#[must_use]
pub fn verdict_from_attention_shape(
    kernel_output: &[f32],
    naive_reference: &[f32],
    rows: usize,
    cols: usize,
) -> TpVerdict {
    if rows != 2048 || cols != 128 {
        return TpVerdict::Fail;
    }
    if kernel_output.len() != rows * cols || naive_reference.len() != rows * cols {
        return TpVerdict::Fail;
    }
    for (a, b) in kernel_output.iter().zip(naive_reference.iter()) {
        if a.to_bits() != b.to_bits() {
            return TpVerdict::Fail;
        }
    }
    TpVerdict::Pass
}

#[cfg(test)]
mod tests {
    use super::*;

    fn build_test_matrix(rows: usize, cols: usize) -> Vec<f32> {
        (0..rows)
            .flat_map(|i| (0..cols).map(move |j| (i * 1000 + j) as f32))
            .collect()
    }

    // -----------------------------------------------------------------
    // Section 1: Reference helper.
    // -----------------------------------------------------------------
    #[test]
    fn transpose_rowmajor_roundtrip() {
        let src = build_test_matrix(4, 3);
        let t = transpose_rowmajor(&src, 4, 3).unwrap();
        let back = transpose_rowmajor(&t, 3, 4).unwrap();
        assert_eq!(src, back);
    }

    #[test]
    fn transpose_rowmajor_size_mismatch_returns_none() {
        let src = vec![1.0_f32; 11];
        assert!(transpose_rowmajor(&src, 3, 4).is_none());
    }

    // -----------------------------------------------------------------
    // Section 2: TP-001 element correctness.
    // -----------------------------------------------------------------
    #[test]
    fn ftp001_pass_first_element() {
        let src = build_test_matrix(4, 3);
        let t = transpose_rowmajor(&src, 4, 3).unwrap();
        let v = verdict_from_element_correctness(&src, &t, 4, 3, 0, 0);
        assert_eq!(v, TpVerdict::Pass);
    }

    #[test]
    fn ftp001_pass_last_element() {
        let src = build_test_matrix(4, 3);
        let t = transpose_rowmajor(&src, 4, 3).unwrap();
        let v = verdict_from_element_correctness(&src, &t, 4, 3, 3, 2);
        assert_eq!(v, TpVerdict::Pass);
    }

    #[test]
    fn ftp001_fail_index_out_of_bounds() {
        let src = build_test_matrix(4, 3);
        let t = transpose_rowmajor(&src, 4, 3).unwrap();
        let v = verdict_from_element_correctness(&src, &t, 4, 3, 4, 0);
        assert_eq!(v, TpVerdict::Fail);
    }

    #[test]
    fn ftp001_fail_buggy_kernel() {
        // Simulate buggy kernel that scrambles output.
        let src = build_test_matrix(4, 3);
        let mut t = transpose_rowmajor(&src, 4, 3).unwrap();
        t[0] = 99.0; // corrupt
        let v = verdict_from_element_correctness(&src, &t, 4, 3, 0, 0);
        assert_eq!(v, TpVerdict::Fail);
    }

    // -----------------------------------------------------------------
    // Section 3: TP-002 involution.
    // -----------------------------------------------------------------
    #[test]
    fn ftp002_pass_8x8() {
        let src = build_test_matrix(8, 8);
        let v = verdict_from_involution(&src, 8, 8);
        assert_eq!(v, TpVerdict::Pass);
    }

    #[test]
    fn ftp002_pass_non_aligned() {
        let src = build_test_matrix(7, 13);
        let v = verdict_from_involution(&src, 7, 13);
        assert_eq!(v, TpVerdict::Pass);
    }

    #[test]
    fn ftp002_pass_skinny() {
        let src = build_test_matrix(1, 100);
        let v = verdict_from_involution(&src, 1, 100);
        assert_eq!(v, TpVerdict::Pass);
    }

    #[test]
    fn ftp002_fail_size_mismatch() {
        let src = vec![1.0_f32; 11]; // 11 doesn't factor into 3x4
        let v = verdict_from_involution(&src, 3, 4);
        assert_eq!(v, TpVerdict::Fail);
    }

    // -----------------------------------------------------------------
    // Section 4: TP-003 non-8-aligned.
    // -----------------------------------------------------------------
    #[test]
    fn ftp003_pass_7x13() {
        let v = verdict_from_non_aligned_correctness(7, 13);
        assert_eq!(v, TpVerdict::Pass);
    }

    #[test]
    fn ftp003_pass_17x3() {
        let v = verdict_from_non_aligned_correctness(17, 3);
        assert_eq!(v, TpVerdict::Pass);
    }

    #[test]
    fn ftp003_pass_1x100() {
        let v = verdict_from_non_aligned_correctness(1, 100);
        assert_eq!(v, TpVerdict::Pass);
    }

    #[test]
    fn ftp003_pass_100x1() {
        let v = verdict_from_non_aligned_correctness(100, 1);
        assert_eq!(v, TpVerdict::Pass);
    }

    #[test]
    fn ftp003_fail_zero_dim() {
        let v = verdict_from_non_aligned_correctness(0, 13);
        assert_eq!(v, TpVerdict::Fail);
    }

    // -----------------------------------------------------------------
    // Section 5: TP-004 AVX2 vs scalar.
    // -----------------------------------------------------------------
    #[test]
    fn ftp004_pass_bit_exact() {
        let avx2 = vec![1.0_f32, 2.5, 3.0, 4.5];
        let scalar = vec![1.0_f32, 2.5, 3.0, 4.5];
        let v = verdict_from_avx2_scalar_parity(&avx2, &scalar);
        assert_eq!(v, TpVerdict::Pass);
    }

    #[test]
    fn ftp004_fail_one_ulp() {
        let avx2 = vec![1.0_f32, 2.5];
        let bumped = f32::from_bits(2.5_f32.to_bits() + 1);
        let scalar = vec![1.0_f32, bumped];
        let v = verdict_from_avx2_scalar_parity(&avx2, &scalar);
        assert_eq!(v, TpVerdict::Fail);
    }

    #[test]
    fn ftp004_fail_empty() {
        let v = verdict_from_avx2_scalar_parity(&[], &[]);
        assert_eq!(v, TpVerdict::Fail);
    }

    // -----------------------------------------------------------------
    // Section 6: TP-005 identity, TP-006 attention shape.
    // -----------------------------------------------------------------
    #[test]
    fn ftp005_pass_identity_4() {
        let v = verdict_from_identity(4);
        assert_eq!(v, TpVerdict::Pass);
    }

    #[test]
    fn ftp005_pass_identity_8() {
        let v = verdict_from_identity(8);
        assert_eq!(v, TpVerdict::Pass);
    }

    #[test]
    fn ftp005_pass_identity_17() {
        let v = verdict_from_identity(17);
        assert_eq!(v, TpVerdict::Pass);
    }

    #[test]
    fn ftp005_fail_zero() {
        let v = verdict_from_identity(0);
        assert_eq!(v, TpVerdict::Fail);
    }

    #[test]
    fn ftp006_pass_canonical_2048_128() {
        let src = build_test_matrix(2048, 128);
        let kernel = transpose_rowmajor(&src, 2048, 128).unwrap();
        let naive = transpose_rowmajor(&src, 2048, 128).unwrap();
        let v = verdict_from_attention_shape(&kernel, &naive, 2048, 128);
        assert_eq!(v, TpVerdict::Pass);
    }

    #[test]
    fn ftp006_fail_wrong_dims() {
        let src = build_test_matrix(1024, 128);
        let kernel = transpose_rowmajor(&src, 1024, 128).unwrap();
        let v = verdict_from_attention_shape(&kernel, &kernel, 1024, 128);
        assert_eq!(v, TpVerdict::Fail);
    }

    #[test]
    fn ftp006_fail_kernel_drift() {
        let src = build_test_matrix(2048, 128);
        let mut kernel = transpose_rowmajor(&src, 2048, 128).unwrap();
        kernel[0] = 99.0; // corrupt
        let naive = transpose_rowmajor(&src, 2048, 128).unwrap();
        let v = verdict_from_attention_shape(&kernel, &naive, 2048, 128);
        assert_eq!(v, TpVerdict::Fail);
    }

    // -----------------------------------------------------------------
    // Section 7: Mutation surveys + realistic.
    // -----------------------------------------------------------------
    #[test]
    fn mutation_survey_002_dim_pairs() {
        for &(r, c) in &[(1usize, 1), (3, 5), (7, 13), (8, 8), (17, 3), (32, 32)] {
            let src = build_test_matrix(r, c);
            let v = verdict_from_involution(&src, r, c);
            assert_eq!(v, TpVerdict::Pass, "({r}, {c})");
        }
    }

    #[test]
    fn realistic_healthy_passes_all_6() {
        let src = build_test_matrix(2048, 128);
        let t = transpose_rowmajor(&src, 2048, 128).unwrap();
        let v1 = verdict_from_element_correctness(&src, &t, 2048, 128, 1024, 64);
        let v2 = verdict_from_involution(&src, 2048, 128);
        let v3 = verdict_from_non_aligned_correctness(7, 13);
        let v4 = verdict_from_avx2_scalar_parity(&t, &t);
        let v5 = verdict_from_identity(8);
        let v6 = verdict_from_attention_shape(&t, &t, 2048, 128);
        assert_eq!(v1, TpVerdict::Pass);
        assert_eq!(v2, TpVerdict::Pass);
        assert_eq!(v3, TpVerdict::Pass);
        assert_eq!(v4, TpVerdict::Pass);
        assert_eq!(v5, TpVerdict::Pass);
        assert_eq!(v6, TpVerdict::Pass);
    }

    #[test]
    fn realistic_pre_fix_all_6_failures() {
        // Pre-fix regressions:
        //  1: kernel returned wrong element at (0, 0)
        //  2: involution failed because transpose isn't symmetric
        //  3: non-aligned skipped edge elements (n=0)
        //  4: AVX2 produced 1-ULP drift vs scalar
        //  5: identity collapsed to zero (n=0 sentinel)
        //  6: attention shape kernel had element drift
        let src = build_test_matrix(2048, 128);
        let mut t = transpose_rowmajor(&src, 2048, 128).unwrap();
        t[0] = 99.0;
        let v1 = verdict_from_element_correctness(&src, &t, 2048, 128, 0, 0);
        let bad_src = vec![1.0_f32; 11];
        let v2 = verdict_from_involution(&bad_src, 3, 4);
        let v3 = verdict_from_non_aligned_correctness(0, 13);
        let avx = vec![1.0_f32];
        let bumped = f32::from_bits(1.0_f32.to_bits() + 1);
        let scalar = vec![bumped];
        let v4 = verdict_from_avx2_scalar_parity(&avx, &scalar);
        let v5 = verdict_from_identity(0);
        let naive = transpose_rowmajor(&src, 2048, 128).unwrap();
        let v6 = verdict_from_attention_shape(&t, &naive, 2048, 128);
        assert_eq!(v1, TpVerdict::Fail);
        assert_eq!(v2, TpVerdict::Fail);
        assert_eq!(v3, TpVerdict::Fail);
        assert_eq!(v4, TpVerdict::Fail);
        assert_eq!(v5, TpVerdict::Fail);
        assert_eq!(v6, TpVerdict::Fail);
    }
}