Poseidon version of SnapDeals (#1547)

* feat: adds EmptySectorUpdate-Poseidon circuit and paramcache-id

Co-authored-by: DrPeterVanNostrand <jnz@riseup.net>

storage-proofs-update/src/challenges.rs

@@ -61,6 +61,28 @@ impl Challenges {
             challenges_remaining: challenge_count,
         }
     }
+
+    pub fn new_poseidon(sector_nodes: usize, comm_r_new: TreeRDomain) -> Self {
+        let repeats = partition_count(sector_nodes);
+
+        let challenge_bit_len = sector_nodes.trailing_zeros() as usize;
+        let random_bits_per_challenge = challenge_bit_len;
+        let challenges_per_digest = Fr::CAPACITY as usize / random_bits_per_challenge;
+
+        let challenge_count = challenge_count(sector_nodes) * repeats;
+        let digest_index_all_partitions = 0;
+
+        Challenges {
+            comm_r_new,
+            partition_bits: 0,
+            random_bits_per_challenge,
+            challenges_per_digest,
+            digest_index_all_partitions,
+            i: 0,
+            digest_bits: Vec::with_capacity(Fr::NUM_BITS as usize),
+            challenges_remaining: challenge_count,
+        }
+    }
 }
 
 impl Iterator for Challenges {

storage-proofs-update/src/circuit.rs

@@ -323,6 +323,12 @@ where
     TreeR: MerkleTreeTrait<Hasher = TreeRHasher>,
 {
     pub fn blank(pub_params: PublicParams) -> Self {
+        let sector_bytes = (pub_params.sector_nodes as u64) << 5;
+        assert_eq!(
+            PublicParams::from_sector_size(sector_bytes),
+            pub_params,
+            "invalid public-params for sector-size",
+        );
         let pub_inputs = PublicInputs::empty();
         let priv_inputs = PrivateInputs::<TreeR>::empty(pub_params.sector_nodes);
         EmptySectorUpdateCircuit {

storage-proofs-update/src/constants.rs

@@ -84,6 +84,12 @@ pub const fn challenge_count(sector_nodes: usize) -> usize {
     }
 }
 
+// Number of challenges per EmtpySectorUpdate-Poseidon partition proof; note
+// EmptySectorUpdate-Poseidon proofs are single partition.
+pub const fn challenge_count_poseidon(sector_nodes: usize) -> usize {
+    challenge_count(sector_nodes) * partition_count(sector_nodes)
+}
+
 // Returns the `h` values allowed for the given sector-size. Each `h` value is a possible number of
 // high bits taken from each challenge `c`. A single value of `h = hs[i]` is taken from `hs` for
 // each proof; the circuit takes `h_select = 2^i` as a public input.

storage-proofs-update/src/lib.rs

@@ -2,6 +2,7 @@ pub mod circuit;
 pub mod compound;
 pub mod constants;
 pub(crate) mod gadgets;
+pub mod poseidon;
 pub mod vanilla;
 
 mod challenges;