The problem of reproducibility of experiments in optimizing validator allocation in blockchain networks with Proof of Stake consensus was investigated, in particular due to the absence of standardized datasets and unified testing methods, which complicates the objective comparison of algorithms. To tackle this issue, we propose a method for building test datasets that rely on deterministic pseudorandom sequence generators and validator profiles calibrated against Ethereum network statistics. Each validator is described by a set of parameters that includes the stake size with the minimum requirement according to Ethereum standards, performance with a uniform distribution, reliability in a high range, network delays depending on the geographical proximity of participants, geographical location according to the actual statistics of validator distribution by regions, quality of network connection, and slashing history according to the violation statistics in the Beacon Chain. Three datasets of different scales were created for small, medium, and large network configurations with fixed initial values of the generators to ensure full reproducibility of experiments. A multi-criteria evaluation system was developed based on a generalized quality indicator that maximizes system throughput and minimizes load imbalance and network delays with scientifically grounded weighting coefficients. The tenfold testing protocol ensures the statistical reliability of results and reduces the impact of randomness on conclusions. The experiments conducted a comparative analysis of four allocation algorithms: a hybrid metaheuristic method based on particle swarm optimization with local search, random allocation with correction, an adapted Ethereum shuffling mechanism, and a greedy algorithm. The experimental results revealed scale-dependent efficiency of the algorithms: the hybrid method provides high optimization quality at all investigated scales, but quadratic growth of execution time limits its application to periodic offline planning of network configuration; the shuffling mechanism demonstrates stable medium-quality results with fast execution; the random method is characterized by moderate speed with variable results; the greedy algorithm shows maximum speed with deterministic results but variable efficiency depending on the network scale. The proposed method forms a basis for standardizing experimental research in Proof of Stake consensus systems. It ensures the objective comparison of new algorithmic solutions for validator allocation in decentralized blockchain networks.
Demenko et al. (Tue,) studied this question.