Glossary OS

Lectura rápida

Empieza por la explicación más corta y útil antes de profundizar.

A cryptographic technique where a zero-knowledge proof verifies the correctness of another proof, enabling incremental verification of unbounded computations and proof aggregation. Recursive composition allows a single compact proof to attest to an arbitrarily long chain of computations, essential for rollup proof aggregation and reducing on-chain verification costs. Systems like Plonky2, Halo2, and Nova implement recursive proving.

Modelo mental

Usa primero la analogía corta para razonar mejor sobre el término cuando aparezca en código, docs o prompts.

Piensa en esto como un bloque de construcción que conecta una definición aislada con el sistema mayor donde vive.

Contexto técnico

Ubica el término dentro de la capa de Solana en la que vive para razonar mejor sobre él.

Fallos, auditorías, superficies de ataque y patrones seguros.

Por qué le importa a un builder

Convierte el término de vocabulario en algo operacional para producto e ingeniería.

Este término desbloquea conceptos adyacentes rápido, así que funciona mejor cuando lo tratas como un punto de conexión y no como una definición aislada.

Handoff para IA

Usa este bloque compacto cuando quieras dar contexto sólido a un agente o asistente sin volcar toda la página.

Recursive Proofs (recursive-proofs)
Categoría: Seguridad
Definición: A cryptographic technique where a zero-knowledge proof verifies the correctness of another proof, enabling incremental verification of unbounded computations and proof aggregation. Recursive composition allows a single compact proof to attest to an arbitrarily long chain of computations, essential for rollup proof aggregation and reducing on-chain verification costs. Systems like Plonky2, Halo2, and Nova implement recursive proving.
Aliases: Proof Recursion, Proof Aggregation
Relacionados: Zero-Knowledge Proofs (ZKP), ZK-EVM

Glossary Copilot

Haz preguntas de Solana con contexto aterrizado sin salir del glosario.

Usa contexto del glosario, relaciones entre términos, modelos mentales y builder paths para recibir respuestas estructuradas en vez de output genérico.

Abrir workspace completa del Copilot

Pregunta

Explicar este código

Opcional: pega código Anchor, Solana o Rust para que el Copilot mapee primitivas de vuelta al glosario.

Haz una pregunta aterrizada en el glosario

El Copilot responderá usando el término actual, conceptos relacionados, modelos mentales y el grafo alrededor del glosario.

Grafo conceptual

Ve el término como parte de una red, no como una definición aislada.

Estas ramas muestran qué conceptos toca este término directamente y qué existe una capa más allá de ellos.

Rama

Zero-Knowledge Proofs (ZKP)

A zero-knowledge proof is a cryptographic protocol by which a prover convinces a verifier that a statement is true — for example, that a state transition is valid — without revealing any information beyond the truth of the statement itself, satisfying the properties of completeness, soundness, and zero-knowledge. In Solana's ecosystem, ZKPs are used by ZK Compression (via Groth16 SNARKs) to prove correct state transitions for compressed accounts without storing full account state on-chain, and by the Token-2022 Confidential Transfers extension (via ElGamal encryption and range proofs) to prove token balances are non-negative without revealing the actual amounts. Solana's BPF VM exposes the alt_bn128 elliptic curve syscall to make on-chain Groth16 proof verification computationally feasible within the 1.4M compute unit budget.

Groth16 PLONK

Abrir término

Rama

ZK-EVM

A zero-knowledge virtual machine that generates cryptographic validity proofs for Ethereum-compatible smart contract execution, enabling ZK rollups that run existing Solidity code. Vitalik Buterin's Type 1-4 classification captures the trade-off between full Ethereum equivalence (Type 1, slower proving) and modified execution (Type 4, faster proving). Major implementations include Polygon zkEVM, zkSync Era, Scroll, and Linea.

Rollup

Abrir término

Siguientes conceptos para explorar

Mantén la cadena de aprendizaje en movimiento en lugar de parar en una sola definición.

Estos son los siguientes conceptos que vale la pena abrir si quieres que este término tenga más sentido dentro de un workflow real de Solana.

Compresión ZK

Zero-Knowledge Proofs (ZKP)

A zero-knowledge proof is a cryptographic protocol by which a prover convinces a verifier that a statement is true — for example, that a state transition is valid — without revealing any information beyond the truth of the statement itself, satisfying the properties of completeness, soundness, and zero-knowledge. In Solana's ecosystem, ZKPs are used by ZK Compression (via Groth16 SNARKs) to prove correct state transitions for compressed accounts without storing full account state on-chain, and by the Token-2022 Confidential Transfers extension (via ElGamal encryption and range proofs) to prove token balances are non-negative without revealing the actual amounts. Solana's BPF VM exposes the alt_bn128 elliptic curve syscall to make on-chain Groth16 proof verification computationally feasible within the 1.4M compute unit budget.

Abrir término

Seguridad

ZK-EVM

A zero-knowledge virtual machine that generates cryptographic validity proofs for Ethereum-compatible smart contract execution, enabling ZK rollups that run existing Solidity code. Vitalik Buterin's Type 1-4 classification captures the trade-off between full Ethereum equivalence (Type 1, slower proving) and modified execution (Type 4, faster proving). Major implementations include Polygon zkEVM, zkSync Era, Scroll, and Linea.

Abrir término

Seguridad

Reentrancia (Solana)

In Solana's context, reentrancy refers to a scenario during a CPI call where the called program invokes back into the calling program (direct reentrancy) or into a shared mutable account via a third program (indirect reentrancy), potentially causing the calling program to re-execute logic with state that has been partially modified by the intervening CPI. The Solana runtime prevents direct same-program reentrancy at the VM level — a program cannot CPI into itself — but indirect reentrancy through mutable shared accounts is possible and can cause account-reloading vulnerabilities where a program's cached account data becomes stale. Programs should reload account state after every CPI that may have modified shared accounts and avoid assuming pre-CPI state invariants hold afterward.

Abrir término

Seguridad

Property-Based Testing

A testing methodology where developers define properties (invariants) that must hold true for all valid inputs, and a test framework generates random inputs to attempt to falsify those properties. Unlike unit tests that check specific examples, property-based testing explores the input space stochastically. For Solana programs, properties might include 'total token supply never changes during transfers' or 'only the authority can modify the config account.' Tools like Trident and proptest support this approach.

Abrir término

Términos relacionados

Sigue los conceptos que realmente le dan contexto a este término.

Las entradas del glosario se vuelven útiles cuando están conectadas. Estos enlaces son el camino más corto hacia ideas adyacentes.

Compresión ZKzk-proofs

Zero-Knowledge Proofs (ZKP)

A zero-knowledge proof is a cryptographic protocol by which a prover convinces a verifier that a statement is true — for example, that a state transition is valid — without revealing any information beyond the truth of the statement itself, satisfying the properties of completeness, soundness, and zero-knowledge. In Solana's ecosystem, ZKPs are used by ZK Compression (via Groth16 SNARKs) to prove correct state transitions for compressed accounts without storing full account state on-chain, and by the Token-2022 Confidential Transfers extension (via ElGamal encryption and range proofs) to prove token balances are non-negative without revealing the actual amounts. Solana's BPF VM exposes the alt_bn128 elliptic curve syscall to make on-chain Groth16 proof verification computationally feasible within the 1.4M compute unit budget.

Abrir término

Seguridadzk-evm

ZK-EVM

A zero-knowledge virtual machine that generates cryptographic validity proofs for Ethereum-compatible smart contract execution, enabling ZK rollups that run existing Solidity code. Vitalik Buterin's Type 1-4 classification captures the trade-off between full Ethereum equivalence (Type 1, slower proving) and modified execution (Type 4, faster proving). Major implementations include Polygon zkEVM, zkSync Era, Scroll, and Linea.

Abrir término

Más en la categoría

Quédate en la misma capa y sigue construyendo contexto.

Estas entradas viven junto al término actual y ayudan a que la página se sienta parte de un grafo de conocimiento más amplio en lugar de un callejón sin salida.

Seguridad

Missing Signer Check

A vulnerability where a program accepts an account in a privileged role (e.g., admin, authority, payer) without verifying that the account actually signed the transaction, allowing any caller to impersonate that authority by simply passing the target pubkey as an instruction account. In native Solana programs, the check requires asserting account.is_signer == true; in Anchor, the Signer<'info> type enforces this automatically. Exploitation lets an attacker bypass all access control gated on authority equality checks, making it one of the most critical and commonly audited vulnerabilities in Solana programs.

Abrir término

Seguridad

Missing Owner Check

A vulnerability where a program deserializes and trusts account data without first confirming that the account is owned by the expected program, allowing an attacker to substitute a maliciously crafted account owned by a different program whose byte layout happens to satisfy the deserialization. On Solana, every account stores a 32-byte owner field set to the program that created it; native programs must assert account.owner == &expected_program_id, while Anchor's Account<'info, T> wrapper performs this check automatically. Failure to validate ownership can lead to complete auth bypass if an attacker can construct a fake account whose data parses into a struct with elevated privileges.

Abrir término

Seguridad

Arbitrary CPI

A vulnerability where a program accepts an arbitrary program account from the caller and invokes it via Cross-Program Invocation (CPI) without verifying it matches a known, trusted program ID, effectively letting an attacker substitute a malicious program that executes under the victim program's authority or manipulates accounts the victim program passes to it. A common pattern is accepting a token_program account without checking it equals spl_token::ID, so the attacker passes a lookalike program that records or drains account data. Prevention requires hard-coding or explicitly checking the program ID before every CPI call.

Abrir término

Seguridad

PDA Substitution Attack

A vulnerability where a program derives a PDA internally but accepts an externally supplied account as that PDA without re-deriving and comparing the address, allowing an attacker to pass a different PDA (derived from attacker-controlled seeds) that the program will treat as legitimate. Because PDAs are deterministic, the only way to guarantee account identity is to call Pubkey::find_program_address (or equivalent) with the expected seeds inside the program and assert the result equals the supplied key. Anchor's seeds and bump constraints on the Account type automate this re-derivation and equality check.

Abrir término