ziskos 1.1.0-alpha

Guest runtime and entrypoint for programs targeting the ZisK zkVM
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
//! Map-to-curve for BLS12-381 G1 and G2

use crate::zisklib::{eq, is_zero, lt};

use super::{
    constants::{
        COFACTOR_G1, ISO_A_G1, ISO_A_G2, ISO_B_G1, ISO_B_G2, ISO_X_DEN_G1, ISO_X_DEN_G2,
        ISO_X_NUM_G1, ISO_X_NUM_G2, ISO_Y_DEN_G1, ISO_Y_DEN_G2, ISO_Y_NUM_G1, ISO_Y_NUM_G2, P,
        SWU_Z2_G1, SWU_Z_G1, SWU_Z_G2,
    },
    curve::{g1_u64_le_to_bytes_be_bls12_381, scalar_mul_complete_bls12_381},
    fp::{
        add_fp_bls12_381, bytes_be_to_u64_le_fp_bls12_381, inv_fp_bls12_381, mul_fp_bls12_381,
        neg_fp_bls12_381, sgn0_fp_bls12_381, sqrt_fp_bls12_381, square_fp_bls12_381,
    },
    fp2::{
        add_fp2_bls12_381, bytes_be_to_u64_le_fp2_bls12_381, inv_fp2_bls12_381, mul_fp2_bls12_381,
        neg_fp2_bls12_381, sgn0_fp2_bls12_381, sqrt_fp2_bls12_381, square_fp2_bls12_381,
    },
    twist::{
        clear_cofactor_twist_bls12_381, g2_u64_le_to_bytes_be_bls12_381, scalar_mul_twist_bls12_381,
    },
};

// G1 map to curve result codes
#[allow(dead_code)]
const G1_MAP_TO_CURVE_SUCCESS: u8 = 0;
const G1_MAP_TO_CURVE_ERR_NOT_IN_FIELD: u8 = 1;

// G2 map to curve result codes
#[allow(dead_code)]
const G2_MAP_TO_CURVE_SUCCESS: u8 = 0;
const G2_MAP_TO_CURVE_ERR_NOT_IN_FIELD: u8 = 1;

/// Maps a field element to a point on the BLS12-381 G1 curve
pub fn map_to_curve_g1_bls12_381(
    u: &[u64; 6],
    #[cfg(feature = "hints")] hints: &mut Vec<u64>,
) -> Result<[u64; 12], u8> {
    // Verify input is in field
    if !lt(u, &P) {
        return Err(G1_MAP_TO_CURVE_ERR_NOT_IN_FIELD);
    }

    // Step 1: Map to isogenous curve E' using simplified SWU
    let p_prime = map_to_curve_simple_swu_g1_bls12_381(
        u,
        #[cfg(feature = "hints")]
        hints,
    );

    // Step 2: Apply isogeny map from E' to E
    let p = isogeny_map_g1_bls12_381(
        &p_prime,
        #[cfg(feature = "hints")]
        hints,
    );

    // Step 3: Clear cofactor
    Ok(scalar_mul_complete_bls12_381(
        &p,
        &COFACTOR_G1,
        #[cfg(feature = "hints")]
        hints,
    ))
}

/// Maps a field element in Fp2 to a point on the BLS12-381 G2 curve
pub fn map_to_curve_g2_bls12_381(
    u: &[u64; 12],
    #[cfg(feature = "hints")] hints: &mut Vec<u64>,
) -> Result<[u64; 24], u8> {
    let p = map_to_curve_g2_no_cofactor_bls12_381(
        u,
        #[cfg(feature = "hints")]
        hints,
    )?;

    // Clear cofactor
    Ok(clear_cofactor_twist_bls12_381(
        &p,
        #[cfg(feature = "hints")]
        hints,
    ))
}

/// Maps a field element in Fp2 to a point on the BLS12-381 G2 curve
/// without clearing the cofactor.
pub(super) fn map_to_curve_g2_no_cofactor_bls12_381(
    u: &[u64; 12],
    #[cfg(feature = "hints")] hints: &mut Vec<u64>,
) -> Result<[u64; 24], u8> {
    let u_0: [u64; 6] = u[0..6].try_into().unwrap();
    let u_1: [u64; 6] = u[6..12].try_into().unwrap();
    if !lt(&u_0, &P) || !lt(&u_1, &P) {
        return Err(G2_MAP_TO_CURVE_ERR_NOT_IN_FIELD);
    }

    // Map to isogenous curve E' using simplified SWU
    let p_prime = map_to_curve_simple_swu_g2_bls12_381(
        u,
        #[cfg(feature = "hints")]
        hints,
    );

    // Apply isogeny map from E' to E
    Ok(isogeny_map_g2_bls12_381(
        &p_prime,
        #[cfg(feature = "hints")]
        hints,
    ))
}

/// Maps a field element u ∈ Fp to a point on the isogenous curve E'
/// using the simplified Shallue-van de Woestijne-Ulas (SWU) method for AB != 0
fn map_to_curve_simple_swu_g1_bls12_381(
    u: &[u64; 6],
    #[cfg(feature = "hints")] hints: &mut Vec<u64>,
) -> [u64; 12] {
    // 1. tv1 = inv0(Z^2 * u^4 + Z * u^2)
    let u2 = square_fp_bls12_381(
        u,
        #[cfg(feature = "hints")]
        hints,
    );
    let u4 = square_fp_bls12_381(
        &u2,
        #[cfg(feature = "hints")]
        hints,
    );
    let z_u2 = mul_fp_bls12_381(
        &SWU_Z_G1,
        &u2,
        #[cfg(feature = "hints")]
        hints,
    );
    let z2_u4 = mul_fp_bls12_381(
        &SWU_Z2_G1,
        &u4,
        #[cfg(feature = "hints")]
        hints,
    );
    let tv1_denom = add_fp_bls12_381(
        &z2_u4,
        &z_u2,
        #[cfg(feature = "hints")]
        hints,
    );
    let tv1 = inv_fp_bls12_381(
        &tv1_denom,
        #[cfg(feature = "hints")]
        hints,
    );

    // 2. x1 = (-B / A) * (1 + tv1)
    let neg_b = neg_fp_bls12_381(
        &ISO_B_G1,
        #[cfg(feature = "hints")]
        hints,
    );
    let a_inv = inv_fp_bls12_381(
        &ISO_A_G1,
        #[cfg(feature = "hints")]
        hints,
    );
    let neg_b_over_a = mul_fp_bls12_381(
        &neg_b,
        &a_inv,
        #[cfg(feature = "hints")]
        hints,
    );
    let one = [1u64, 0, 0, 0, 0, 0];
    let one_plus_tv1 = add_fp_bls12_381(
        &one,
        &tv1,
        #[cfg(feature = "hints")]
        hints,
    );
    let mut x1 = mul_fp_bls12_381(
        &neg_b_over_a,
        &one_plus_tv1,
        #[cfg(feature = "hints")]
        hints,
    );

    // 3. If tv1 == 0, set x1 = B / (Z * A)
    if is_zero(&tv1) {
        let z_a = mul_fp_bls12_381(
            &SWU_Z_G1,
            &ISO_A_G1,
            #[cfg(feature = "hints")]
            hints,
        );
        let z_a_inv = inv_fp_bls12_381(
            &z_a,
            #[cfg(feature = "hints")]
            hints,
        );
        x1 = mul_fp_bls12_381(
            &ISO_B_G1,
            &z_a_inv,
            #[cfg(feature = "hints")]
            hints,
        );
    }

    // 4. gx1 = x1^3 + A * x1 + B
    let gx1 = compute_y2_iso_g1_bls12_381(
        &x1,
        #[cfg(feature = "hints")]
        hints,
    );

    // 5. x2 = Z * u^2 * x1 (computed lazily below if needed)

    // 6. gx2 = x2^3 + A * x2 + B  (computed lazily below if needed)

    // 7-8. Select x and y based on whether gx1 is square
    let (y1, gx1_is_qr) = sqrt_fp_bls12_381(
        &gx1,
        #[cfg(feature = "hints")]
        hints,
    );
    let (x, mut y) = if gx1_is_qr {
        (x1, y1)
    } else {
        let x2 = mul_fp_bls12_381(
            &z_u2,
            &x1,
            #[cfg(feature = "hints")]
            hints,
        );
        let gx2 = compute_y2_iso_g1_bls12_381(
            &x2,
            #[cfg(feature = "hints")]
            hints,
        );
        let (y2, _) = sqrt_fp_bls12_381(
            &gx2,
            #[cfg(feature = "hints")]
            hints,
        );
        (x2, y2)
    };

    // 9. If sgn0(u) != sgn0(y), set y = -y
    if sgn0_fp_bls12_381(u) != sgn0_fp_bls12_381(&y) {
        y = neg_fp_bls12_381(
            &y,
            #[cfg(feature = "hints")]
            hints,
        );
    }

    // Return point (x, y) on E'
    let mut point = [0u64; 12];
    point[0..6].copy_from_slice(&x);
    point[6..12].copy_from_slice(&y);
    point
}

/// Maps a field element u ∈ Fp2 to a point on the isogenous curve E'
/// using the simplified Shallue-van de Woestijne-Ulas (SWU) method for AB != 0
fn map_to_curve_simple_swu_g2_bls12_381(
    u: &[u64; 12],
    #[cfg(feature = "hints")] hints: &mut Vec<u64>,
) -> [u64; 24] {
    // 1. tv1 = inv0(Z^2 * u^4 + Z * u^2)
    let u2 = square_fp2_bls12_381(
        u,
        #[cfg(feature = "hints")]
        hints,
    );
    let u4 = square_fp2_bls12_381(
        &u2,
        #[cfg(feature = "hints")]
        hints,
    );
    let z_u2 = mul_fp2_bls12_381(
        &SWU_Z_G2,
        &u2,
        #[cfg(feature = "hints")]
        hints,
    );
    let z2 = square_fp2_bls12_381(
        &SWU_Z_G2,
        #[cfg(feature = "hints")]
        hints,
    );
    let z2_u4 = mul_fp2_bls12_381(
        &z2,
        &u4,
        #[cfg(feature = "hints")]
        hints,
    );
    let tv1_denom = add_fp2_bls12_381(
        &z2_u4,
        &z_u2,
        #[cfg(feature = "hints")]
        hints,
    );
    let tv1 = inv_fp2_bls12_381(
        &tv1_denom,
        #[cfg(feature = "hints")]
        hints,
    );

    // 2. x1 = (-B / A) * (1 + tv1)
    let neg_b = neg_fp2_bls12_381(
        &ISO_B_G2,
        #[cfg(feature = "hints")]
        hints,
    );
    let a_inv = inv_fp2_bls12_381(
        &ISO_A_G2,
        #[cfg(feature = "hints")]
        hints,
    );
    let neg_b_over_a = mul_fp2_bls12_381(
        &neg_b,
        &a_inv,
        #[cfg(feature = "hints")]
        hints,
    );
    let one: [u64; 12] = [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];
    let one_plus_tv1 = add_fp2_bls12_381(
        &one,
        &tv1,
        #[cfg(feature = "hints")]
        hints,
    );
    let mut x1 = mul_fp2_bls12_381(
        &neg_b_over_a,
        &one_plus_tv1,
        #[cfg(feature = "hints")]
        hints,
    );

    // 3. If tv1 == 0, set x1 = B / (Z * A)
    if is_zero(&tv1) {
        let z_a = mul_fp2_bls12_381(
            &SWU_Z_G2,
            &ISO_A_G2,
            #[cfg(feature = "hints")]
            hints,
        );
        let z_a_inv = inv_fp2_bls12_381(
            &z_a,
            #[cfg(feature = "hints")]
            hints,
        );
        x1 = mul_fp2_bls12_381(
            &ISO_B_G2,
            &z_a_inv,
            #[cfg(feature = "hints")]
            hints,
        );
    }

    // 4. gx1 = x1^3 + A * x1 + B
    let gx1 = compute_y2_iso_g2_bls12_381(
        &x1,
        #[cfg(feature = "hints")]
        hints,
    );

    // 7-8. Select x and y based on whether gx1 is square
    let (y1, gx1_is_qr) = sqrt_fp2_bls12_381(
        &gx1,
        #[cfg(feature = "hints")]
        hints,
    );
    let (x, mut y) = if gx1_is_qr {
        (x1, y1)
    } else {
        // 5. x2 = Z * u^2 * x1
        let x2 = mul_fp2_bls12_381(
            &z_u2,
            &x1,
            #[cfg(feature = "hints")]
            hints,
        );
        // 6. gx2 = x2^3 + A * x2 + B
        let gx2 = compute_y2_iso_g2_bls12_381(
            &x2,
            #[cfg(feature = "hints")]
            hints,
        );
        let (y2, _) = sqrt_fp2_bls12_381(
            &gx2,
            #[cfg(feature = "hints")]
            hints,
        );
        (x2, y2)
    };

    // 9. If sgn0(u) != sgn0(y), set y = -y
    if sgn0_fp2_bls12_381(u) != sgn0_fp2_bls12_381(&y) {
        y = neg_fp2_bls12_381(
            &y,
            #[cfg(feature = "hints")]
            hints,
        );
    }

    // Return point (x, y) on E'
    let mut point = [0u64; 24];
    point[0..12].copy_from_slice(&x);
    point[12..24].copy_from_slice(&y);
    point
}

/// Compute y² = x³ + A'x + B' for the isogenous curve E' (G1)
fn compute_y2_iso_g1_bls12_381(
    x: &[u64; 6],
    #[cfg(feature = "hints")] hints: &mut Vec<u64>,
) -> [u64; 6] {
    let x2 = square_fp_bls12_381(
        x,
        #[cfg(feature = "hints")]
        hints,
    );
    let x3 = mul_fp_bls12_381(
        &x2,
        x,
        #[cfg(feature = "hints")]
        hints,
    );
    let ax = mul_fp_bls12_381(
        &ISO_A_G1,
        x,
        #[cfg(feature = "hints")]
        hints,
    );
    let x3_ax = add_fp_bls12_381(
        &x3,
        &ax,
        #[cfg(feature = "hints")]
        hints,
    );
    add_fp_bls12_381(
        &x3_ax,
        &ISO_B_G1,
        #[cfg(feature = "hints")]
        hints,
    )
}

/// Compute y² = x³ + A'x + B' for the isogenous curve E' (G2)
fn compute_y2_iso_g2_bls12_381(
    x: &[u64; 12],
    #[cfg(feature = "hints")] hints: &mut Vec<u64>,
) -> [u64; 12] {
    let x2 = square_fp2_bls12_381(
        x,
        #[cfg(feature = "hints")]
        hints,
    );
    let x3 = mul_fp2_bls12_381(
        &x2,
        x,
        #[cfg(feature = "hints")]
        hints,
    );
    let ax = mul_fp2_bls12_381(
        &ISO_A_G2,
        x,
        #[cfg(feature = "hints")]
        hints,
    );
    let x3_ax = add_fp2_bls12_381(
        &x3,
        &ax,
        #[cfg(feature = "hints")]
        hints,
    );
    add_fp2_bls12_381(
        &x3_ax,
        &ISO_B_G2,
        #[cfg(feature = "hints")]
        hints,
    )
}

/// Apply the 11-isogeny map from E' to E for G1
fn isogeny_map_g1_bls12_381(
    p: &[u64; 12],
    #[cfg(feature = "hints")] hints: &mut Vec<u64>,
) -> [u64; 12] {
    let x: [u64; 6] = p[0..6].try_into().unwrap();
    let y: [u64; 6] = p[6..12].try_into().unwrap();

    // Compute x-coordinate: x_num / x_den
    let x_num = eval_poly_fp(
        &ISO_X_NUM_G1,
        &x,
        #[cfg(feature = "hints")]
        hints,
    );
    let x_den = eval_poly_fp(
        &ISO_X_DEN_G1,
        &x,
        #[cfg(feature = "hints")]
        hints,
    );
    let x_den_inv = inv_fp_bls12_381(
        &x_den,
        #[cfg(feature = "hints")]
        hints,
    );
    let x_out = mul_fp_bls12_381(
        &x_num,
        &x_den_inv,
        #[cfg(feature = "hints")]
        hints,
    );

    // Compute y-coordinate: y' * y_num / y_den
    let y_num = eval_poly_fp(
        &ISO_Y_NUM_G1,
        &x,
        #[cfg(feature = "hints")]
        hints,
    );
    let y_den = eval_poly_fp(
        &ISO_Y_DEN_G1,
        &x,
        #[cfg(feature = "hints")]
        hints,
    );
    let y_den_inv = inv_fp_bls12_381(
        &y_den,
        #[cfg(feature = "hints")]
        hints,
    );
    let y_frac = mul_fp_bls12_381(
        &y_num,
        &y_den_inv,
        #[cfg(feature = "hints")]
        hints,
    );
    let y_out = mul_fp_bls12_381(
        &y,
        &y_frac,
        #[cfg(feature = "hints")]
        hints,
    );

    let mut result = [0u64; 12];
    result[0..6].copy_from_slice(&x_out);
    result[6..12].copy_from_slice(&y_out);
    result
}

/// Apply the 3-isogeny map from E' to E for G2
fn isogeny_map_g2_bls12_381(
    p: &[u64; 24],
    #[cfg(feature = "hints")] hints: &mut Vec<u64>,
) -> [u64; 24] {
    let x: [u64; 12] = p[0..12].try_into().unwrap();
    let y: [u64; 12] = p[12..24].try_into().unwrap();

    // Compute x-coordinate: x_num / x_den
    let x_num = eval_poly_fp2(
        &ISO_X_NUM_G2,
        &x,
        #[cfg(feature = "hints")]
        hints,
    );
    let x_den = eval_poly_fp2(
        &ISO_X_DEN_G2,
        &x,
        #[cfg(feature = "hints")]
        hints,
    );
    let x_den_inv = inv_fp2_bls12_381(
        &x_den,
        #[cfg(feature = "hints")]
        hints,
    );
    let x_out = mul_fp2_bls12_381(
        &x_num,
        &x_den_inv,
        #[cfg(feature = "hints")]
        hints,
    );

    // Compute y-coordinate: y' * y_num / y_den
    let y_num = eval_poly_fp2(
        &ISO_Y_NUM_G2,
        &x,
        #[cfg(feature = "hints")]
        hints,
    );
    let y_den = eval_poly_fp2(
        &ISO_Y_DEN_G2,
        &x,
        #[cfg(feature = "hints")]
        hints,
    );
    let y_den_inv = inv_fp2_bls12_381(
        &y_den,
        #[cfg(feature = "hints")]
        hints,
    );
    let y_frac = mul_fp2_bls12_381(
        &y_num,
        &y_den_inv,
        #[cfg(feature = "hints")]
        hints,
    );
    let y_out = mul_fp2_bls12_381(
        &y,
        &y_frac,
        #[cfg(feature = "hints")]
        hints,
    );

    let mut result = [0u64; 24];
    result[0..12].copy_from_slice(&x_out);
    result[12..24].copy_from_slice(&y_out);
    result
}

/// Evaluate a polynomial at x
fn eval_poly_fp<const N: usize>(
    coeffs: &[[u64; 6]; N],
    x: &[u64; 6],
    #[cfg(feature = "hints")] hints: &mut Vec<u64>,
) -> [u64; 6] {
    // Use Horner's method
    let mut result = coeffs[N - 1];
    for i in (0..N - 1).rev() {
        result = mul_fp_bls12_381(
            &result,
            x,
            #[cfg(feature = "hints")]
            hints,
        );
        result = add_fp_bls12_381(
            &result,
            &coeffs[i],
            #[cfg(feature = "hints")]
            hints,
        );
    }
    result
}

/// Evaluate a polynomial at x over Fp2
fn eval_poly_fp2<const N: usize>(
    coeffs: &[[u64; 12]; N],
    x: &[u64; 12],
    #[cfg(feature = "hints")] hints: &mut Vec<u64>,
) -> [u64; 12] {
    // Use Horner's method
    let mut result = coeffs[N - 1];
    for i in (0..N - 1).rev() {
        result = mul_fp2_bls12_381(
            &result,
            x,
            #[cfg(feature = "hints")]
            hints,
        );
        result = add_fp2_bls12_381(
            &result,
            &coeffs[i],
            #[cfg(feature = "hints")]
            hints,
        );
    }
    result
}

// ==================== C FFI Functions ====================

/// BLS12-381 map Fp field element to G1 point
///
/// Input format: 48 bytes field element (big-endian)
/// Output format: 96 bytes G1 point (x || y big-endian)
///
/// ### Safety
/// - `fp` must point to a valid `[u8; 48]`
/// - `ret` must point to a valid `[u8; 96]` for the output
///
/// Map-to-curve result codes
#[allow(dead_code)]
pub(crate) const FP_TO_G1_SUCCESS: u8 = 0;
#[allow(dead_code)]
pub(crate) const FP2_TO_G2_SUCCESS: u8 = 0;

/// Returns:
/// - 0 = success
/// - 1 = error (input not in field)
#[allow(dead_code)]
#[inline]
pub(crate) unsafe fn bls12_381_fp_to_g1_c(
    ret: *mut u8,
    fp: *const u8,
    #[cfg(feature = "hints")] hints: &mut Vec<u64>,
) -> u8 {
    let fp_bytes: &[u8; 48] = &*(fp as *const [u8; 48]);
    let ret_bytes: &mut [u8; 96] = &mut *(ret as *mut [u8; 96]);

    // Parse field element
    let u = bytes_be_to_u64_le_fp_bls12_381(fp_bytes);

    // Map to curve
    let result = match map_to_curve_g1_bls12_381(
        &u,
        #[cfg(feature = "hints")]
        hints,
    ) {
        Ok(p) => p,
        Err(code) => return code,
    };

    // Encode result
    g1_u64_le_to_bytes_be_bls12_381(&result, ret_bytes);
    G1_MAP_TO_CURVE_SUCCESS
}

/// BLS12-381 map Fp2 field element to G2 point
///
/// Input format: 96 bytes Fp2 element (c0 || c1, each 48 bytes big-endian)
/// Output format: 192 bytes G2 point (x_r || x_i || y_r || y_i, each 48 bytes big-endian)
///
/// ### Safety
/// - `fp2` must point to a valid `[u8; 96]`
/// - `ret` must point to a valid `[u8; 192]` for the output
///
/// Returns:
/// - 0 = success
/// - 1 = error (input not in field)
#[allow(dead_code)]
#[inline]
pub(crate) unsafe fn bls12_381_fp2_to_g2_c(
    ret: *mut u8,
    fp2: *const u8,
    #[cfg(feature = "hints")] hints: &mut Vec<u64>,
) -> u8 {
    let fp2_bytes: &[u8; 96] = &*(fp2 as *const [u8; 96]);
    let ret_bytes: &mut [u8; 192] = &mut *(ret as *mut [u8; 192]);

    // Parse Fp2 element
    let u = bytes_be_to_u64_le_fp2_bls12_381(fp2_bytes);

    // Map to curve
    let result = match map_to_curve_g2_bls12_381(
        &u,
        #[cfg(feature = "hints")]
        hints,
    ) {
        Ok(p) => p,
        Err(code) => return code,
    };

    // Encode result
    g2_u64_le_to_bytes_be_bls12_381(&result, ret_bytes);
    G2_MAP_TO_CURVE_SUCCESS
}