util.rs 9.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280
  1. /* This file is part of DarkFi (https://dark.fi)
  2. *
  3. * Copyright (C) 2020-2022 Dyne.org foundation
  4. *
  5. * This program is free software: you can redistribute it and/or modify
  6. * it under the terms of the GNU Affero General Public License as
  7. * published by the Free Software Foundation, either version 3 of the
  8. * License, or (at your option) any later version.
  9. *
  10. * This program is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. * GNU Affero General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU Affero General Public License
  16. * along with this program. If not, see <https://www.gnu.org/licenses/>.
  17. */
  18. use std::{any::Any, collections::HashMap};
  19. use darkfi_sdk::crypto::{
  20. schnorr::{SchnorrPublic, SchnorrSecret, Signature},
  21. PublicKey, SecretKey, TokenId,
  22. };
  23. use darkfi_serial::Encodable;
  24. use lazy_static::lazy_static;
  25. use log::debug;
  26. use pasta_curves::{
  27. group::ff::{Field, PrimeField},
  28. pallas,
  29. };
  30. use rand::rngs::OsRng;
  31. use darkfi::{
  32. crypto::{
  33. proof::{ProvingKey, VerifyingKey},
  34. types::DrkCircuitField,
  35. Proof,
  36. },
  37. zk::{vm::ZkCircuit, vm_stack::empty_witnesses},
  38. zkas::decoder::ZkBinary,
  39. Error,
  40. };
  41. use crate::error::{DaoError, DaoResult};
  42. /// Parse pallas::Base from a base58-encoded string
  43. pub fn parse_b58(s: &str) -> std::result::Result<pallas::Base, darkfi::Error> {
  44. let bytes = bs58::decode(s).into_vec()?;
  45. if bytes.len() != 32 {
  46. return Err(Error::ParseFailed("Failed parsing DrkTokenId from base58 string"))
  47. }
  48. let ret = pallas::Base::from_repr(bytes.try_into().unwrap());
  49. if ret.is_some().unwrap_u8() == 1 {
  50. return Ok(ret.unwrap())
  51. }
  52. Err(Error::ParseFailed("Failed parsing DrkTokenId from base58 string"))
  53. }
  54. // The token of the DAO treasury.
  55. lazy_static! {
  56. pub static ref DRK_ID: TokenId = TokenId::from(pallas::Base::random(&mut OsRng));
  57. }
  58. // Governance tokens that are airdropped to users to operate the DAO.
  59. lazy_static! {
  60. pub static ref GOV_ID: TokenId = TokenId::from(pallas::Base::random(&mut OsRng));
  61. }
  62. #[derive(Clone)]
  63. pub struct ZkBinaryContractInfo {
  64. pub k_param: u32,
  65. pub bincode: ZkBinary,
  66. pub proving_key: ProvingKey,
  67. pub verifying_key: VerifyingKey,
  68. }
  69. #[derive(Clone)]
  70. pub struct ZkNativeContractInfo {
  71. pub proving_key: ProvingKey,
  72. pub verifying_key: VerifyingKey,
  73. }
  74. #[derive(Clone)]
  75. pub enum ZkContractInfo {
  76. Binary(ZkBinaryContractInfo),
  77. Native(ZkNativeContractInfo),
  78. }
  79. #[derive(Clone)]
  80. pub struct ZkContractTable {
  81. // Key will be a hash of zk binary contract on chain
  82. table: HashMap<String, ZkContractInfo>,
  83. }
  84. impl ZkContractTable {
  85. pub fn new() -> Self {
  86. Self { table: HashMap::new() }
  87. }
  88. pub fn add_contract(&mut self, key: String, bincode: ZkBinary, k_param: u32) {
  89. let witnesses = empty_witnesses(&bincode);
  90. let circuit = ZkCircuit::new(witnesses, bincode.clone());
  91. let proving_key = ProvingKey::build(k_param, &circuit);
  92. let verifying_key = VerifyingKey::build(k_param, &circuit);
  93. let info = ZkContractInfo::Binary(ZkBinaryContractInfo {
  94. k_param,
  95. bincode,
  96. proving_key,
  97. verifying_key,
  98. });
  99. self.table.insert(key, info);
  100. }
  101. pub fn add_native(
  102. &mut self,
  103. key: String,
  104. proving_key: ProvingKey,
  105. verifying_key: VerifyingKey,
  106. ) {
  107. self.table.insert(
  108. key,
  109. ZkContractInfo::Native(ZkNativeContractInfo { proving_key, verifying_key }),
  110. );
  111. }
  112. pub fn lookup(&self, key: &String) -> Option<&ZkContractInfo> {
  113. self.table.get(key)
  114. }
  115. }
  116. // ANCHOR: transaction
  117. pub struct Transaction {
  118. pub func_calls: Vec<FuncCall>,
  119. pub signatures: Vec<Vec<Signature>>,
  120. // pub proofs: Vec<Proof>,
  121. }
  122. // ANCHOR_END: transaction
  123. impl Transaction {
  124. /// Verify ZK contracts for the entire tx
  125. /// In real code, we could parallelize this for loop
  126. /// TODO: fix use of unwrap with Result type stuff
  127. pub fn zk_verify(&self, zk_bins: &ZkContractTable) -> DaoResult<()> {
  128. for func_call in &self.func_calls {
  129. let proofs_public_vals = &func_call.call_data.zk_public_values();
  130. assert_eq!(
  131. proofs_public_vals.len(),
  132. func_call.proofs.len(),
  133. "proof_public_vals.len()={} and func_call.proofs.len()={} do not match",
  134. proofs_public_vals.len(),
  135. func_call.proofs.len()
  136. );
  137. for (i, (proof, (key, public_vals))) in
  138. func_call.proofs.iter().zip(proofs_public_vals.iter()).enumerate()
  139. {
  140. match zk_bins.lookup(key).unwrap() {
  141. ZkContractInfo::Binary(info) => {
  142. let verifying_key = &info.verifying_key;
  143. let verify_result = proof.verify(verifying_key, public_vals);
  144. if verify_result.is_err() {
  145. return Err(DaoError::VerifyProofFailed(i, key.to_string()))
  146. }
  147. //assert!(verify_result.is_ok(), "verify proof[{}]='{}' failed", i, key);
  148. }
  149. ZkContractInfo::Native(info) => {
  150. let verifying_key = &info.verifying_key;
  151. let verify_result = proof.verify(verifying_key, public_vals);
  152. if verify_result.is_err() {
  153. return Err(DaoError::VerifyProofFailed(i, key.to_string()))
  154. }
  155. //assert!(verify_result.is_ok(), "verify proof[{}]='{}' failed", i, key);
  156. }
  157. };
  158. debug!(target: "demo", "zk_verify({}) passed [i={}]", key, i);
  159. }
  160. }
  161. Ok(())
  162. }
  163. pub fn verify_sigs(&self) {
  164. let mut unsigned_tx_data = vec![];
  165. for (i, (func_call, signatures)) in
  166. self.func_calls.iter().zip(self.signatures.clone()).enumerate()
  167. {
  168. func_call.encode(&mut unsigned_tx_data).expect("failed to encode data");
  169. let signature_pub_keys = func_call.call_data.signature_public_keys();
  170. for (signature_pub_key, signature) in signature_pub_keys.iter().zip(signatures) {
  171. let verify_result = signature_pub_key.verify(&unsigned_tx_data[..], &signature);
  172. assert!(verify_result, "verify sigs[{}] failed", i);
  173. }
  174. debug!(target: "demo", "verify_sigs({}) passed", i);
  175. }
  176. }
  177. }
  178. pub fn sign(signature_secrets: Vec<SecretKey>, func_call: &FuncCall) -> Vec<Signature> {
  179. let mut signatures = vec![];
  180. let mut unsigned_tx_data = vec![];
  181. for signature_secret in signature_secrets {
  182. func_call.encode(&mut unsigned_tx_data).expect("failed to encode data");
  183. let signature = signature_secret.sign(&mut OsRng, &unsigned_tx_data[..]);
  184. signatures.push(signature);
  185. }
  186. signatures
  187. }
  188. type ContractId = pallas::Base;
  189. type FuncId = pallas::Base;
  190. // ANCHOR: funccall
  191. pub struct FuncCall {
  192. pub contract_id: ContractId,
  193. pub func_id: FuncId,
  194. pub call_data: Box<dyn CallDataBase + Send + Sync>,
  195. pub proofs: Vec<Proof>,
  196. }
  197. // ANCHOR_END: funccall
  198. impl Encodable for FuncCall {
  199. fn encode<W: std::io::Write>(&self, mut w: W) -> std::result::Result<usize, std::io::Error> {
  200. let mut len = 0;
  201. len += self.contract_id.encode(&mut w)?;
  202. len += self.func_id.encode(&mut w)?;
  203. len += self.proofs.encode(&mut w)?;
  204. len += self.call_data.encode_bytes(&mut w)?;
  205. Ok(len)
  206. }
  207. }
  208. // ANCHOR: calldatabase_trait
  209. pub trait CallDataBase {
  210. // Public values for verifying the proofs
  211. // Needed so we can convert internal types so they can be used in Proof::verify()
  212. fn zk_public_values(&self) -> Vec<(String, Vec<DrkCircuitField>)>;
  213. // For upcasting to CallData itself so it can be read in state_transition()
  214. fn as_any(&self) -> &dyn Any;
  215. // Public keys we will use to verify transaction signatures.
  216. fn signature_public_keys(&self) -> Vec<PublicKey>;
  217. fn encode_bytes(
  218. &self,
  219. writer: &mut dyn std::io::Write,
  220. ) -> std::result::Result<usize, std::io::Error>;
  221. }
  222. // ANCHOR_END: calldatabase_trait
  223. type GenericContractState = Box<dyn Any + Send>;
  224. pub struct StateRegistry {
  225. pub states: HashMap<[u8; 32], GenericContractState>,
  226. }
  227. impl StateRegistry {
  228. pub fn new() -> Self {
  229. Self { states: HashMap::new() }
  230. }
  231. pub fn register(&mut self, contract_id: ContractId, state: GenericContractState) {
  232. debug!(target: "StateRegistry::register()", "contract_id: {:?}", contract_id);
  233. self.states.insert(contract_id.to_repr(), state);
  234. }
  235. pub fn lookup_mut<'a, S: 'static>(&'a mut self, contract_id: ContractId) -> Option<&'a mut S> {
  236. self.states.get_mut(&contract_id.to_repr()).and_then(|state| state.downcast_mut())
  237. }
  238. pub fn lookup<'a, S: 'static>(&'a self, contract_id: ContractId) -> Option<&'a S> {
  239. self.states.get(&contract_id.to_repr()).and_then(|state| state.downcast_ref())
  240. }
  241. }
  242. pub trait UpdateBase {
  243. fn apply(self: Box<Self>, states: &mut StateRegistry);
  244. }