feat: efficient range check (#421)

# Rationale for this change

Currently, ranges on scalar values are verified in a bitwise
decomposition for each bit. This requires a proportionally large amount
of work to verify, since each bit must be checked. A more efficient
range check can leverage a lookup table and protocol with a verifying
party to efficiently argue range and uniqueness against columns of
scalar values.

# What changes are included in this PR?

Adds an efficient, byte-oriented range check protocol via lookup table
with logarithmic derivative arguments

# Are these changes tested?
- [x] Thorough unit tests for individual range check components
- [x] A demo RangeCheckExpr based off of a ProofPlan trait
implementation so that the prover and verifier builder structs can be
accessed

# Split

- Introduce threading to heavy matrix operations
- Configurable, generic word sizes
- Configurable range
- Dynamic column sizes
- Convert from ProofPlan to ProofExpr, need ProofExpr to be able to
provide verifier challenge

crates/proof-of-sql/src/sql/proof_exprs/mod.rs

@@ -84,6 +84,3 @@ mod column_expr;
 pub(crate) use column_expr::ColumnExpr;
 #[cfg(all(test, feature = "blitzar"))]
 mod column_expr_test;
-
-#[allow(dead_code, unused_variables)]
-mod range_check;

crates/proof-of-sql/src/sql/proof_plans/mod.rs

@@ -50,3 +50,7 @@ pub use dyn_proof_plan::DynProofPlan;
 
 #[cfg(test)]
 mod demo_mock_plan;
+
+pub mod range_check;
+#[cfg(all(test, feature = "blitzar"))]
+pub mod range_check_test_plan;