Blockchain validators can reduce block processing time by exploiting multi-core CPUs, but deterministic execution must preserve a given total order while respecting transaction conflicts and per-block runtime limits. This paper systematically examines how validators can exploit multi-core parallelism during both block construction and execution without violating blockchain semantics. We formalize two validator-side optimization problems: (i) executing an already ordered block on \(p\) cores to minimize makespan while ensuring equivalence to sequential execution; and (ii) selecting and scheduling a subset of mempool transactions under a runtime limit \(B\) to maximize validator reward. For both, we develop exact Mixed-Integer Linear Programming (MILP) formulations that capture conflict, order, and capacity constraints, and propose fast deterministic heuristics that scale to realistic workloads. Using Ethereum mainnet traces and including a Solana-inspired declared-access baseline (Sol) for ordered-block scheduling and a simple reward-greedy baseline (RG) for block construction, we empirically quantify the trade-offs between optimality and runtime.

翻译：区块链验证器可通过利用多核CPU减少区块处理时间，但确定性执行必须在遵循交易冲突与每区块运行时间限制的前提下保持既定全局顺序。本文系统研究了验证器如何在区块构建与执行阶段利用多核并行性而不违反区块链语义。我们形式化定义了两个验证器端优化问题：（i）在\(p\)个核心上执行已排序区块以最小化完工时间，同时确保与顺序执行的等价性；（ii）在运行时间限制\(B\)下选择并调度内存池交易子集以最大化验证器收益。针对这两个问题，我们建立了精确的混合整数线性规划（MILP）模型以捕捉冲突、顺序与容量约束，并提出可扩展至实际工作负载的快速确定性启发式算法。通过使用以太坊主网追踪数据，并引入受Solana启发的声明访问基线（Sol）用于有序区块调度，以及简单收益贪婪基线（RG）用于区块构建，我们实证量化了最优性与运行时间之间的权衡关系。