Blockchain has become increasingly popular for data management in recent years. However, the existing blockchain systems lack efficient semantic queries, particularly keyword queries. To address this issue, we propose a learned-index-based semantic keyword query architecture on blockchain. First, our architecture records data semantics information to support semantic keyword queries. Second, we establish the lookup table index for semantic information among blocks and the block-level recursive model index for blocks to improve the query efficiency. We store the lookup table in the extended block headers to maintain the result’s completeness, and we store recursive model indexes off chain to optimize the maintenance efficiency. Third, we propose a verifiable query algorithm based on our proposed architecture to maintain the result’s correctness. Finally, the experimental results show that combining the lookup table and the learned index effectively improves the query efficiency on blockchain.
Constrained Reinforcement Learning (CRL) aims to optimize decision-making policies under constraint conditions, making it highly applicable to safety-critical domains such as autonomous driving, robotics, and power grid management. However, existing robust CRL approaches predominantly focus on single-step perturbations and temporally independent adversarial models, lacking explicit modeling of robustness against temporally coupled perturbations. To tackle these challenges, we propose TCRL, a novel temporal-coupled adversarial training framework for robust constrained reinforcement learning (TCRL) in worst-case scenarios. First, TCRL introduces a worst-case-perceived cost constraint function that estimates safety costs under temporally coupled perturbations without the need to explicitly model adversarial attackers. Second, TCRL establishes a dual-constraint defense mechanism on the reward to counter temporally coupled adversaries while maintaining reward unpredictability. Experimental results demonstrate that TCRL consistently outperforms existing methods in terms of robustness against temporally coupled perturbation attacks across a variety of CRL tasks.