Compressed Permutation Oracle

• Compressed Permutation Oracle is a dual-concept interface that encodes both static and quantum random permutations without full reconstruction.
• It leverages monotone runs, strict runs, and LRM-partitions to optimize space and speed in adaptive sorting and query evaluation.
• In quantum settings, it records partial injective knowledge to support forward and inverse superposition queries with rigorous security bounds.

Searching arXiv for relevant papers on compressed permutation oracles and related permutation compression / quantum compressed oracles. A compressed permutation oracle is an encoded permutation interface that supports oracle-style evaluation without reconstructing the full permutation explicitly. In the data-structural literature, it denotes a compressed succinct representation of a static permutation $\pi:[1..n]\to[1..n]$ supporting both $\pi(i)$ and $\pi^{-1}(i)$, with space and time governed by structural regularities such as runs, strict runs, shuffled upsequences, and LRM-partitions (0902.1038, 0911.4981, Barbay et al., 2010, Barbay et al., 2011). In the quantum-oracle literature, the same phrase denotes a compressed-oracle framework for a uniformly random permutation, typically with forward and inverse superposition access, where a small partial database or path record is intended to capture what a $q$-query algorithm can have learned about the hidden permutation (Rosmanis, 2021, Majenz et al., 2024, Carolan, 23 Sep 2025, Foxman et al., 29 Jun 2026).

1. Terminological scope and oracle models

The expression “compressed permutation oracle” has two established meanings. The first arises in succinct data structures and adaptive sorting. There, the hidden object is a fixed permutation $\pi$ over $[1..n]$, and the objective is to store $\pi$ in fewer than the usual $n\lg n$ bits when $\pi$ has exploitable monotone structure, while still answering $\pi(i)$ and $\pi(i)$0 efficiently. The second arises in quantum cryptography and quantum query complexity. There, the hidden object is a uniformly random permutation $\pi(i)$1, queried in superposition, often in both forward and inverse directions, and the objective is to replace the full purified truth table by a smaller or more interpretable state that records only the information effectively learned by the adversary (Barbay et al., 2010, Carolan, 23 Sep 2025).

Research line	Hidden object	Oracle interface
Succinct data structures	Static permutation $\pi(i)$2 on $\pi(i)$3	$\pi(i)$4, $\pi(i)$5
Quantum compressed oracles	Uniform random permutation $\pi(i)$6	Forward and inverse superposition queries

This dual usage creates a frequent misconception. In the static setting, “compressed” refers to space bounded by entropy-like disorder measures of the permutation itself. In the quantum setting, “compressed” refers to a stateful oracle representation or proof technique; it need not be a compact implementation in the ordinary RAM sense. A related misconception is that a compressed permutation oracle is merely an index over an explicitly stored permutation. The data-structural papers state the stronger notion: an integrated encoding of $\pi(i)$7 that itself answers the permutation-oracle operations (Barbay et al., 2010).

2. Entropy-compressed static permutation representations

The classical line begins from the observation that a permutation can be substantially smaller than $\pi(i)$8 bits if it decomposes into a small or low-entropy collection of monotone pieces. The foundational framework in “Compressed Representations of Permutations, and Applications” (0902.1038) studies contiguous runs, strict runs, and shuffled upsequences. For a length vector $\pi(i)$9 summing to $\pi^{-1}(i)$0, the central parameter is

$\pi^{-1}(i)$1

This entropy drives both compressed space and adaptive running time. In the run-based representation of (0902.1038), a permutation covered by $\pi^{-1}(i)$2 runs of lengths $\pi^{-1}(i)$3 is encoded in at most

$\pi^{-1}(i)$4

bits, with $\pi^{-1}(i)$5 and $\pi^{-1}(i)$6 supported in $\pi^{-1}(i)$7 time and average $\pi^{-1}(i)$8 time. The same work gives strict-run and shuffled-upsequence variants, and also explains how these encodings can be combined with cycle decompositions to support iterated queries $\pi^{-1}(i)$9 (0902.1038).

“On Compressing Permutations and Adaptive Sorting” refines this line by representing a permutation as the merge history of monotone pieces in a wavelet-tree-like structure shaped by Huffman coding on run lengths (Barbay et al., 2011). For $q$0 contiguous ascending or monotone runs with length vector $q$1, the principal bound is

$q$2

bits, with $q$3 and $q$4 in worst-case

$q$5

time and average

$q$6

time, and a multiary version improves this to worst-case

$q$7

and average

$q$8

The same paper extends the framework to strict runs, shuffled upsequences, and shuffled monotone sequences, and ties the same entropy parameters to adaptive sorting bounds (Barbay et al., 2011).

A parallel route appears in “Efficient Fully-Compressed Sequence Representations” (0911.4981). Instead of designing a permutation-specific code from scratch, that paper reduces permutation queries to sequence queries on compressed run-label strings. For a permutation consisting of $q$9 interleaved increasing or decreasing runs of lengths $\pi$0, it stores two sequences $\pi$1 over alphabet $\pi$2 together with one direction bit per run, obtaining

$\pi$3

bits and $\pi$4-time support for both $\pi$5 and $\pi$6. For contiguous runs, one label sequence becomes trivial, reducing the bound to

$\pi$7

bits, with $\pi$8 in $\pi$9 time and $[1..n]$0 in $[1..n]$1 time (0911.4981).

3. LRM-trees and LRM-partition oracles

The LRM-tree line replaces classical run decompositions by a decomposition extracted from previous-smaller-value structure. For an array $[1..n]$2, with $[1..n]$3,

$[1..n]$4

The LRM-tree $[1..n]$5 has parent $[1..n]$6 for node $[1..n]$7, and when $[1..n]$8 is a permutation $[1..n]$9, every downward path is increasing. The key new decomposition in “LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations” is the LRM-Partition: recursively choose a longest root-to-leaf path, called the spinal chord, remove it, and continue on the remaining forest. All resulting subsequences are increasing, and every LRM-partition has exactly $\pi$0 subsequences, although the partition is not necessarily unique (Barbay et al., 2010).

If the subsequence lengths are $\pi$1, the entropy is

$\pi$2

The paper states that the LRM-partition is “never worse and often better” than the ordinary run partition in terms of entropy. This entropy is then used as the compressibility parameter for the permutation oracle. The representation combines two ingredients: a succinct representation of the LRM-partition itself, and a merge encoding from Barbay and Navarro over the sorted subsequences exposed by the partition (Barbay et al., 2010).

The partition support structure is encoded as a forest of ordinal trees in balanced parentheses using

$\pi$3

supporting in constant time the two fundamental operators $\pi$4, mapping an original position $\pi$5 to its subsequence identifier and local rank, and $\pi$6, performing the inverse map. On top of this, the merge encoding stores the interleaving of the subsequences in at most

$\pi$7

bits, supporting $\pi$8 and $\pi$9 in worst-case

$n\lg n$0

time and average

$n\lg n$1

time when $n\lg n$2 is chosen uniformly from $n\lg n$3. The total construction time is

$n\lg n$4

The paper’s worked example,

$n\lg n$5

has unique LRM-partition

$n\lg n$6

illustrating how forward and inverse permutation queries are reduced to a partition map followed by a merge-encoding query (Barbay et al., 2010).

4. Quantum compressed-oracle constructions for random permutations

The quantum version of the problem begins from a different obstruction: a random permutation is globally correlated. In the purified truth-table picture, the random-permutation state is a superposition over all collision-free assignments, so the registers are entangled from the outset. This blocks the most direct extension of Zhandry’s compressed oracle for random functions (Carolan, 23 Sep 2025).

An early compressed-oracle-style resolution appears in “Tight Bounds for Inverting Permutations via Compressed Oracle Arguments” (Rosmanis, 2021). Instead of a local table, that paper decomposes the oracle Hilbert space into subspaces spanned by uniform superpositions over partial injective assignments. If $n\lg n$7 is the span of assignments of weight $n\lg n$8 and $n\lg n$9 is the span of those assignments whose image already contains $\pi$0, the construction isolates orthogonal “low” and “high” sectors and proves that after $\pi$1 oracle calls, the state remains supported on knowledge states of size at most $\pi$2. The resulting inversion bound is

$\pi$3

“Permutation Superposition Oracles for Quantum Query Lower Bounds” introduces a different exact simulation based on the unique strictly monotone factorization

$\pi$4

For uniformly random $\pi$5, the $\pi$6 are independent and uniform, which restores a product-like hidden state even though $\pi$7 and $\pi$8 are globally dependent. The paper develops active and inverse-active transposition sets, proves exact simulation of a random permutation and its inverse in superposition, and derives a general lower bound for any relation $\pi$9: $\pi(i)$0 where

$\pi(i)$1

This yields, among other applications, unconditional lower bounds for one-round sponge preimage search and for double-sided zero search (Majenz et al., 2024).

5. Partial injective databases, soundness, and cryptographic applications

A more direct “database” formulation appears in “Compressed Permutation Oracles” (Carolan, 23 Sep 2025). There the compressed permutation oracle maintains a purifying register consisting of a partial injective database

$\pi(i)$2

intended to record the input-output pairs that the adversary has meaningfully learned. For forward queries, the local compression operator swaps the undefined basis state $\pi(i)$3 with the uniform superposition over fresh assignments

$\pi(i)$4

and inverse queries are handled by a flip operator

$\pi(i)$5

The resulting compressed permutation oracle is

$\pi(i)$6

The main soundness theorem states that for a $\pi(i)$7-query quantum algorithm,

$\pi(i)$8

The compressed database grows by at most one pair per query, formalized by

$\pi(i)$9

The paper further proves a permutation analogue of Zhandry’s fundamental lemma, showing that if an adversary can output $\pi(i)$00 correct input-output pairs of the real permutation, then, up to an additive $\pi(i)$01 term, those pairs must already appear in the compressed database (Carolan, 23 Sep 2025).

These structural statements are then used to settle several cryptographic and query-complexity problems. The paper proves that seven-round Feistel is a strong qPRP, with distinguishing advantage bounded by

$\pi(i)$02

thereby resolving the open question of Zhandry on constant-round Feistel in the strongest quantum permutation model. It also re-proves lower bounds for sponge and Davies–Meyer preimage and collision resistance, and gives new lower bounds for cycle finding and the one-more problem (Carolan, 23 Sep 2025).

6. Generalization and conceptual synthesis

The most general current formulation is the path-recording oracle of “Quantum Lazy Sampling and Path Recording for Any Group” (Foxman et al., 29 Jun 2026). That paper defines an exact compressed-oracle simulation for Haar-random elements of any closed subgroup $\pi(i)$03. For the permutation case $\pi(i)$04, with in-place representation

$\pi(i)$05

the hidden memory is a superposition of path states

$\pi(i)$06

projected onto the legal subspace determined by the commutant algebra of the tensor-power representation. For $\pi(i)$07, this commutant is the partition algebra $\pi(i)$08. The update is written as

$\pi(i)$09

and Theorem 5.3 proves exact equivalence with a truly random permutation oracle. One application is a direct comparison between $\pi(i)$10 and $\pi(i)$11, yielding the pseudorandom-unitary construction $\pi(i)$12, where $\pi(i)$13 is a pseudorandom permutation and $\pi(i)$14 a random Clifford (Foxman et al., 29 Jun 2026).

A complementary conceptual result is provided by “The Compressed Oracle is a Worthy (Multiplicative) Adversary” (Jeffery et al., 9 Sep 2025). That paper does not itself give a general compressed permutation oracle, but it shows that compressed-oracle reasoning is captured by a restricted multiplicative adversary framework, MLADV. In the permutation setting it recovers a Rosmanis-style inversion lower bound through layered partial-information subspaces, suggesting that compressed-oracle arguments and adversary methods are part of a common abstraction rather than disjoint techniques (Jeffery et al., 9 Sep 2025).

Taken together, these works show that “compressed permutation oracle” is not a single construction but a research area organized around one common principle: permutation access can often be replaced by a representation of the structure actually revealed by queries. In succinct data structures, that revealed structure is monotone order, runs, or LRM-partitions, and compression is measured in bits. In quantum cryptography, it is partial injective knowledge, active transpositions, or path records, and compression is measured by how little explicit information about the hidden permutation must be materialized. This suggests that the unifying content of the term is not a specific encoding scheme, but the replacement of full permutation materialization by a structured oracle state that preserves the essential query interface.