Lightweight transformer module that learns query tokens to extract useful features from vision encoders for multimodal models.

Mapping from state‑action pairs to expected returns, often approximated with neural networks.

Model‑free reinforcement learning algorithm that learns action‑value functions to maximize cumulative reward.

Parameter‑efficient fine tuning approach that combines low‑rank adaptation with quantized base weights to cut VRAM use.

Tabular representation of Q‑values for discrete state and action spaces.

Expected return of taking an action in a state under a policy, central to Q‑learning and DQN.

Quantum Approximate Optimization Algorithm, hybrid method for solving combinatorial optimization problems.

Wallet UX pattern that encodes addresses or requests as QR codes for easy scan‑to‑pay on mobile.

Blockchain project using XMSS hash‑based signatures to provide quantum‑resistant security.

Lattice‑based digital signature scheme proposed for post‑quantum use, not selected in NIST’s final standardization.

Public goods funding mechanism where many small donations receive higher matching than a few large ones, encouraging broad support.

Voting mechanism where the cost of additional votes grows quadratically, balancing intensity and fairness.

Compressing model weights and activations to lower precision, for example 8‑bit or 4‑bit, to reduce memory and speed up inference.

Training procedure that simulates low‑precision arithmetic during training to preserve accuracy after quantization.

When a quantum algorithm or device performs a task faster or cheaper than classical methods.

Heuristic quantum technique for finding low‑energy solutions to optimization problems, typically via annealers.

Technique for establishing shared keys with security based on quantum physics, eavesdropping is detectable.

Entropy source that uses quantum phenomena to produce truly random bits, useful for cryptography.

Controversial milestone where a quantum device performs a specific task infeasible for any classical computer.

Also called post‑quantum, schemes designed to resist quantum attacks, for example lattice‑based signatures and KEMs.

High probability that a block will not be reverted after several confirmations, typical for Nakamoto consensus.

Optimization formulation targeted by quantum annealers and used to encode combinatorial problems.

Throughput metric for APIs, indexers, and RPC endpoints measuring how many queries are handled per second.

Execution strategy chosen by a database or indexer to answer a query efficiently.

Transformer mechanism computing attention weights from queries and keys to mix values across tokens.

UDP‑based transport used in HTTP/3 and libp2p that offers low latency, multiplexing, and better congestion control.

Minimum number of nodes that must agree to commit an operation, used in BFT and consensus protocols.

Aggregate signature or proof that a quorum of validators voted for a block, used in HotStuff‑style BFT.

Configuration of slices and thresholds that define which validator combinations form a quorum in FBAS.

Subset of validators sufficient to convince a node of agreement in federated Byzantine agreement systems like Stellar.