Pedersen Hash Function

Search…

​HHH
 is a Pedersen hash on two field elements, (a,b)(a, b)(a,b)
 represented as 252252252
-bit integers, defined as follows:
H(a,b)=[P0+alow⋅P1+ahigh⋅P2+blow⋅P3+bhigh⋅P4]xH(a, b) = [P_0 + a_{\text{low}} \cdot P_1 + a_{\text{high}} \cdot P_2 + b_{\text{low}} \cdot P_3 + b_{\text{high}} \cdot P_4]_xH(a,b)=[P0​+alow​⋅P1​+ahigh​⋅P2​+blow​⋅P3​+bhigh​⋅P4​]x​
where alowa_{\text{low}}alow​
is the 248248248
low bits of aaa
 , ahigha_{\text{high}}ahigh​
is the 444
high bits of aaa
(and similarly for bbb
). [P]x[P]_x[P]x​
 denotes the xxx
-coordinate of an elliptic-curve point PPP
. P0,P1,P2,P3,P4P_0, P_1, P_2, P_3, P_4P0​,P1​,P2​,P3​,P4​
 are constant points on the elliptic curve, derived from the decimal digits of π\piπ
 . The shift point P0P_0P0​
 was added for technical reasons to make sure the point at infinity on the elliptic curve does not appear during the computation.
You can check the python and javascript reference implementation of this function.
Constant Points
​
​

Crypto - Previous

STARK Curve

Next - Crypto

Key Derivation

Last modified 2d ago

Copy link