Two tight clusters {1,2,3} and {4,5,6} with heavy intra-cluster delta and a single thin cross edge. A good bisection cuts only the thin edge.
()
| 2036 | } |
| 2037 | |
| 2038 | /// Measured single-GPU **leaf prove time**: `≈ PROVE_SETUP_SECS + |
| 2039 | /// PROVE_SECS_PER_BCOST × cost_billions` per shard (RTX PRO 6000, warm |
| 2040 | /// proving-key cache). Aggregation adds a smaller per-fold term this model |
| 2041 | /// omits — minutes next to hours of leaf proving at large shard counts. |
| 2042 | pub const PROVE_SETUP_SECS: f64 = 29.0; |
| 2043 | pub const PROVE_SECS_PER_BCOST: f64 = 2.25; |
| 2044 | |
| 2045 | /// Predicted single-shard leaf prove time (seconds) for a leaf of `steps`. |
| 2046 | pub fn shard_prove_secs(steps: u64) -> f64 { |
| 2047 | PROVE_SETUP_SECS + PROVE_SECS_PER_BCOST * (steps as f64 / 1e9) |
| 2048 | } |
| 2049 | |
| 2050 | /// Whole-workload prove-time estimate over a partition's per-shard step counts. |
| 2051 | pub struct ProveEstimate { |
| 2052 | /// Σ predicted guest STEPS over all shards (incl. per-shard floor + ingress). |
| 2053 | pub total_steps: u64, |
| 2054 | /// Sum of per-shard leaf prove times — wall clock with a single prover. |
| 2055 | pub seq_secs: f64, |
| 2056 | /// Wall clock with `parallelism` provers; `seq_secs` at parallelism 1. |
| 2057 | pub wall_secs: f64, |