Degree to which predicted probabilities reflect true outcome frequencies; improved with temperature scaling.

Immutable input bytes provided to a contract call, accessible via calldata in Solidity; cheaper than memory.

Solidity data location specifier for function parameters, marking them as read‑only and non‑modifiable.

The officially supported cross‑chain bridge for a network, generally with security assumptions closest to the core protocol.

When a model forgets previously learned tasks while being trained on new tasks in sequence.

Loss function for multi‑class classification comparing predicted distributions to one‑hot targets.

Ability of a protocol to include valid transactions and data despite adversarial actors or regulators.

Custodial trading platform that holds user funds and matches orders off‑chain, opposite of a DEX.

Attestation scheme to show a custodian holds sufficient assets, ideally with liabilities proofs and user verification.

AMM design that maintains an invariant like x*y=k or more complex functions to price swaps.

Unique identifier for an EVM chain used to prevent replay across networks and select correct signer domain.

Event where the canonical chain switches to a different branch, replacing recent blocks due to consensus.

Prompting technique that encourages step‑by‑step reasoning traces from language models.

Periodically committed state summary that accelerates sync and helps finalize or validate recent history.

Hash‑based identifier used in IPFS and content‑addressed storage to reference immutable data.

Algorithm for encrypting and decrypting data, such as AES or ChaCha20.

Constraint system that encodes a computation for proving and verifying via zk‑SNARKs or zk‑STARKs.

Emergency mechanism to pause protocol actions during incidents; must be carefully governed to avoid centralization.

Software that executes transactions and maintains state for a blockchain, e.g., Geth, Erigon, Nethermind.

Security property achieved by distributing node share across multiple independent client implementations.

Bitcoin opcode enforcing absolute timelocks via block height or timestamp.

Neural network architecture using convolutions, effective for images, audio, and spatial data.

Special transaction that creates new coins and collects fees for the block producer or validator.

Privacy technique that combines many users’ UTXOs into a single transaction to break chain analysis.

Offline wallet or hardware device that stores keys away from internet‑connected systems.

Value of collateral relative to borrowed or issued assets; staying above thresholds avoids liquidation.

Two‑phase pattern where a hash commitment is posted first and the plaintext is revealed later, preventing front‑running.

Property that lets protocols and contracts interoperate like Lego blocks to form new applications.

Table summarizing classification results by true vs predicted labels to analyze errors.

The mechanism by which nodes agree on the state of the ledger, examples include Proof of Work and Proof of Stake.

Component responsible for validator sets, finality, and fork choice, e.g., Ethereum’s Beacon clients.

Storage where data is located by its hash rather than a path or URL, enabling immutability and deduplication.

Maximum sequence length a language model can attend to at once, measured in tokens.

Learning paradigm that pulls related samples together and pushes unrelated ones apart in embedding space.

Contract architecture where a proxy delegates calls to an implementation controlled by an admin or governance.

Technique for conditioning diffusion models with structural hints like edges, poses, or depth maps.

Process where researchers privately disclose issues, vendors patch, then public details are released responsibly.

Framework for building application‑specific blockchains using Tendermint/CometBFT consensus.

Smart contract platform for Cosmos chains using WebAssembly and Rust, enabling portable contracts.

Risk that the other party in a transaction fails to deliver, amplified in custodial or bridge setups.

Operations or messaging that move assets or data across different blockchains or layers.

Component in rollup stacks that passes messages between L1 and L2, often with a challenge period.

Security achieved by aligning incentives and penalties so that attacks are economically irrational.

Study of secure communication techniques, including hashing, signatures, and encryption.

Bitcoin opcode enforcing relative timelocks for spending UTXOs, enabling channels and vaults.

Proof‑of‑work algorithm based on finding cycles in large graphs, designed to be memory bound.

Total gas consumed by all transactions up to a given point within a block.

AMM optimized for like‑kind assets with low slippage using a stable‑swap invariant.

Liquidity pool on Curve for swapping correlated assets, often with gauges and incentives.

Wallet where a third party controls private keys on behalf of the user.