github/darkfi
1
1
Fork 0
mirror of https://github.com/darkrenaissance/darkfi.git synced 2026-01-09 14:48:08 -05:00
Code Issues Packages Projects Releases Wiki Activity

add explainer comment showing computation for G values

Browse Source
This commit is contained in:
narodnik
2021-09-20 15:55:57 +02:00
parent 46c7fe98af
commit 7fbc9071fe
1 changed files with 22 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
script/research/bltprf/bltprf.sage
View File

@@ -54,7 +54,7 @@ for current_k in range(k, 0, -1):
challenges.append(challenge)
a = [a[i] + challenge^-1 * a[half + i] for i in range(half)]
G = [int(challenge^-1) * G[i] + int(challenge) * G[half + i] for i in range(half)]
G = [G[i] + int(challenge) * G[half + i] for i in range(half)]
assert len(a) == len(G) == half
# Last iteration
@@ -67,6 +67,26 @@ for current_k in range(k, 0, -1):
assert len(challenges) == k
# G_3 = [G1, G2, G3, G4, G5, G6, G7, G8]
# G_2 = [
# G1 + x G5,
# G2 + x G6,
# G3 + x G7,
# G4 + x G8
# ]
# G_1 = [
# G_2_1 + x G_2_3,
# G_2_2 + x G_2_4
# ] = [
# (G1 + x G5) + x (G3 + x G7) = G1 + x G3 + x G5 + x^2 G7,
# (G2 + x G6) + x (G4 + x G8) = G2 + x G4 + x G6 + x^2 G8
# ]
#
# We end up with a single remaining value
#
# G_0 = G_1_1 + x G_1_2
# = G1 + x G2 + x G3 + x^2 G4 + x G5 + x^2 G6 + x^2 G7 + x^3 G8
def get_jth_bit(value, idx):
digits = bin(value)[2:]
# Add zero padding
@@ -81,7 +101,7 @@ for i in range(1, n + 1):
if get_jth_bit(i - 1, j):
b = 1
else:
b = -1
b = 0
s *= challenges[j]^b
counters.append(s)