Privacy metric ensuring each record is indistinguishable from at least k‑1 others.

Metric for viral growth in product loops; sometimes applied to protocol network effects.

Unsupervised algorithm that partitions data into k clusters by minimizing within‑cluster variance.

Non‑parametric method that classifies or regresses based on the majority of nearest samples.

Distributed hash table used in P2P networks for efficient node and content discovery.

Distributed log used by indexers and analytics stacks to process on‑chain events at scale.

Function like PBKDF2, scrypt, or Argon2 used to derive keys from passwords or seeds securely.

Hash function used by Ethereum for addresses and ABI encoding; close to SHA‑3 but not identical.

Automation agent that performs on‑chain tasks like liquidations, rebalances, or upkeep jobs.

Technique that implicitly maps data into higher dimensions for linear separation via kernel functions.

Cryptographic public and private keys used for signing and address derivation.

Practice of replacing cryptographic keys periodically to limit blast radius of compromise.

Wallet that uses multi‑party computation to split signing across devices, avoiding a single private key.

Encrypted JSON format that stores a private key using a KDF and cipher; often called V3 keystore.

Hardware or cloud service for generating, storing, and using keys with strong access controls.

Corpus of documents indexed by embeddings to ground LLM responses via retrieval‑augmented generation.

Date after which a model’s training data does not include events, requiring tools or browsing.

Technique where a smaller student model learns from a larger teacher’s soft targets or explanations.

Graph of entities and relations used for search, reasoning, and RAG pipelines.

Experimental network for Polkadot used to test features and parachains with real value.

Database that stores values indexed by keys; common in node state and indexers.

Regulatory process for verifying user identity in exchanges, on‑ramps, and compliant dApps.

Monitoring transactions for risk signals like sanctions exposure, mixers, or stolen funds.

Collaborative trusted setup that generates structured reference strings for KZG commitments.

Binding, hiding commitment to a polynomial used to verify evaluations succinctly.

Proof that verifies multiple polynomial evaluations simultaneously, reducing overhead.

Proof that a committed polynomial evaluates to a claimed value at a point without revealing coefficients.

Commitment scheme (Kate‑Zaverucha‑Goldberg) enabling succinct proofs of polynomial evaluations; used for data availability and blobs.