We present a verification challenge based on the fractional cascading (FC) technique for accelerating repeated searches across a collection of sorted arrays. The specific context is nuclear cross section lookup in a simulation code, where a material consists of many nuclides, each with its own sorted energy grid. A naive search performs a binary search in each array individually. The FC-based cascade grid structure reduces this cost by performing a single binary search followed by constant-time refinements. The challenge consists of verifying the correctness of the FC algorithm with respect to the naive approach and validating its structural properties.

翻译：本文提出一项基于分层级联技术的验证挑战，该技术旨在加速跨多个有序数组的重复搜索。具体应用场景为模拟代码中的核截面查找，其中材料由多种核素构成，每种核素拥有各自的有序能量网格。朴素搜索方法需在每个数组中单独执行二分查找。基于分层级联的级联网格结构通过执行单次二分查找及后续的常数时间精细化操作来降低计算开销。本挑战包含验证分层级联算法相对于朴素方法的正确性，并检验其结构特性。