ceno-cli conntinuation proofs e2e #1094
Open
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
hero78119
changed the title
13 tasks
hero78119
force-pushed
the
feat/multi_shard_ceno_cli
branch
from
fec3589 to
a210d89
Compare
hero78119
commented
Oct 29, 2025
|
|
||
| // max cycle per shard | ||
| #[arg(long, default_value = "536870912")] // 536870912 = 2^29 | ||
| max_cycle_per_shard: u64, |
There was a problem hiding this comment.
Examples:
prover: 3
shard: 10
shards => [4, 3, 3]
prover: 4
shard: 10
shards => [3, 3, 2, 2]
hero78119
changed the title
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Build on top of #1092
change scopes
design rationales
prover_idandnum_proversare exposed as CLI arguments to specify the number of physical provers in a cluster, each mark with a prover_id. The overall trace data is divided intoshards, which are distributed evenly among the provers. The number of shards are in general agnostic to number of provers. Each prover is assignednshard where n can be even emptyShard distribution follows a balanced allocation strategy — for example, if there are 10 shards and 3 provers, the shard counts will be distributed as 3, 3, and 4, ensuring an even workload across all provers.