lead.rs 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259
  1. use incrementalmerkletree::{bridgetree::BridgeTree, Frontier, Tree};
  2. use halo2_gadgets::primitives::{
  3. poseidon,
  4. poseidon::{ConstantLength, P128Pow5T3},
  5. };
  6. use halo2_proofs::dev::MockProver;
  7. use rand::{thread_rng, Rng};
  8. use pasta_curves::{pallas, Fp};
  9. use darkfi::{
  10. crypto::{
  11. constants::{
  12. NullifierK, OrchardFixedBases, OrchardFixedBasesFull, ValueCommitV,
  13. MERKLE_DEPTH_ORCHARD,
  14. },
  15. keypair::{Keypair, PublicKey, SecretKey},
  16. merkle_node::MerkleNode,
  17. nullifier::Nullifier,
  18. proof::{Proof, ProvingKey, VerifyingKey},
  19. types::*,
  20. util::{mod_r_p, pedersen_commitment_scalar, pedersen_commitment_u64},
  21. },
  22. zk::circuit::lead_contract::LeadContract,
  23. };
  24. use pasta_curves::{arithmetic::CurveAffine, group::Curve};
  25. use pasta_curves::group::{ff::PrimeField, GroupEncoding};
  26. //use halo2_proofs::arithmetic::CurveAffine;
  27. #[derive(Debug, Default, Clone, Copy)]
  28. pub struct Coin {
  29. value: Option<pallas::Base>, //stake
  30. cm: Option<pallas::Point>,
  31. cm2: Option<pallas::Point>,
  32. sl: Option<pallas::Base>, //slot id
  33. tau: Option<pallas::Base>,
  34. nonce: Option<pallas::Base>,
  35. nonce_cm: Option<pallas::Point>,
  36. sn: Option<pallas::Point>, // coin's serial number
  37. //sk : Option<SecretKey>,
  38. pk: Option<pallas::Point>,
  39. pk_x: Option<pallas::Base>,
  40. pk_y: Option<pallas::Base>,
  41. root_cm: Option<pallas::Scalar>,
  42. root_sk: Option<pallas::Base>,
  43. path: Option<[MerkleNode; MERKLE_DEPTH_ORCHARD]>,
  44. path_sk: Option<[MerkleNode; MERKLE_DEPTH_ORCHARD]>,
  45. opening1: Option<pallas::Base>,
  46. opening2: Option<pallas::Base>,
  47. }
  48. fn main() {
  49. let k = 13;
  50. //
  51. const LEN: usize = 10;
  52. let mut rng = thread_rng();
  53. let mut sks: Vec<u64> = vec![];
  54. let mut root_sks: Vec<MerkleNode> = vec![];
  55. let mut path_sks: Vec<[MerkleNode; MERKLE_DEPTH_ORCHARD]> = vec![];
  56. let mut tree = BridgeTree::<MerkleNode, 32>::new(LEN);
  57. for i in 0..LEN {
  58. let tmp: u64 = rng.gen();
  59. let mut sk: u64 = tmp;
  60. sks.push(sk.clone());
  61. let node = MerkleNode(pallas::Base::from(sk));
  62. tree.append(&node.clone());
  63. let leaf_position = tree.witness();
  64. //let (leaf_pos, path) = tree.authentication_path(leaf_position.unwrap()).unwrap();
  65. let path = tree.authentication_path(leaf_position.unwrap()).unwrap();
  66. root_sks.push(tree.root().clone());
  67. path_sks.push(path.as_slice().try_into().unwrap());
  68. }
  69. let mut seeds: Vec<u64> = vec![];
  70. for i in 0..LEN {
  71. let rho: u64 = rng.gen();
  72. seeds.push(rho.clone());
  73. }
  74. //
  75. let yu64: u64 = rng.gen();
  76. let rhou64: u64 = rng.gen();
  77. let mau_y: pallas::Scalar = pallas::Scalar::from(yu64);
  78. let mau_rho: pallas::Scalar = pallas::Scalar::from(rhou64);
  79. //
  80. let mut coins: Vec<Coin> = vec![];
  81. //
  82. let mut tree_cm = BridgeTree::<MerkleNode, 32>::new(LEN);
  83. let zerou64: u64 = 0;
  84. for i in 0..LEN {
  85. let c_v = pallas::Base::from(u64::try_from(i * 2).unwrap());
  86. //random sampling of the same size of prf,
  87. //pseudo random sampling that is the size of pederson commitment
  88. let c_sk: u64 = sks[i];
  89. let iu64: u64 = u64::try_from(i).unwrap();
  90. let c_sl = pallas::Base::from(iu64);
  91. let c_tau = pallas::Base::from(u64::try_from(i).unwrap()); // let's assume it's sl for simplicity
  92. let c_root_sk: MerkleNode = root_sks[i];
  93. let c_pk = pedersen_commitment_scalar(mod_r_p(c_tau), mod_r_p(c_root_sk.inner()));
  94. let c_seed = pallas::Base::from(seeds[i]);
  95. let c_sn = pedersen_commitment_scalar(mod_r_p(c_seed), mod_r_p(c_root_sk.inner()));
  96. let c_pk_pt = c_pk.to_affine().coordinates().unwrap();
  97. let c_pk_pt_x : pallas::Base = *c_pk_pt.x();
  98. let c_pk_pt_y : pallas::Base = *c_pk_pt.y();
  99. /*
  100. let c_cm_message = [
  101. c_pk_pt_x,clone(),
  102. c_pk_pt_y.clone(),
  103. c_v.clone(),
  104. c_seed.clone()
  105. ];
  106. let c_cm_v poseidon::Hash::<_, P128Pow5T3, ConstantLength<2>, 3, 2>::init().hash(c_cm_message);
  107. */
  108. let c_cm_v = c_v.clone() * c_seed.clone() * c_pk_pt_x * c_pk_pt_y;
  109. let c_cm1_blind = pallas::Base::from(1); //tmp val
  110. let c_cm2_blind = pallas::Base::from(1); //tmp val
  111. let c_cm: pallas::Point = pedersen_commitment_scalar(mod_r_p(c_cm_v), mod_r_p(c_cm1_blind));
  112. //TODO this return run time error! assertion error, it's out of range most likely
  113. //let c_cm_base_bytes : [u8; 32] = c_cm.to_bytes();
  114. /*
  115. let c_cm_base_bytes : [u8; 32] = c_cm.to_affine()
  116. .coordinates()
  117. .unwrap()
  118. .x().to_repr();
  119. let c_cm_base : pallas::Base = pallas::Base::from_repr(c_cm_base_bytes).unwrap();
  120. */
  121. let c_cm_base = pallas::Base::from(1);
  122. let c_cm_node = MerkleNode(c_cm_base);
  123. tree_cm.append(&c_cm_node.clone());
  124. let leaf_position = tree_cm.witness();
  125. let c_cm_path = tree_cm.authentication_path(leaf_position.unwrap()).unwrap();
  126. let c_root_cm = tree_cm.root();
  127. // lead coin commitment
  128. let c_seed2 = pedersen_commitment_scalar(mod_r_p(c_seed), mod_r_p(c_root_sk.inner()));
  129. let c_seed2_pt = c_seed2.to_affine().coordinates().unwrap();
  130. /*
  131. let lead_coin_msg = [c_pk_pt_y.clone(),
  132. c_pk_pt_x.clone(),
  133. c_v,
  134. *c_seed2_pt.x(),
  135. *c_seed2_pt.y()
  136. ];
  137. let lead_coin_msg_hash =
  138. poseidon::Hash::<_, P128Pow5T3, ConstantLength<5>, 3, 2>::init().hash(lead_coin_msg);
  139. */
  140. let lead_coin_msg = c_pk_pt_y.clone() *
  141. c_pk_pt_x.clone() *
  142. c_v *
  143. *c_seed2_pt.x() *
  144. *c_seed2_pt.y();
  145. let c_cm2 = pedersen_commitment_scalar(mod_r_p(lead_coin_msg), mod_r_p(c_cm2_blind));
  146. let c_root_sk = root_sks[i];
  147. let c_path_sk = path_sks[i];
  148. let coin = Coin {
  149. value: Some(c_v),
  150. cm: Some(c_cm),
  151. cm2: Some(c_cm2),
  152. sl: Some(c_sl),
  153. tau: Some(c_tau),
  154. nonce: Some(c_seed),
  155. nonce_cm: Some(c_seed2),
  156. sn: Some(c_sn),
  157. //sk: Some(c_sk),
  158. pk: Some(c_pk),
  159. pk_x: Some(c_pk_pt_x),
  160. pk_y: Some(c_pk_pt_y),
  161. root_cm: Some(mod_r_p(c_root_cm.inner())),
  162. root_sk: Some(c_root_sk.inner()),
  163. path: Some(c_cm_path.as_slice().try_into().unwrap()),
  164. path_sk: Some(c_path_sk),
  165. opening1: Some(c_cm1_blind),
  166. opening2: Some(c_cm2_blind),
  167. };
  168. coins.push(coin);
  169. }
  170. // ================
  171. // public inputs
  172. // ================
  173. let coin_idx = 0;
  174. let coin = coins[coin_idx];
  175. let po_nonce = coin.nonce_cm.unwrap().to_affine().coordinates().unwrap();
  176. let po_nonce = coin.nonce_cm.unwrap().to_affine().coordinates().unwrap();
  177. let po_tau = pedersen_commitment_scalar(mod_r_p(coin.tau.unwrap()), coin.root_cm.unwrap())
  178. .to_affine()
  179. .coordinates()
  180. .unwrap();
  181. let po_cm = coin.cm.unwrap().to_affine().coordinates().unwrap();
  182. let po_cm2 = coin.cm2.unwrap().to_affine().coordinates().unwrap();
  183. let po_pk = coin.pk.unwrap().to_affine().coordinates().unwrap();
  184. let po_sn = coin.sn.unwrap().to_affine().coordinates().unwrap();
  185. let po_path = coin.path.unwrap();
  186. let po_cmp = pallas::Base::from(1);
  187. let zero = pallas::Base::from(0);
  188. // ===============
  189. let path_sk = path_sks[coin_idx];
  190. let contract = LeadContract {
  191. path: coin.path,
  192. coin_pk_x : coin.pk_x,
  193. coin_pk_y : coin.pk_y,
  194. root_sk: coin.root_sk,
  195. path_sk: Some(path_sk),
  196. coin_timestamp: coin.tau, //
  197. coin_nonce: coin.nonce,
  198. coin_opening_1: Some(mod_r_p(coin.opening1.unwrap())),
  199. value: coin.value,
  200. coin_opening_2: Some(mod_r_p(coin.opening2.unwrap())),
  201. cm_pos: Some(u32::try_from(coin_idx).unwrap()),
  202. //sn_c1: Some(coin.sn.unwrap()),
  203. slot: Some(coin.sl.unwrap()),
  204. mau_rho: Some(mau_rho.clone()),
  205. mau_y: Some(mau_y.clone()),
  206. root_cm: Some(coin.root_cm.unwrap()),
  207. };
  208. let mut public_inputs: Vec<pallas::Base> = vec![
  209. *po_nonce.x(),
  210. *po_nonce.y(),
  211. *po_pk.x(),
  212. *po_pk.y(),
  213. *po_sn.x(),
  214. *po_sn.y(),
  215. *po_cm.x(),
  216. *po_cm.y(),
  217. *po_cm2.x(),
  218. *po_cm2.y(),
  219. //po_path[31].inner(), //TODO (res) how the path is structured assumed root is last node in the path.
  220. po_cmp,
  221. ];
  222. let prover = MockProver::run(k, &contract, vec![public_inputs]).unwrap();
  223. //
  224. assert_eq!(prover.verify(), Ok(()));
  225. //
  226. }