In post-quantum blockchain settings, objects that require validity proofs (e.g., blob roots, execution-layer or consensus-layer signature aggregates) must be broadcast through mempool and relay networks. Recursive STARKs have been proposed to aggregate such proofs so that each node forwards one proof per tick plus objects without proofs, capping per-node proof bandwidth at roughly 128 KB degree per tick. We observe that propagation does not inherently require validity proofs on the path-only a lightweight assurance that an object is eligible for relay. We present AR-ACE (ACE-GF-based Attestation Relay for PQC), in which relay nodes forward objects plus compact attestations (e.g., identity-bound signatures or commitments) and do not generate, hold, or forward any full validity proof. Only the builder (or final verifier) performs a single aggregated validity proof over the set of objects it includes. This proof-off-path design removes proof overhead from the propagation path entirely, yielding an order-of-magnitude reduction in proof-related relay bandwidth relative to proof-carrying propagation. When instantiated with ACE-GF-derived attestation keys, AR-ACE preserves a unified identity story with on-chain authorization and is PQC-ready. We specify a protocol model, state design goals and security considerations, define security games, and provide a structural bandwidth comparison with recursive-STARK-based propagation.

翻译：在后量子区块链环境中，需要有效性证明的对象（例如数据块根、执行层或共识层的签名聚合体）必须通过内存池和中继网络进行广播。已有研究提出采用递归STARK来聚合此类证明，使得每个节点每时钟周期仅转发一个证明加上无需证明的对象，将每个节点的证明带宽限制在每时钟周期约128 KB。我们观察到，传播过程本质上并不要求在路径上具备有效性证明——仅需一种轻量级的保证，确认对象具备中继资格即可。本文提出AR-ACE（基于ACE-GF的后量子密码学认证中继），在该方案中，中继节点转发对象及紧凑认证（例如身份绑定签名或承诺），但不生成、持有或转发任何完整的有效性证明。仅构建者（或最终验证者）对其包含的对象集合执行一次聚合有效性验证。这种证明离路径的设计彻底消除了传播路径上的证明开销，相较于携带证明的传播方案，可将中继带宽中与证明相关的部分降低一个数量级。当采用ACE-GF派生的认证密钥实例化时，AR-ACE保持了与链上授权相统一的身份管理体系，并具备后量子安全性。我们规范了协议模型，明确了设计目标与安全考量，定义了安全博弈，并提供了与基于递归STARK的传播方案的结构性带宽对比分析。