An off-chain computation service that executes complex operations and returns results with zero-knowledge proofs of correctness verified on-chain. ZK coprocessors extend smart contract capabilities beyond gas limits by outsourcing intensive computation while maintaining trustless verification. Projects like Brevis, RISC Zero Steel, and Lagrange enable dApps to access verified off-chain computation.
Comece pela explicação mais curta e útil antes de aprofundar.
An off-chain computation service that executes complex operations and returns results with zero-knowledge proofs of correctness verified on-chain. ZK coprocessors extend smart contract capabilities beyond gas limits by outsourcing intensive computation while maintaining trustless verification. Projects like Brevis, RISC Zero Steel, and Lagrange enable dApps to access verified off-chain computation.
Use primeiro a analogia curta para raciocinar melhor sobre o termo quando ele aparecer em código, docs ou prompts.
Pense nisso como um bloco de construção que ajuda a ligar uma definição isolada ao sistema maior onde ela vive.
Coloque o termo dentro da camada de Solana em que ele vive para raciocinar melhor sobre ele.
Falhas, auditorias, superfícies de ataque e padrões seguros.
Transforme o termo de vocabulário em algo operacional para produto e engenharia.
Este termo destrava conceitos adjacentes rapidamente, então funciona melhor quando você o trata como um ponto de conexão, não como definição isolada.
Use este bloco compacto quando quiser dar contexto aterrado para um agente ou assistente sem despejar a página inteira.
ZK Coprocessor (zk-coprocessor) Categoria: Segurança Definição: An off-chain computation service that executes complex operations and returns results with zero-knowledge proofs of correctness verified on-chain. ZK coprocessors extend smart contract capabilities beyond gas limits by outsourcing intensive computation while maintaining trustless verification. Projects like Brevis, RISC Zero Steel, and Lagrange enable dApps to access verified off-chain computation. Aliases: ZK Data Coprocessor Relacionados: Zero-Knowledge Proofs (ZKP), ZK-EVM
Use contexto do glossário, relações entre termos, modelos mentais e builder paths para receber respostas estruturadas em vez de output genérico.
Opcional: cole código Anchor, Solana ou Rust para o Copilot mapear primitivas de volta para termos do glossário.
O Copilot vai responder usando o termo atual, conceitos relacionados, modelos mentais e o grafo ao redor do glossário.
Esses ramos mostram quais conceitos esse termo toca diretamente e o que existe uma camada além deles.
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.
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.
Estes são os próximos conceitos que valem abrir se você quiser que este termo faça mais sentido dentro de um workflow real de Solana.
Entradas de glossário só ficam úteis quando estão conectadas. Esses links são o caminho mais curto para ideias adjacentes.
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.
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.
Essas entradas vivem ao lado do termo atual e ajudam a página a parecer parte de um grafo maior, não um beco sem saída.
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.
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.
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.
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.