sapling.pism 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163
  1. # :set syntax=pism
  2. # :source ../scripts/pism.vim
  3. constant G_VCV FixedGenerator
  4. constant G_VCR FixedGenerator
  5. constant G_SPEND FixedGenerator
  6. constant G_PROOF FixedGenerator
  7. constant G_NOTE_COMMIT_R FixedGenerator
  8. constant G_NULL FixedGenerator
  9. constant CRH_IVK BlakePersonalization
  10. constant NOTE_COMMIT PedersenPersonalization
  11. constant MERKLE_0 PedersenPersonalization
  12. constant MERKLE_1 PedersenPersonalization
  13. constant MERKLE_2 PedersenPersonalization
  14. constant MERKLE_3 PedersenPersonalization
  15. # ...
  16. constant PRF_NF BlakePersonalization
  17. constant JUBJUB_FR_CAPACITY ByteSize
  18. contract input_spend
  19. param value U64
  20. param randomness Fr
  21. param ak Point
  22. param ar Fr
  23. param nsk Fr
  24. param g_d Point
  25. param commitment_randomness Fr
  26. param auth_path_0_0 Scalar
  27. param auth_path_0_1 Bool
  28. param auth_path_1_0 Scalar
  29. param auth_path_1_1 Bool
  30. # ...
  31. param anchor Scalar
  32. start
  33. # let rk: Point = ak + ar * G_SPEND
  34. witness ak param:ak
  35. assert_not_small_order ak
  36. fr_as_binary_le ar param:ar
  37. ec_mul_const ar ar G_SPEND
  38. ec_add rk ak ar
  39. # emit rk
  40. emit_ec rk
  41. # let nk: Point = nsk * G_PROOF
  42. fr_as_binary_le nsk param:nsk
  43. ec_mul_const nk nsk G_PROOF
  44. # let mut ivk_preimage: BinaryNumber = []
  45. alloc_binary ivk_preimage
  46. # ivk_preimage.put(ak)
  47. ec_repr repr_ak ak
  48. binary_extend ivk_preimage repr_ak
  49. # let mut nf_preimage: BinaryNumber = []
  50. alloc_binary nf_preimage
  51. ec_repr repr_nk nk
  52. binary_clone repr_nk repr_nk2
  53. # ivk_preimage.put(nk)
  54. binary_extend ivk_preimage repr_nk
  55. # nf_preimage.put(nk)
  56. binary_extend ivk_preimage repr_nk2
  57. # assert ivk_preimage.len() == 512
  58. static_assert_binary_size ivk_preimage 512
  59. # assert nf_preimage.len() == 256
  60. static_assert_binary_size nf_preimage 256
  61. # let mut ivk = blake2s(ivk_preimage, CRH_IVK)
  62. blake2s ivk ivk_preimage CRH_IVK
  63. # ivk.truncate(JUBJUB_FR_CAPACITY)
  64. binary_truncate ivk JUBJUB_FR_CAPACITY
  65. # let pk_d: Point = ivk * g_d
  66. witness g_d param:g_d
  67. assert_not_small_order g_d
  68. ec_mul pk_d ivk g_d
  69. # let cv: Point = value * G_VCV + rcv * G_VCR
  70. u64_as_binary_le value_bits param:value
  71. ec_mul_const value value_bits G_VCV
  72. fr_as_binary_le rcv param:randomness
  73. ec_mul_const rcv rcv G_VCR
  74. ec_add cv value rcv
  75. # emit cv
  76. emit_ec cv
  77. # let mut note_contents: BinaryNumber = []
  78. alloc_binary note_contents
  79. # note_contents.put(value)
  80. binary_extend note_contents value
  81. # note_contents.put(g_d)
  82. ec_repr repr_g_d g_d
  83. binary_extend note_contents repr_g_d
  84. # note_contents.put(p_k)
  85. ec_repr repr_p_k p_k
  86. binary_extend note_contents repr_p_k
  87. # assert note_contents.len() == 64 + 256 + 256
  88. static_assert_binary_size ivk_preimage 576
  89. # let mut cm = pedersen_hash(note_contents, NOTE_COMMIT)
  90. pedersen_hash cm note_contents NOTE_COMMIT
  91. # cm += commitment_randomness * G_NOTE_COMMIT_R
  92. fr_as_binary_le rcm param:commitment_randomness
  93. ec_mul_const cm1 rcm G_NOTE_COMMIT_R
  94. ec_add cm cm cm1
  95. # let mut position = []
  96. alloc_binary position
  97. # let mut cur: Scalar = cm.u
  98. ec_get_u cur cm
  99. # There are no loops in this language.
  100. # ZK proofs must have a fixed size.
  101. # So in this assembly we UNROLL all loops.
  102. # for i in range(auth_path.size()):
  103. #
  104. # Here we give the example of loop 0.
  105. # Replace the indexes with the value i
  106. # Below line is auth_path[0].1
  107. # let (node: Scalar, is_right: Bool) = auth_path[i]
  108. # position.push(is_right)
  109. alloc_bit cur_is_right param:auth_path_0_1
  110. clone_bit cur_is_right2 cur_is_right
  111. binary_push position cur_is_right2
  112. alloc_num path_element param:auth_path_0_0
  113. # let (left: Scalar, right: Scalar) = swap_if(is_right, cur, node)
  114. conditionally_reverse ulur cur path_element is_right
  115. get_0 ul ulur
  116. get_1 ur ulur
  117. # let mut preimage: BinaryNumber = []
  118. alloc_binary preimage
  119. # preimage.put(left)
  120. num_to_binary ul_bits ul
  121. binary_extend preimage ul_bits
  122. # preimage.put(right)
  123. num_to_binary ur_bits ur
  124. binary_extend preimage ur_bits
  125. # cur = pedersen_hash(MERKLE_TREE[i], preimage).u
  126. pedersen_hash curhash preimage MERKLE_0
  127. ec_get_u cur curhash
  128. # ... repeat the above N times
  129. # enforce cur == rt
  130. alloc_num rt param:anchor
  131. num_enforce_equal cur rt
  132. # emit rt
  133. emit_num rt
  134. # let rho: Point = rho + position * G_NULL
  135. ec_mul_const position position_bits G_NULL
  136. ec_add rho rho position
  137. # nf_preimage.put(rho)
  138. ec_repr repr_rho rho
  139. binary_extend nf_preimage repr_rho
  140. # assert nf_preimage.len() == 512
  141. static_assert_binary_size nf_preimage 512
  142. # let nf: BinaryNumber = blake2s(nf_preimage, PRF_NF)
  143. blake2s nf nf_preimage PRF_NF
  144. emit_binary nf
  145. end