Verification Challenge: Fractional Cascading for Multi-Nuclide Grid Lookup

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autore principale: Siegel, Andrew R.
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866914094225817600
author Siegel, Andrew R.
author_facet Siegel, Andrew R.
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2510_13428
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Verification Challenge: Fractional Cascading for Multi-Nuclide Grid Lookup
Siegel, Andrew R.
Logic in Computer Science
D.2.4; I.6
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.
title Verification Challenge: Fractional Cascading for Multi-Nuclide Grid Lookup
topic Logic in Computer Science
D.2.4; I.6
url https://arxiv.org/abs/2510.13428