All challenges

Recover a hidden modular exponent from timing queries to the original interactive device.

Optimize mixed-precision linear, bias, and GELU CUDA computation.

Pair mineral slices by kind using the Frontier-CS hidden pairing instances.

Find indices holding the two median permutation values.

Report the static localization verdict for a maze-distance source instance.

Locate the maximum value in a hidden permutation using second-maximum interval queries.

Select a large independent set for an undirected graph.

Select a large clique in an undirected graph.

Assign Boolean variables to satisfy as many two-literal clauses as possible.

Optimize a Boolean assignment for a medium three-literal CNF instance.

Partition graph vertices to maximize crossing edges.

Find the k-th value in a hidden sorted matrix through the original Frontier-CS query protocol.