Initial commit
This commit is contained in:
Ben Edgington
commit
32340d46a1
|
|
@ -0,0 +1,7 @@
|
||||||
|
*.o
|
||||||
|
*.a
|
||||||
|
*_test
|
||||||
|
a.out
|
||||||
|
tmp/
|
||||||
|
inc/blst.h
|
||||||
|
inc/blst_aux.h
|
||||||
|
|
@ -0,0 +1,201 @@
|
||||||
|
Apache License
|
||||||
|
Version 2.0, January 2004
|
||||||
|
http://www.apache.org/licenses/
|
||||||
|
|
||||||
|
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
|
||||||
|
|
||||||
|
1. Definitions.
|
||||||
|
|
||||||
|
"License" shall mean the terms and conditions for use, reproduction,
|
||||||
|
and distribution as defined by Sections 1 through 9 of this document.
|
||||||
|
|
||||||
|
"Licensor" shall mean the copyright owner or entity authorized by
|
||||||
|
the copyright owner that is granting the License.
|
||||||
|
|
||||||
|
"Legal Entity" shall mean the union of the acting entity and all
|
||||||
|
other entities that control, are controlled by, or are under common
|
||||||
|
control with that entity. For the purposes of this definition,
|
||||||
|
"control" means (i) the power, direct or indirect, to cause the
|
||||||
|
direction or management of such entity, whether by contract or
|
||||||
|
otherwise, or (ii) ownership of fifty percent (50%) or more of the
|
||||||
|
outstanding shares, or (iii) beneficial ownership of such entity.
|
||||||
|
|
||||||
|
"You" (or "Your") shall mean an individual or Legal Entity
|
||||||
|
exercising permissions granted by this License.
|
||||||
|
|
||||||
|
"Source" form shall mean the preferred form for making modifications,
|
||||||
|
including but not limited to software source code, documentation
|
||||||
|
source, and configuration files.
|
||||||
|
|
||||||
|
"Object" form shall mean any form resulting from mechanical
|
||||||
|
transformation or translation of a Source form, including but
|
||||||
|
not limited to compiled object code, generated documentation,
|
||||||
|
and conversions to other media types.
|
||||||
|
|
||||||
|
"Work" shall mean the work of authorship, whether in Source or
|
||||||
|
Object form, made available under the License, as indicated by a
|
||||||
|
copyright notice that is included in or attached to the work
|
||||||
|
(an example is provided in the Appendix below).
|
||||||
|
|
||||||
|
"Derivative Works" shall mean any work, whether in Source or Object
|
||||||
|
form, that is based on (or derived from) the Work and for which the
|
||||||
|
editorial revisions, annotations, elaborations, or other modifications
|
||||||
|
represent, as a whole, an original work of authorship. For the purposes
|
||||||
|
of this License, Derivative Works shall not include works that remain
|
||||||
|
separable from, or merely link (or bind by name) to the interfaces of,
|
||||||
|
the Work and Derivative Works thereof.
|
||||||
|
|
||||||
|
"Contribution" shall mean any work of authorship, including
|
||||||
|
the original version of the Work and any modifications or additions
|
||||||
|
to that Work or Derivative Works thereof, that is intentionally
|
||||||
|
submitted to Licensor for inclusion in the Work by the copyright owner
|
||||||
|
or by an individual or Legal Entity authorized to submit on behalf of
|
||||||
|
the copyright owner. For the purposes of this definition, "submitted"
|
||||||
|
means any form of electronic, verbal, or written communication sent
|
||||||
|
to the Licensor or its representatives, including but not limited to
|
||||||
|
communication on electronic mailing lists, source code control systems,
|
||||||
|
and issue tracking systems that are managed by, or on behalf of, the
|
||||||
|
Licensor for the purpose of discussing and improving the Work, but
|
||||||
|
excluding communication that is conspicuously marked or otherwise
|
||||||
|
designated in writing by the copyright owner as "Not a Contribution."
|
||||||
|
|
||||||
|
"Contributor" shall mean Licensor and any individual or Legal Entity
|
||||||
|
on behalf of whom a Contribution has been received by Licensor and
|
||||||
|
subsequently incorporated within the Work.
|
||||||
|
|
||||||
|
2. Grant of Copyright License. Subject to the terms and conditions of
|
||||||
|
this License, each Contributor hereby grants to You a perpetual,
|
||||||
|
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
||||||
|
copyright license to reproduce, prepare Derivative Works of,
|
||||||
|
publicly display, publicly perform, sublicense, and distribute the
|
||||||
|
Work and such Derivative Works in Source or Object form.
|
||||||
|
|
||||||
|
3. Grant of Patent License. Subject to the terms and conditions of
|
||||||
|
this License, each Contributor hereby grants to You a perpetual,
|
||||||
|
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
||||||
|
(except as stated in this section) patent license to make, have made,
|
||||||
|
use, offer to sell, sell, import, and otherwise transfer the Work,
|
||||||
|
where such license applies only to those patent claims licensable
|
||||||
|
by such Contributor that are necessarily infringed by their
|
||||||
|
Contribution(s) alone or by combination of their Contribution(s)
|
||||||
|
with the Work to which such Contribution(s) was submitted. If You
|
||||||
|
institute patent litigation against any entity (including a
|
||||||
|
cross-claim or counterclaim in a lawsuit) alleging that the Work
|
||||||
|
or a Contribution incorporated within the Work constitutes direct
|
||||||
|
or contributory patent infringement, then any patent licenses
|
||||||
|
granted to You under this License for that Work shall terminate
|
||||||
|
as of the date such litigation is filed.
|
||||||
|
|
||||||
|
4. Redistribution. You may reproduce and distribute copies of the
|
||||||
|
Work or Derivative Works thereof in any medium, with or without
|
||||||
|
modifications, and in Source or Object form, provided that You
|
||||||
|
meet the following conditions:
|
||||||
|
|
||||||
|
(a) You must give any other recipients of the Work or
|
||||||
|
Derivative Works a copy of this License; and
|
||||||
|
|
||||||
|
(b) You must cause any modified files to carry prominent notices
|
||||||
|
stating that You changed the files; and
|
||||||
|
|
||||||
|
(c) You must retain, in the Source form of any Derivative Works
|
||||||
|
that You distribute, all copyright, patent, trademark, and
|
||||||
|
attribution notices from the Source form of the Work,
|
||||||
|
excluding those notices that do not pertain to any part of
|
||||||
|
the Derivative Works; and
|
||||||
|
|
||||||
|
(d) If the Work includes a "NOTICE" text file as part of its
|
||||||
|
distribution, then any Derivative Works that You distribute must
|
||||||
|
include a readable copy of the attribution notices contained
|
||||||
|
within such NOTICE file, excluding those notices that do not
|
||||||
|
pertain to any part of the Derivative Works, in at least one
|
||||||
|
of the following places: within a NOTICE text file distributed
|
||||||
|
as part of the Derivative Works; within the Source form or
|
||||||
|
documentation, if provided along with the Derivative Works; or,
|
||||||
|
within a display generated by the Derivative Works, if and
|
||||||
|
wherever such third-party notices normally appear. The contents
|
||||||
|
of the NOTICE file are for informational purposes only and
|
||||||
|
do not modify the License. You may add Your own attribution
|
||||||
|
notices within Derivative Works that You distribute, alongside
|
||||||
|
or as an addendum to the NOTICE text from the Work, provided
|
||||||
|
that such additional attribution notices cannot be construed
|
||||||
|
as modifying the License.
|
||||||
|
|
||||||
|
You may add Your own copyright statement to Your modifications and
|
||||||
|
may provide additional or different license terms and conditions
|
||||||
|
for use, reproduction, or distribution of Your modifications, or
|
||||||
|
for any such Derivative Works as a whole, provided Your use,
|
||||||
|
reproduction, and distribution of the Work otherwise complies with
|
||||||
|
the conditions stated in this License.
|
||||||
|
|
||||||
|
5. Submission of Contributions. Unless You explicitly state otherwise,
|
||||||
|
any Contribution intentionally submitted for inclusion in the Work
|
||||||
|
by You to the Licensor shall be under the terms and conditions of
|
||||||
|
this License, without any additional terms or conditions.
|
||||||
|
Notwithstanding the above, nothing herein shall supersede or modify
|
||||||
|
the terms of any separate license agreement you may have executed
|
||||||
|
with Licensor regarding such Contributions.
|
||||||
|
|
||||||
|
6. Trademarks. This License does not grant permission to use the trade
|
||||||
|
names, trademarks, service marks, or product names of the Licensor,
|
||||||
|
except as required for reasonable and customary use in describing the
|
||||||
|
origin of the Work and reproducing the content of the NOTICE file.
|
||||||
|
|
||||||
|
7. Disclaimer of Warranty. Unless required by applicable law or
|
||||||
|
agreed to in writing, Licensor provides the Work (and each
|
||||||
|
Contributor provides its Contributions) on an "AS IS" BASIS,
|
||||||
|
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
|
||||||
|
implied, including, without limitation, any warranties or conditions
|
||||||
|
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
|
||||||
|
PARTICULAR PURPOSE. You are solely responsible for determining the
|
||||||
|
appropriateness of using or redistributing the Work and assume any
|
||||||
|
risks associated with Your exercise of permissions under this License.
|
||||||
|
|
||||||
|
8. Limitation of Liability. In no event and under no legal theory,
|
||||||
|
whether in tort (including negligence), contract, or otherwise,
|
||||||
|
unless required by applicable law (such as deliberate and grossly
|
||||||
|
negligent acts) or agreed to in writing, shall any Contributor be
|
||||||
|
liable to You for damages, including any direct, indirect, special,
|
||||||
|
incidental, or consequential damages of any character arising as a
|
||||||
|
result of this License or out of the use or inability to use the
|
||||||
|
Work (including but not limited to damages for loss of goodwill,
|
||||||
|
work stoppage, computer failure or malfunction, or any and all
|
||||||
|
other commercial damages or losses), even if such Contributor
|
||||||
|
has been advised of the possibility of such damages.
|
||||||
|
|
||||||
|
9. Accepting Warranty or Additional Liability. While redistributing
|
||||||
|
the Work or Derivative Works thereof, You may choose to offer,
|
||||||
|
and charge a fee for, acceptance of support, warranty, indemnity,
|
||||||
|
or other liability obligations and/or rights consistent with this
|
||||||
|
License. However, in accepting such obligations, You may act only
|
||||||
|
on Your own behalf and on Your sole responsibility, not on behalf
|
||||||
|
of any other Contributor, and only if You agree to indemnify,
|
||||||
|
defend, and hold each Contributor harmless for any liability
|
||||||
|
incurred by, or claims asserted against, such Contributor by reason
|
||||||
|
of your accepting any such warranty or additional liability.
|
||||||
|
|
||||||
|
END OF TERMS AND CONDITIONS
|
||||||
|
|
||||||
|
APPENDIX: How to apply the Apache License to your work.
|
||||||
|
|
||||||
|
To apply the Apache License to your work, attach the following
|
||||||
|
boilerplate notice, with the fields enclosed by brackets "[]"
|
||||||
|
replaced with your own identifying information. (Don't include
|
||||||
|
the brackets!) The text should be enclosed in the appropriate
|
||||||
|
comment syntax for the file format. We also recommend that a
|
||||||
|
file or class name and description of purpose be included on the
|
||||||
|
same "printed page" as the copyright notice for easier
|
||||||
|
identification within third-party archives.
|
||||||
|
|
||||||
|
Copyright [yyyy] [name of copyright owner]
|
||||||
|
|
||||||
|
Licensed under the Apache License, Version 2.0 (the "License");
|
||||||
|
you may not use this file except in compliance with the License.
|
||||||
|
You may obtain a copy of the License at
|
||||||
|
|
||||||
|
http://www.apache.org/licenses/LICENSE-2.0
|
||||||
|
|
||||||
|
Unless required by applicable law or agreed to in writing, software
|
||||||
|
distributed under the License is distributed on an "AS IS" BASIS,
|
||||||
|
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||||
|
See the License for the specific language governing permissions and
|
||||||
|
limitations under the License.
|
||||||
|
|
@ -0,0 +1,16 @@
|
||||||
|
tests = fft_fr_test
|
||||||
|
|
||||||
|
fft_fr.o: fft_fr.c fft_fr.h c-kzg.h
|
||||||
|
clang -Wall -c fft_fr.c
|
||||||
|
|
||||||
|
%_test: %.o %_test.c
|
||||||
|
@clang -Wall -o $@ $@.c $*.o -Llib -lblst
|
||||||
|
@./$@
|
||||||
|
|
||||||
|
test: $(tests)
|
||||||
|
@rm -f $(tests)
|
||||||
|
|
||||||
|
clean:
|
||||||
|
rm -f *.o
|
||||||
|
rm -f $(tests)
|
||||||
|
rm -f a.out
|
||||||
|
|
@ -0,0 +1,33 @@
|
||||||
|
# c-kzg
|
||||||
|
|
||||||
|
The very beginnings of a simple implementation of [KZG commitments](https://dankradfeist.de/ethereum/2020/06/16/kate-polynomial-commitments.html) in C, using the [Blst library](https://github.com/supranational/blst) from Supranational for field and curve operations.
|
||||||
|
|
||||||
|
Initially, at least, this largely follows the [go-kzg](https://github.com/protolambda/go-kzg) implementation.
|
||||||
|
|
||||||
|
Done so far:
|
||||||
|
- Rough and ready FFT and inverse FFT over the finite field.
|
||||||
|
|
||||||
|
## Installation
|
||||||
|
|
||||||
|
Build the [Blst library](https://github.com/supranational/blst) following the instructions there. Then,
|
||||||
|
|
||||||
|
1. Copy the resulting `libblst.a` file into the `lib/` directory here.
|
||||||
|
2. From Blst's `bindings/` directory copy `blst.h` and `blst_aux.h` to `inc/`
|
||||||
|
|
||||||
|
That is,
|
||||||
|
|
||||||
|
```
|
||||||
|
mkdir lib
|
||||||
|
cp ../blst/libblast.a lib/
|
||||||
|
cp ../blst/bindings/*.h inc/
|
||||||
|
```
|
||||||
|
|
||||||
|
There's no library to make here yet, but you can run the tests.
|
||||||
|
|
||||||
|
## Run tests
|
||||||
|
|
||||||
|
```
|
||||||
|
make test
|
||||||
|
```
|
||||||
|
|
||||||
|
Thanks to [Acutest](https://github.com/mity/acutest) for the unit test harness, which is used here under the MIT licence.
|
||||||
|
|
@ -0,0 +1,18 @@
|
||||||
|
/*
|
||||||
|
* Copyright 2021 Benjamin Edgington
|
||||||
|
*
|
||||||
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||||
|
* you may not use this file except in compliance with the License.
|
||||||
|
* You may obtain a copy of the License at
|
||||||
|
*
|
||||||
|
* http://www.apache.org/licenses/LICENSE-2.0
|
||||||
|
*
|
||||||
|
* Unless required by applicable law or agreed to in writing, software
|
||||||
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||||
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||||
|
* See the License for the specific language governing permissions and
|
||||||
|
* limitations under the License.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include "inc/blst.h"
|
||||||
|
#include <stdbool.h>
|
||||||
|
|
@ -0,0 +1,152 @@
|
||||||
|
/*
|
||||||
|
* Copyright 2021 Benjamin Edgington
|
||||||
|
*
|
||||||
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||||
|
* you may not use this file except in compliance with the License.
|
||||||
|
* You may obtain a copy of the License at
|
||||||
|
*
|
||||||
|
* http://www.apache.org/licenses/LICENSE-2.0
|
||||||
|
*
|
||||||
|
* Unless required by applicable law or agreed to in writing, software
|
||||||
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||||
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||||
|
* See the License for the specific language governing permissions and
|
||||||
|
* limitations under the License.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include "fft_fr.h"
|
||||||
|
|
||||||
|
void print_bytes_as_hex_le(byte *bytes, int start, int len) {
|
||||||
|
for (int i = start + len - 1; i >= start; i--) {
|
||||||
|
printf("%02x", bytes[i]);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void print_fr(const blst_fr *a) {
|
||||||
|
blst_scalar b;
|
||||||
|
blst_scalar_from_fr(&b, a);
|
||||||
|
print_bytes_as_hex_le(b.b, 0, 32);
|
||||||
|
}
|
||||||
|
|
||||||
|
bool is_one(const blst_fr *fr_p) {
|
||||||
|
uint64_t a[4];
|
||||||
|
blst_uint64_from_fr(a, fr_p);
|
||||||
|
return a[0] == 1 && a[1] == 0 && a[2] == 0 && a[3] == 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
bool is_power_of_two(uint64_t n) {
|
||||||
|
return (n & (n - 1)) == 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
bool fr_equal(blst_fr *aa, blst_fr *bb) {
|
||||||
|
uint64_t a[4], b[4];
|
||||||
|
blst_uint64_from_fr(a, aa);
|
||||||
|
blst_uint64_from_fr(b, bb);
|
||||||
|
return a[0] == b[0] && a[1] == b[1] && a[2] == b[2] && a[3] == b[3];
|
||||||
|
}
|
||||||
|
|
||||||
|
void fr_from_uint64(blst_fr *a, uint64_t n) {
|
||||||
|
uint64_t vals[] = {n, 0, 0, 0};
|
||||||
|
blst_fr_from_uint64(a, vals);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Returns an array of powers of the root of unity
|
||||||
|
// Allocates space for the array that needs to be freed later
|
||||||
|
blst_fr *expand_root_of_unity(blst_fr *root_of_unity, uint64_t width) {
|
||||||
|
blst_fr *roots = malloc((width + 1) * sizeof(blst_fr));
|
||||||
|
roots[0] = one;
|
||||||
|
roots[1] = *root_of_unity;
|
||||||
|
|
||||||
|
for (int i = 2; !is_one(&roots[i - 1]); i++) {
|
||||||
|
assert(i <= width);
|
||||||
|
blst_fr_mul(&roots[i], &roots[i - 1], root_of_unity);
|
||||||
|
}
|
||||||
|
assert(is_one(&roots[width]));
|
||||||
|
|
||||||
|
return roots;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Return a reversed copy of the list of Fr provided
|
||||||
|
// `width` is one less than the length of `r`
|
||||||
|
// Allocates space for the array that needs to be freed later
|
||||||
|
blst_fr *reverse(blst_fr *r, uint64_t width) {
|
||||||
|
blst_fr *rr = malloc((width + 1) * sizeof(blst_fr));
|
||||||
|
for (int i = 0; i <= width; i++) {
|
||||||
|
rr[i] = r[width - i];
|
||||||
|
}
|
||||||
|
return rr;
|
||||||
|
}
|
||||||
|
|
||||||
|
FFTSettings new_fft_settings(unsigned int max_scale) {
|
||||||
|
FFTSettings s;
|
||||||
|
s.max_width = (uint64_t)1 << max_scale;
|
||||||
|
blst_fr_from_uint64(&s.root_of_unity, scale2_root_of_unity[max_scale]);
|
||||||
|
s.expanded_roots_of_unity = expand_root_of_unity(&s.root_of_unity, s.max_width);
|
||||||
|
s.reverse_roots_of_unity = reverse(s.expanded_roots_of_unity, s.max_width);
|
||||||
|
return s;
|
||||||
|
}
|
||||||
|
|
||||||
|
void free_fft_settings(FFTSettings *s) {
|
||||||
|
free(s->expanded_roots_of_unity);
|
||||||
|
free(s->reverse_roots_of_unity);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Slow Fourier Transform (simple, good for small sizes)
|
||||||
|
void slow_ft(blst_fr *out, blst_fr *in, uint64_t offset, uint64_t stride, blst_fr *roots, uint64_t roots_stride, uint64_t l) {
|
||||||
|
blst_fr v, last, tmp;
|
||||||
|
for (uint64_t i = 0; i < l; i++) {
|
||||||
|
blst_fr jv = in[offset];
|
||||||
|
blst_fr r = roots[0];
|
||||||
|
blst_fr_mul(&v, &jv, &r);
|
||||||
|
last = v;
|
||||||
|
for (uint64_t j = 1; j < l; j++) {
|
||||||
|
jv = in[offset + j * stride];
|
||||||
|
r = roots[((i * j) % l) * roots_stride];
|
||||||
|
blst_fr_mul(&v, &jv, &r);
|
||||||
|
tmp = last;
|
||||||
|
blst_fr_add(&last, &tmp, &v);
|
||||||
|
}
|
||||||
|
out[i] = last;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Fast Fourier Transform
|
||||||
|
void fast_ft(blst_fr *out, blst_fr *in, uint64_t offset, uint64_t stride, blst_fr *roots, uint64_t roots_stride, uint64_t l) {
|
||||||
|
uint64_t half = l / 2;
|
||||||
|
fft_helper(out, in, offset, stride * 2, roots, roots_stride * 2, l / 2);
|
||||||
|
fft_helper(out + half, in, offset + stride, stride * 2, roots, roots_stride * 2, l / 2);
|
||||||
|
for (uint64_t i = 0; i < half; i++) {
|
||||||
|
blst_fr y_times_root;
|
||||||
|
blst_fr x = out[i];
|
||||||
|
blst_fr_mul(&y_times_root, &out[i + half], &roots[i * roots_stride]);
|
||||||
|
blst_fr_add(&out[i], &x, &y_times_root);
|
||||||
|
blst_fr_sub(&out[i + half], &x, &y_times_root);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void fft_helper(blst_fr *out, blst_fr *in, uint64_t offset, uint64_t stride, blst_fr *roots, uint64_t roots_stride, uint64_t l) {
|
||||||
|
// TODO: Tunable parameter
|
||||||
|
if (l <= 4) {
|
||||||
|
slow_ft(out, in, offset, stride, roots, roots_stride, l);
|
||||||
|
} else {
|
||||||
|
fast_ft(out, in, offset, stride, roots, roots_stride, l);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// The main entry point for forward and reverse FFTs
|
||||||
|
void fft (blst_fr *out, blst_fr *in, FFTSettings *fs, bool inv, uint64_t n) {
|
||||||
|
uint64_t stride = fs->max_width / n;
|
||||||
|
assert(n <= fs->max_width);
|
||||||
|
assert(is_power_of_two(n));
|
||||||
|
if (inv) {
|
||||||
|
blst_fr inv_len;
|
||||||
|
fr_from_uint64(&inv_len, n);
|
||||||
|
blst_fr_eucl_inverse(&inv_len, &inv_len);
|
||||||
|
fft_helper(out, in, 0, 1, fs->reverse_roots_of_unity, stride, fs->max_width);
|
||||||
|
for (uint64_t i = 0; i < fs->max_width; i++) {
|
||||||
|
blst_fr_mul(&out[i], &out[i], &inv_len);
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
fft_helper(out, in, 0, 1, fs->expanded_roots_of_unity, stride, fs->max_width);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
@ -0,0 +1,87 @@
|
||||||
|
/*
|
||||||
|
* Copyright 2021 Benjamin Edgington
|
||||||
|
*
|
||||||
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||||
|
* you may not use this file except in compliance with the License.
|
||||||
|
* You may obtain a copy of the License at
|
||||||
|
*
|
||||||
|
* http://www.apache.org/licenses/LICENSE-2.0
|
||||||
|
*
|
||||||
|
* Unless required by applicable law or agreed to in writing, software
|
||||||
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||||
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||||
|
* See the License for the specific language governing permissions and
|
||||||
|
* limitations under the License.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include "c-kzg.h"
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <assert.h>
|
||||||
|
#include <stdio.h>
|
||||||
|
|
||||||
|
// This is 1 in Blst's `blst_fr` limb representation. Crazy but true.
|
||||||
|
static const blst_fr one =
|
||||||
|
{0x00000001fffffffeL, 0x5884b7fa00034802L, 0x998c4fefecbc4ff5L, 0x1824b159acc5056fL};
|
||||||
|
|
||||||
|
// MODULUS = 52435875175126190479447740508185965837690552500527637822603658699938581184513
|
||||||
|
// PRIMITIVE_ROOT = 5
|
||||||
|
// [pow(PRIMITIVE_ROOT, (MODULUS - 1) // (2**i), MODULUS) for i in range(32)]
|
||||||
|
//
|
||||||
|
// These are not in `blst_fr` limb format and must be converted via `blst_fr_from_uint64()`
|
||||||
|
static const uint64_t scale2_root_of_unity[][4] =
|
||||||
|
{
|
||||||
|
{0x0000000000000001L, 0x0000000000000000L, 0x0000000000000000L, 0x0000000000000000L},
|
||||||
|
{0xffffffff00000000L, 0x53bda402fffe5bfeL, 0x3339d80809a1d805L, 0x73eda753299d7d48L},
|
||||||
|
{0x0001000000000000L, 0xec03000276030000L, 0x8d51ccce760304d0L, 0x0000000000000000L},
|
||||||
|
{0x8dd702cb688bc087L, 0xa032824078eaa4feL, 0xa733b23a98ca5b22L, 0x3f96405d25a31660L},
|
||||||
|
{0x95df4b360411fe73L, 0x1ef4e672ebc1e1bbL, 0x6e92a9c460afca4aL, 0x4f2c596e753e4fccL},
|
||||||
|
{0x9733f3a6ba60eaa6L, 0xbd7fdf9c77487ae7L, 0xd84f8612c8b6cc00L, 0x476fa2fb6162ffabL},
|
||||||
|
{0xd2fc5e69ac5db47fL, 0xa12a70a615d0b8e4L, 0x293b1d67bc8de5d9L, 0x0e4840ac57f86f5eL},
|
||||||
|
{0xb750da4cab28e208L, 0x501dff643be95635L, 0x8cbe2437f0b4b276L, 0x07d0c802a94a946eL},
|
||||||
|
{0x2cabadec2fe322b8L, 0x752c84f315412560L, 0x32a732ae1a3b0aefL, 0x2e95da59a33dcbf2L},
|
||||||
|
{0x33811ea1fe0c65f4L, 0x15c1ad4c687f28a2L, 0xecfbede342dee7f4L, 0x1bb466679a5d88b1L},
|
||||||
|
{0xd58a5af42d010ff9L, 0x79efd6b0570bf109L, 0x3ed6d55a6350721dL, 0x2f27b09858f43cefL},
|
||||||
|
{0x74a1f6718c130477L, 0xa534af14b61e0abeL, 0xeb674a1a620890d7L, 0x43527a8bca252472L},
|
||||||
|
{0x450d9f977ea8ee05L, 0x565af17137d56fc0L, 0xe155cb4893f9e9acL, 0x110cebd0c8e9101bL},
|
||||||
|
{0x23c9159959a0be92L, 0x87d188ce7a027759L, 0x70491431cab3c3ccL, 0x0ac00eb8b3f7f8daL},
|
||||||
|
{0x13e96ade69583404L, 0x82c057275306243dL, 0x77e48bf529ca9f2aL, 0x50646ac81fe19595L},
|
||||||
|
{0xe6a354dda97eccd4L, 0x39929d2e88fbbc57L, 0xa22ba63dd6e7b1c8L, 0x42c22911f5f07f43L},
|
||||||
|
{0x137b458acfc35f7aL, 0x0caba63a29c01b06L, 0x0409ee987a02402cL, 0x6709c6cd56aa725bL},
|
||||||
|
{0x10251f7d8831e03eL, 0x77d85a937ff858ecL, 0xebe905bd4fb9ac5cL, 0x05deb333f8727901L},
|
||||||
|
{0xbf87b689b9009408L, 0x4f730e7ddd3ccc96L, 0xfd7f05ba4610300cL, 0x5ef5e8db0b8ac903L},
|
||||||
|
{0x6499688417cd0c14L, 0xa672867368812f7fL, 0x2e1d9a1922cc3253L, 0x3a689e83aa0a1d80L},
|
||||||
|
{0x20b53cbe41144deaL, 0x870c46fac2f0fcbdL, 0x556c35f6537d6971L, 0x3436287f5f686d91L},
|
||||||
|
{0x007e082a436ba2e7L, 0x67c6630f9116e877L, 0x36f8f165fb4460f7L, 0x6eee34d57e7046e0L},
|
||||||
|
{0xc5b670eea53a56d1L, 0x127d1f4253037d7bL, 0x57d4257ea722c2e2L, 0x03ae26a333cbd838L},
|
||||||
|
{0x1e91484876504cf8L, 0x55bbbf1eb63edd02L, 0xbcdafec84e55aa02L, 0x5145c4cd2dc0beb0L},
|
||||||
|
{0x5b90153a1ab70e2cL, 0x8deffa3175fb0ab8L, 0xc553ae2346900c95L, 0x1d31dcdc6bd3118cL},
|
||||||
|
{0x801c894c59a2e8ebL, 0xbc535c5ce12fc974L, 0x95508d2747d39803L, 0x16d9d3cdac5d094fL},
|
||||||
|
{0x810fa372cca1d8beL, 0xc67b8c2882e0bfa7L, 0xdbb4edf0e2d35bc2L, 0x712d15805087c995L},
|
||||||
|
{0xeb162203fd88f133L, 0xac96c38ff010ea74L, 0x4307987fe64cfc70L, 0x350fe98d37b7a114L},
|
||||||
|
{0xaba2f51842f2a254L, 0x4d7f3c3aa71efc0cL, 0x97ae418dd274a80aL, 0x2967385d5e3e7682L},
|
||||||
|
{0x75c55c7b575a0b79L, 0x3ba4a15774a7ded1L, 0xc3974d73a04fccf3L, 0x705aba4f4a939684L},
|
||||||
|
{0x8409a9ea14ebb608L, 0xfad0084e66bac611L, 0x04287254811c1dfbL, 0x086d072b23b30c29L},
|
||||||
|
{0xb427c9b367e4756aL, 0xc7537fb902ebc38dL, 0x51de21becd6a205fL, 0x6064ab727923597dL}
|
||||||
|
};
|
||||||
|
|
||||||
|
typedef struct {
|
||||||
|
uint64_t max_width;
|
||||||
|
blst_fr root_of_unity;
|
||||||
|
blst_fr *expanded_roots_of_unity;
|
||||||
|
blst_fr *reverse_roots_of_unity;
|
||||||
|
} FFTSettings;
|
||||||
|
|
||||||
|
void print_bytes_as_hex_le(byte *bytes, int start, int len);
|
||||||
|
void print_fr(const blst_fr *a);
|
||||||
|
bool is_one(const blst_fr *fr_p);
|
||||||
|
bool is_power_of_two(uint64_t n);
|
||||||
|
bool fr_equal(blst_fr *aa, blst_fr *bb);
|
||||||
|
void fr_from_uint64(blst_fr *a, uint64_t n);
|
||||||
|
blst_fr *expand_root_of_unity(blst_fr *root_of_unity, uint64_t width);
|
||||||
|
blst_fr *reverse(blst_fr *r, uint64_t width);
|
||||||
|
FFTSettings new_fft_settings(unsigned int max_scale);
|
||||||
|
void free_fft_settings(FFTSettings *s);
|
||||||
|
void slow_ft(blst_fr *out, blst_fr *in, uint64_t offset, uint64_t stride, blst_fr *roots, uint64_t roots_stride, uint64_t l);
|
||||||
|
void fast_ft(blst_fr *out, blst_fr *in, uint64_t offset, uint64_t stride, blst_fr *roots, uint64_t roots_stride, uint64_t l);
|
||||||
|
void fft_helper(blst_fr *out, blst_fr *in, uint64_t offset, uint64_t stride, blst_fr *roots, uint64_t roots_stride, uint64_t l);
|
||||||
|
void fft (blst_fr *out, blst_fr *in, FFTSettings *fs, bool inv, uint64_t n);
|
||||||
|
|
@ -0,0 +1,235 @@
|
||||||
|
/*
|
||||||
|
* Copyright 2021 Benjamin Edgington
|
||||||
|
*
|
||||||
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||||
|
* you may not use this file except in compliance with the License.
|
||||||
|
* You may obtain a copy of the License at
|
||||||
|
*
|
||||||
|
* http://www.apache.org/licenses/LICENSE-2.0
|
||||||
|
*
|
||||||
|
* Unless required by applicable law or agreed to in writing, software
|
||||||
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||||
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||||
|
* See the License for the specific language governing permissions and
|
||||||
|
* limitations under the License.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include "inc/acutest.h"
|
||||||
|
#include "fft_fr.h"
|
||||||
|
|
||||||
|
#define NUM_ROOTS 32
|
||||||
|
|
||||||
|
const uint64_t inv_fft_expected[][4] =
|
||||||
|
{
|
||||||
|
{0x7fffffff80000008L, 0xa9ded2017fff2dffL, 0x199cec0404d0ec02L, 0x39f6d3a994cebea4L},
|
||||||
|
{0x27325dd08ac4cee9L, 0xcbb94f168ddacca9L, 0x6843be68485784b1L, 0x5a6faf9039451673L},
|
||||||
|
{0x16d00224dcf9382cL, 0xfee079062d1eaa93L, 0x3ce49204a2235046L, 0x163147176461030eL},
|
||||||
|
{0x10d6917f04735deaL, 0x7e04a13731049a48L, 0x42cbd9ab89d7b1f7L, 0x60546bd624850b42L},
|
||||||
|
{0x80007fff80000000L, 0x1fe05202bb00adffL, 0x6045d26b3fd26e6bL, 0x39f6d3a994cebea4L},
|
||||||
|
{0xe3388d354a80ed91L, 0x5849af2fc2cd4521L, 0xe3a64f3f31971b0bL, 0x33f1dda75bc30526L},
|
||||||
|
{0x16cf0224dcf9382cL, 0x12dd7903b71baa93L, 0xaf92c5362c204b76L, 0x163147176461030dL},
|
||||||
|
{0xf9925986d0d25e90L, 0xcdf85d0a339d7782L, 0xee7a9a5f0410e423L, 0x2e0d216170831056L},
|
||||||
|
{0x7fffffff80000000L, 0xa9ded2017fff2dffL, 0x199cec0404d0ec02L, 0x39f6d3a994cebea4L},
|
||||||
|
{0x066da6782f2da170L, 0x85c546f8cc60e47cL, 0x44bf3da90590f3e1L, 0x45e085f1b91a6cf1L},
|
||||||
|
{0xe930fdda2306c7d4L, 0x40e02aff48e2b16bL, 0x83a712d1dd818c8fL, 0x5dbc603bc53c7a3aL},
|
||||||
|
{0x1cc772c9b57f126fL, 0xfb73f4d33d3116ddL, 0x4f9388c8d80abcf9L, 0x3ffbc9abcdda7821L},
|
||||||
|
{0x7fff7fff80000000L, 0x33dd520044fdadffL, 0xd2f4059cc9cf699aL, 0x39f6d3a994cebea3L},
|
||||||
|
{0xef296e7ffb8ca216L, 0xd5b902cbcef9c1b6L, 0xf06dfe5c7fca260dL, 0x13993b7d05187205L},
|
||||||
|
{0xe92ffdda2306c7d4L, 0x54dd2afcd2dfb16bL, 0xf6554603677e87beL, 0x5dbc603bc53c7a39L},
|
||||||
|
{0xd8cda22e753b3117L, 0x880454ec72238f55L, 0xcaf6199fc14a5353L, 0x197df7c2f05866d4L}
|
||||||
|
};
|
||||||
|
|
||||||
|
void is_one_works(void) {
|
||||||
|
TEST_CHECK(true == is_one(&one));
|
||||||
|
}
|
||||||
|
|
||||||
|
void roots_of_unity_is_the_expected_size(void) {
|
||||||
|
TEST_CHECK(NUM_ROOTS ==
|
||||||
|
sizeof(scale2_root_of_unity) / sizeof(scale2_root_of_unity[0]));
|
||||||
|
}
|
||||||
|
|
||||||
|
void roots_of_unity_are_plausible(void) {
|
||||||
|
blst_fr r;
|
||||||
|
for (unsigned int i = 0; i < NUM_ROOTS; i++) {
|
||||||
|
blst_fr_from_uint64(&r, scale2_root_of_unity[i]);
|
||||||
|
for (unsigned int j = 0; j < i; j++) {
|
||||||
|
blst_fr_sqr(&r, &r);
|
||||||
|
}
|
||||||
|
TEST_CHECK(true == is_one(&r));
|
||||||
|
TEST_MSG("Root %d failed", i);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void reverse_works(void) {
|
||||||
|
int n = 24;
|
||||||
|
blst_fr arr[n + 1];
|
||||||
|
blst_fr *rev, diff;
|
||||||
|
|
||||||
|
// Initialise - increasing values
|
||||||
|
arr[0] = one;
|
||||||
|
for (int i = 1; i <= n; i++) {
|
||||||
|
blst_fr_add(arr + i, arr + i - 1, &one);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Reverse
|
||||||
|
rev = reverse(arr, n);
|
||||||
|
|
||||||
|
// Verify - decreasing values
|
||||||
|
for (int i = 0; i < n; i++) {
|
||||||
|
blst_fr_sub(&diff, rev + i, rev + i + 1);
|
||||||
|
TEST_CHECK(true == is_one(&diff));
|
||||||
|
}
|
||||||
|
TEST_CHECK(true == is_one(rev + n));
|
||||||
|
|
||||||
|
free(rev);
|
||||||
|
}
|
||||||
|
|
||||||
|
void expand_roots_is_plausible(void) {
|
||||||
|
// Just test one (largeish) value of scale
|
||||||
|
unsigned int scale = 20;
|
||||||
|
unsigned int width = 1 << scale;
|
||||||
|
blst_fr root, *expanded, prod;
|
||||||
|
|
||||||
|
// Initialise
|
||||||
|
blst_fr_from_uint64(&root, scale2_root_of_unity[scale]);
|
||||||
|
expanded = expand_root_of_unity(&root, width);
|
||||||
|
|
||||||
|
// Verify - each pair should multiply to one
|
||||||
|
TEST_CHECK(true == is_one(expanded + 0));
|
||||||
|
TEST_CHECK(true == is_one(expanded + width));
|
||||||
|
for (unsigned int i = 1; i <= width / 2; i++) {
|
||||||
|
blst_fr_mul(&prod, expanded + i, expanded + width - i);
|
||||||
|
TEST_CHECK(true == is_one(&prod));
|
||||||
|
}
|
||||||
|
|
||||||
|
free(expanded);
|
||||||
|
}
|
||||||
|
|
||||||
|
void new_fft_settings_is_plausible(void) {
|
||||||
|
// Just test one (largeish) value of scale
|
||||||
|
unsigned int scale = 21;
|
||||||
|
unsigned int width = 1 << scale;
|
||||||
|
blst_fr prod;
|
||||||
|
FFTSettings s = new_fft_settings(scale);
|
||||||
|
|
||||||
|
// Verify - each pair should multiply to one
|
||||||
|
for (unsigned int i = 1; i <= width; i++) {
|
||||||
|
blst_fr_mul(&prod, s.expanded_roots_of_unity + i, s.reverse_roots_of_unity + i);
|
||||||
|
TEST_CHECK(true == is_one(&prod));
|
||||||
|
}
|
||||||
|
|
||||||
|
free_fft_settings(&s);
|
||||||
|
}
|
||||||
|
|
||||||
|
void is_power_of_two_works(void) {
|
||||||
|
// All actual powers of two
|
||||||
|
for (int i = 0; i <=63; i++) {
|
||||||
|
TEST_CHECK(true == is_power_of_two((uint64_t)1 << i));
|
||||||
|
TEST_MSG("Case %d", i);
|
||||||
|
}
|
||||||
|
|
||||||
|
// This is a bit weird
|
||||||
|
TEST_CHECK(true == is_power_of_two(0));
|
||||||
|
|
||||||
|
// Not powers of two
|
||||||
|
TEST_CHECK(false == is_power_of_two(123));
|
||||||
|
TEST_CHECK(false == is_power_of_two(1234567));
|
||||||
|
}
|
||||||
|
|
||||||
|
void fr_from_uint64_works(void) {
|
||||||
|
blst_fr a;
|
||||||
|
fr_from_uint64(&a, 1);
|
||||||
|
TEST_CHECK(true == is_one(&a));
|
||||||
|
}
|
||||||
|
|
||||||
|
void fr_equal_works(void) {
|
||||||
|
blst_fr a, b;
|
||||||
|
blst_fr_from_uint64(&a, scale2_root_of_unity[15]);
|
||||||
|
blst_fr_from_uint64(&b, scale2_root_of_unity[16]);
|
||||||
|
TEST_CHECK(true == fr_equal(&a, &a));
|
||||||
|
TEST_CHECK(false == fr_equal(&a, &b));
|
||||||
|
}
|
||||||
|
|
||||||
|
void compare_sft_fft(void) {
|
||||||
|
// Initialise: ascending values of i (could be anything), and arbitrary size
|
||||||
|
unsigned int size = 8;
|
||||||
|
FFTSettings fs = new_fft_settings(size);
|
||||||
|
blst_fr data[fs.max_width], out0[fs.max_width], out1[fs.max_width];
|
||||||
|
for (int i = 0; i < fs.max_width; i++) {
|
||||||
|
fr_from_uint64(data + i, i);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Do both fast and slow transforms
|
||||||
|
slow_ft(out0, data, 0, 1, fs.expanded_roots_of_unity, 1, fs.max_width);
|
||||||
|
fast_ft(out1, data, 0, 1, fs.expanded_roots_of_unity, 1, fs.max_width);
|
||||||
|
|
||||||
|
// Verify the results are identical
|
||||||
|
for (int i = 0; i < fs.max_width; i++) {
|
||||||
|
TEST_CHECK(fr_equal(out0 + i, out1 + i));
|
||||||
|
}
|
||||||
|
|
||||||
|
free_fft_settings(&fs);
|
||||||
|
}
|
||||||
|
|
||||||
|
void roundtrip_fft(void) {
|
||||||
|
// Initialise: ascending values of i, and arbitrary size
|
||||||
|
unsigned int size = 12;
|
||||||
|
FFTSettings fs = new_fft_settings(size);
|
||||||
|
blst_fr data[fs.max_width], coeffs[fs.max_width];
|
||||||
|
for (int i = 0; i < fs.max_width; i++) {
|
||||||
|
fr_from_uint64(data + i, i);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Forward and reverse FFT
|
||||||
|
fft(coeffs, data, &fs, false, fs.max_width);
|
||||||
|
fft(data, coeffs, &fs, true, fs.max_width);
|
||||||
|
|
||||||
|
// Verify that the result is still ascending values of i
|
||||||
|
for (int i = 0; i < fs.max_width; i++) {
|
||||||
|
blst_fr tmp;
|
||||||
|
fr_from_uint64(&tmp, i);
|
||||||
|
TEST_CHECK(fr_equal(&tmp, data + i));
|
||||||
|
}
|
||||||
|
|
||||||
|
free_fft_settings(&fs);
|
||||||
|
}
|
||||||
|
|
||||||
|
void inverse_fft(void) {
|
||||||
|
// Initialise: ascending values of i
|
||||||
|
FFTSettings fs = new_fft_settings(4);
|
||||||
|
blst_fr data[fs.max_width], out[fs.max_width];
|
||||||
|
for (int i = 0; i < fs.max_width; i++) {
|
||||||
|
fr_from_uint64(&data[i], i);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Inverst FFT
|
||||||
|
fft(out, data, &fs, true, fs.max_width);
|
||||||
|
|
||||||
|
// Verify against the known result, `inv_fft_expected`
|
||||||
|
int n = sizeof(inv_fft_expected) / sizeof(inv_fft_expected[0]);
|
||||||
|
TEST_CHECK(n == fs.max_width);
|
||||||
|
for (int i = 0; i < n; i++) {
|
||||||
|
blst_fr expected;
|
||||||
|
blst_fr_from_uint64(&expected, inv_fft_expected[i]);
|
||||||
|
TEST_CHECK(fr_equal(&expected, &out[i]));
|
||||||
|
}
|
||||||
|
|
||||||
|
free_fft_settings(&fs);
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_LIST =
|
||||||
|
{
|
||||||
|
{"is_one_works", is_one_works },
|
||||||
|
{"roots_of_unity_is_the_expected_size", roots_of_unity_is_the_expected_size},
|
||||||
|
{"roots_of_unity_are_plausible", roots_of_unity_are_plausible},
|
||||||
|
{"reverse_works", reverse_works},
|
||||||
|
{"expand_roots_is_plausible", expand_roots_is_plausible},
|
||||||
|
{"new_fft_settings_is_plausible", new_fft_settings_is_plausible},
|
||||||
|
{"is_power_of_two_works", is_power_of_two_works},
|
||||||
|
{"fr_from_uint64_works", fr_from_uint64_works},
|
||||||
|
{"fr_equal_works", fr_equal_works},
|
||||||
|
{"compare_sft_fft", compare_sft_fft},
|
||||||
|
{"roundtrip_fft", roundtrip_fft},
|
||||||
|
{"inverse_fft", inverse_fft},
|
||||||
|
{ NULL, NULL } /* zero record marks the end of the list */
|
||||||
|
};
|
||||||
File diff suppressed because it is too large
Load Diff
|
|
@ -0,0 +1,61 @@
|
||||||
|
/*
|
||||||
|
* Copyright 2021 Benjamin Edgington
|
||||||
|
*
|
||||||
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||||
|
* you may not use this file except in compliance with the License.
|
||||||
|
* You may obtain a copy of the License at
|
||||||
|
*
|
||||||
|
* http://www.apache.org/licenses/LICENSE-2.0
|
||||||
|
*
|
||||||
|
* Unless required by applicable law or agreed to in writing, software
|
||||||
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||||
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||||
|
* See the License for the specific language governing permissions and
|
||||||
|
* limitations under the License.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <stdio.h>
|
||||||
|
|
||||||
|
#include "inc/blst.h"
|
||||||
|
|
||||||
|
void print_bytes_as_hex(byte *bytes, int start, int len) {
|
||||||
|
for (int i = start; i < start + len; i++) {
|
||||||
|
printf("%02x", bytes[i]);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/* "Pretty" print an affine point in G1 */
|
||||||
|
void print_p1_affine(const blst_p1_affine *p1) {
|
||||||
|
byte *p1_hex = (byte *)malloc(96);
|
||||||
|
blst_p1_affine_serialize(p1_hex, p1);
|
||||||
|
printf("[0x");
|
||||||
|
print_bytes_as_hex(p1_hex, 0, 48);
|
||||||
|
printf(",0x");
|
||||||
|
print_bytes_as_hex(p1_hex, 48, 48);
|
||||||
|
printf("]\n");
|
||||||
|
free(p1_hex);
|
||||||
|
}
|
||||||
|
|
||||||
|
/* "Pretty" print an affine point in G2 */
|
||||||
|
void print_p2_affine(const blst_p2_affine *p2) {
|
||||||
|
byte *p2_hex = (byte *)malloc(192);
|
||||||
|
blst_p2_affine_serialize(p2_hex, p2);
|
||||||
|
printf("[(0x");
|
||||||
|
print_bytes_as_hex(p2_hex, 0, 48);
|
||||||
|
printf(",0x");
|
||||||
|
print_bytes_as_hex(p2_hex, 48, 48);
|
||||||
|
printf("),(0x");
|
||||||
|
print_bytes_as_hex(p2_hex, 96, 48);
|
||||||
|
printf(",0x");
|
||||||
|
print_bytes_as_hex(p2_hex, 144, 48);
|
||||||
|
printf(")]\n");
|
||||||
|
free(p2_hex);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
int main() {
|
||||||
|
print_p1_affine(blst_p1_affine_generator());
|
||||||
|
print_p2_affine(blst_p2_affine_generator());
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
Loading…
Reference in New Issue