From 9c36ca4f3dae27a68cc741a9f6f1385057726a21 Mon Sep 17 00:00:00 2001
From: Dankrad Feist <mail@dankradfeist.de>
Date: Sat, 17 Sep 2022 16:22:06 +0100
Subject: [PATCH] WIP: Montgomery batch inversion

---
 src/utility.c | 50 ++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 50 insertions(+)

diff --git a/src/utility.c b/src/utility.c
index 916871a..5d67a35 100644
--- a/src/utility.c
+++ b/src/utility.c
@@ -23,6 +23,7 @@
 #include <string.h> // memcpy()
 #include "control.h"
 #include "utility.h"
+#include "c_kzg_alloc.h"
 
 /**
  * Utility function to test whether the argument is a power of two.
@@ -154,6 +155,37 @@ C_KZG_RET reverse_bit_order(void *values, size_t size, uint64_t n) {
     return C_KZG_OK;
 }
 
+/**
+ * Montgomery batch inversion in finite field
+ *
+ * @param[out] out The inverses of @p a, length @p len
+ * @param[in]  a   A vector of field elements, length @p len
+ * @param[in]  len Length
+ */
+C_KZG_RET fr_batch_inv(fr_t **out, const fr_t *a, size_t len) {
+    fr_t *prod;
+    fr_t inv;
+    size_t i;
+
+    TRY(new_fr_array(out, len));
+    TRY(new_fr_array(&prod, len));
+
+    prod[0] = a[0];
+
+    for(i = 1; i < len; i++) {
+        fr_mul(&prod[i], &a[i], &prod[i - 1]);
+    }
+
+    blst_fr_eucl_inverse(&inv, &prod[len - 1]);
+
+    for(i = len - 1; i > 0; i--) {
+        fr_mul(out[i], &inv, &prod[i - 1]);
+        fr_mul(&inv, &a[i], &inv);
+    }
+
+    return C_KZG_OK;
+}
+
 #ifdef KZGTEST
 
 #include "../inc/acutest.h"
@@ -185,6 +217,23 @@ void is_power_of_two_works(void) {
     TEST_CHECK(false == is_power_of_two(1234567));
 }
 
+void test_batch_inv(void) {
+    fr_t **inputs;
+    fr_t **actual, **expected;
+
+    TEST_CHECK(C_KZG_OK == new_fr_array(inputs, 32));
+    TEST_CHECK(C_KZG_OK == new_fr_array(expected, 32));
+
+    for (int i = 0; i < 32; i++) {
+        *inputs[i] = rand_fr();
+        fr_inv(expected[i], inputs[i]);
+    }
+    fr_batch_inv(actual, *inputs, 32);
+    for (int i = 0; i < 32; i++) {
+        TEST_CHECK(expected[i] == actual[i]);
+    }
+}
+
 void test_log2_pow2(void) {
     int actual, expected;
     for (int i = 0; i < 32; i++) {
@@ -309,6 +358,7 @@ void test_reverse_bit_order_fr_large(void) {
 
 TEST_LIST = {
     {"UTILITY_TEST", title},
+    {"test_batch_inv", test_batch_inv},
     {"is_power_of_two_works", is_power_of_two_works},
     {"test_log2_pow2", test_log2_pow2},
     {"test_next_power_of_two_powers", test_next_power_of_two_powers},