fptest_fibonacci.cu

Go to the documentation of this file.

// bls12_381: Arithmetic for BLS12-381
// Copyright 2022-2023 Dag Arne Osvik
// Copyright 2022-2023 Luan Cardoso dos Santos
 
#include "fp.cuh"
#include "fptest.cuh"
 
#define ITERATIONS 100000
 
__global__ void FpTestFibonacci(testval_t *) {
 
    printf("=== RUN   %s\n", __func__);
 
    bool    pass    = true;
    size_t  count   = 0;
 
    fp_t x, y, t, u;
 
    fp_one(x);
    fp_one(y);
 
    for (int i=0; i<ITERATIONS; i++) {
 
        fp_cpy(t, x);
        fp_add(x, x, y);
 
        fp_cpy(u, x);
        fp_sub(u, u, t);
 
        if (fp_neq(u, y)) {
            fp_print("x =",  x);
            fp_print("y =",  y);
            fp_print("x+y =",  t);
            fp_print("x+y-x =",  u);
            pass = false;
            break;
        }
 
        ++count;
 
        fp_cpy(t, y);
        fp_add(y, y, x);
 
        fp_cpy(u, y);
        fp_sub(u, u, t);
 
        if (fp_neq(u, x)) {
            fp_print("x =",  x);
            fp_print("y =",  y);
            fp_print("x+y =",  t);
            fp_print("x+y-y =",  u);
            pass = false;
            break;
        }
 
        ++count;
    }
 
    for (int i=0; i<ITERATIONS; i++) {
        fp_sub(y, y, x);
        fp_sub(x, x, y);
    }
 
    if (!fp_isone(x) || !fp_isone(y)) {
        printf("Reverse iteration failed\n");
        fp_print("x =",  x);
        fp_print("y =",  y);
        pass = false;
    }
    else
        ++count;
 
    printf("%ld tests passed\n", count);
 
    PRINTPASS(pass);
}
 
// vim: ts=4 et sw=4 si