WIP

halo2_proofs/src/dev.rs

@@ -396,13 +396,13 @@ impl<F: Field> Assignment<F> for MockProver<F> {
             return Ok(());
         }
 
-        assert!(
-            self.usable_rows.contains(&row),
-            "row={} not in usable_rows={:?}, k={}",
-            row,
-            self.usable_rows,
-            self.k,
-        );
+        // assert!(
+        //     self.usable_rows.contains(&row),
+        //     "row={} not in usable_rows={:?}, k={}",
+        //     row,
+        //     self.usable_rows,
+        //     self.k,
+        // );
 
         // Track that this selector was enabled. We require that all selectors are enabled
         // inside some region (i.e. no floating selectors).

halo2_proofs/src/plonk.rs

@@ -386,7 +386,7 @@ where
     /// WITHOUT performing the expensive Montgomery reduction.
     /// Does so by first writing the verifying key and then serializing the rest of the data (in the form of field polynomials)
     pub fn write<W: io::Write>(&self, writer: &mut W, format: SerdeFormat) -> io::Result<()> {
-        self.vk.write(writer, format)?;
+        //self.vk.write(writer, format)?;
         write_polynomial_slice(&self.fixed_values, writer, format)?;
         self.permutation.write(writer, format)?;
         Ok(())