Technical interview guide

Cryptographic Primitives for Blockchain

The hashing, digital signature, and Merkle tree building blocks every blockchain is constructed from.

Read: 42 min
Practice MCQs: 25
Interview QA: 25
Edition: v3
Editorial status: Reviewed
Relevant for: Blockchain Developer

Scope: NIST FIPS 180-4 (revision planned), FIPS 186-5 with published errata status reviewed 2026-09-04, SP 800-57 Part 1 Rev. 5, SP 800-186, RFC 6979, Bitcoin and Ethereum protocol documentation reviewed 2026-09-04.

Interview QA

Treat each question like a live interview question: answer out loud first (structure, assumptions, tradeoffs), then open the model answer to spot gaps and rehearse a tighter follow-up.

Curated: 2026-10-05 · Written: 2026-10-05 · Reviewed: 2026-10-03

QA-1

Explain what a block hash proves and what it does not prove.

QA-2

Contrast preimage, second-preimage, and collision resistance.

QA-3

Compare lattice-based and hash-based signatures for blockchain integration, focusing on verification cost, signature size, and stateful vs stateless trade-offs.

QA-4

Specify canonical bytes for a signed blockchain request.

QA-5

Prevent cross-chain and cross-protocol signature replay.

QA-6

Explain the evidence and limitations of a blockchain signature.

QA-7

Protect ECDSA nonce generation in a signing service.

QA-8

Design strict public-key validation for a multi-chain verifier.

QA-9

Handle signature malleability and transaction identity safely.

QA-10

How do Merkle trees, Verkle trees, and polynomial commitment accumulators (like KZG) compare for blockchain state commitments and proof sizes?

QA-11

Verify a Merkle membership proof defensively.

QA-12

How do threshold ECDSA schemes and on-chain multisignatures compare in on-chain footprint and round interactivity?

QA-13

Compare membership and non-membership proofs.

QA-14

Explain why data availability is separate from Merkle validity.

QA-15

Establish trust in a root used by a light client.

QA-16

Design a production blockchain signing service.

QA-17

Create a compromise-response runbook for an on-chain authority key.

QA-18

Use hierarchical deterministic wallets without expanding compromise impact.

QA-19

Design secure mnemonic backup and recovery UX.

QA-20

Design key rotation for an immutable smart-contract system.

QA-21

Plan migration from a blockchain signature algorithm.

QA-22

Prepare a blockchain application for post-quantum migration.

QA-23

Select and govern a cryptographic dependency.

QA-24

Design a fail-closed signed-request verification pipeline.

QA-25