Peer to peer networking layer that gossips blocks and transactions between nodes.

Layout optimization in EVM that packs smaller types into a single 32 byte slot to save gas.

Additively homomorphic public key encryption scheme used in privacy preserving analytics.

Cryptography using bilinear pairings on elliptic curves, enabling zkSNARKs and short signatures.

Sovereign chain that connects to a relay chain for shared security and messaging.

Execution strategy that allows independent tasks to proceed concurrently to increase throughput.

CAP property that a distributed system continues to operate despite network splits.

Using memory hard algorithms like Argon2 or scrypt with salt and pepper to store passwords safely.

Tool that generates and stores strong unique passwords, often with secure sharing and 2FA support.

Prefix tree with hash commitments used by Ethereum to store state with efficient proofs.

Bitcoin script type locking funds to a hash of a public key, redeemed with a signature.

Bitcoin script type that pays to the hash of a redeem script, enabling multisig and templates.

Component in account abstraction that sponsors gas for user operations under policy.

Off chain mechanism where parties exchange signed updates and settle on chain later.

Architecture that separates block building from proposing to mitigate MEV and improve decentralization.

Hiding and binding commitment scheme used in privacy protocols and zero knowledge proofs.

Family of methods that adapt large models by training a small subset of additional parameters.

Moving assets to and from a sidechain or bridge by locking on one chain and unlocking on the other.

Token designed to track the value of another asset like USD or BTC via collateral or algorithms.

Restricted access networks or features that require allow lists or governance approval.

Open access property of public networks where anyone can join, read, and write.

Derivative without expiry that tracks an index via funding payments between longs and shorts.

Common language modeling metric that measures how well a model predicts a sequence.

Social engineering attack where an adversary tricks a user into revealing secrets or signing malicious transactions.

Keeping IPFS content available by storing it on nodes that refuse to garbage collect the CID.

Training technique that splits model layers across devices and streams microbatches.

Early Ethereum scaling approach using child chains and exit games, largely replaced by rollups.

Plasma variant where each coin has its own history, reducing proof sizes for exits.

Mechanism tied to SHELL whereby users commit value to obtain computation and storage on the network.

Universal updatable zk SNARK protocol that supports arbitrary circuits with succinct proofs.

Fast zk proving system combining PLONK like constraints with FRI, optimized for recursion.

NFT badge that proves someone attended an event, often used for community engagement.

Scheme that lets a prover commit to a polynomial and later open evaluations with small proofs.

SNARK friendly hash function optimized for arithmetic circuits.

Method to inject token order information into transformer models.

Updated distribution over parameters after observing data, combines prior and likelihood.

Reinforcement learning algorithm that stabilizes updates with clipped objectives, used in RLHF.

Cryptographic schemes believed to be secure against quantum adversaries, such as lattices.

Built in contract address that exposes native cryptographic or system functions efficiently.

Hash property that makes it infeasible to find an input that maps to a given digest.

Data feed that publishes asset prices on chain for lending, liquidations, and derivatives.

Bidding war where bots raise gas fees to get transactions mined first, a source of MEV.

A secret number that controls a blockchain address, used to sign transactions. Must be kept offline and secure.

Pseudorandom number generator used for randomness in protocols and simulations.

Micropayment scheme where a sender issues lottery tickets with expected value equal to the price.

Consensus approach where validator selections and confirmations are probabilistic, enabling fast finality and parallelization on Acki Nacki.

Smart contract controlled privacy where viewing and spending rights are enforced by cryptography.

Crafting inputs and context to steer LLM outputs toward desired behavior and quality.

Attack where crafted text causes a model or agent to ignore instructions and exfiltrate data or perform actions.

PEFT method that learns a small set of continuous prompt vectors to condition a frozen model.

Consensus where a fixed set of approved validators produces blocks, trading openness for speed.

Consensus or allocation method where coins are provably destroyed to gain rights or bootstrap a chain.

Verifiable delay based sequence used by Solana to order events without relying on synchronized clocks.

Schemes that try to prove a unique human user without central authorities.

Proof that a storage provider has stored a unique encoding of data, not deduplicated copies.

Attestation that a custodian holds sufficient assets to cover liabilities, often with Merkle proofs.

Sybil resistance where miners commit disk space rather than compute power.

Proof that storage was provided over a period, used by decentralized storage networks.

Consensus where validators lock tokens to propose and attest blocks, earning rewards and risking slashing.

Consensus where miners expend energy to solve puzzles, securing the network and earning block rewards.

Liquidity controlled by a protocol treasury rather than rented from external LPs.

Upgradeable contract design where a proxy delegates calls to an implementation contract.

Cryptographic technique where a proxy can transform ciphertext from one key to another without learning the plaintext.

Removing parameters or neurons from a model or old states from a node to reduce size.

The cryptographic pair of a private key, shared publicly to derive addresses and verify signatures.

Publish subscribe protocol used to spread messages across a P2P network efficiently.

Payment pattern where recipients withdraw owed funds to avoid reentrancy and simplify refunds.

Payment pattern where the sender transfers funds directly to the recipient during execution.