Feedback
Sign in./start

Site navigation

Theme

Learn

  • Roadmaps

Build

  • Projects
  • Developer Tools

Contribute

  • Open Source Projects
  • Issues
  • Reviews
  • First Contribution
  • BountiesSoon
  • Feedback

Prove

  • Builders

Ecosystem

  • Partners
  • Get Funded↗
  • HackathonsSoon
Sign in./start-building

Become an Open Source Builder. Learn. Build. Contribute. Prove.

Feedback welcome — open a GitHub issue.

Learn

RoadmapsStart Building

Build

ProjectsDeveloper Tools

Contribute

Open Source ProjectsIssuesReviewsFirst ContributionSupportFeedback

Prove

Builders Directory

Account

Sign in

Legal

PrivacyTermsCredits

© 2026 Pull // code MIT · curriculum CC BY-SA 4.0

PrivacyTermsCredits

lesson // bitcoin

Multisig & Timelocks

Shared custody, CHECKMULTISIG, CSV, CLTV, and MuSig patterns.

intermediate5 days

Public lesson — sign in to track progress on this roadmap.

./sign-in

On this page

Learning objectives

  • Explain m-of-n multisig custody models
  • Use CLTV and CSV mental models correctly
  • Contrast on-chain multisig with aggregated MuSig/Taproot approaches

study // plan

Lessons are primers. Start with Step 1 (required reading) when present, then follow the numbered steps in the article. Depth comes from primary sources, labs, reflection, and evidence.

Research on Bitcoin Search
multisigBIP67

Step 1 // Required reading

Complete these before the numbered steps in the lesson body. Links are listed here once — not repeated below.

  • bookMastering Bitcoin

    Ch. 7: Authorization and Authentication

Reflection prompts

  1. Explain Multisig & Timelocks to a teammate without jargon - what problem does it solve?
  2. What would break in production if you misunderstood Multisig & Timelocks?
  3. Which BIP, book chapter, or Core doc is authoritative here, and what did you verify?

Lab // Policy sketch + BIP check

Complete Steps 2–3. Write a one-line custody policy (m-of-n and/or recovery after delay), map it to CLTV vs CSV, and cite the BIP section you used. Optionally inspect a multisig descriptor on regtest.

evidence required

  • ·One-line policy (e.g. 2-of-3 OR Alice after N blocks) and whether CLTV or CSV fits
  • ·Link or quote pointer to BIP-65, BIP-68, or BIP-112 you relied on
  • ·Optional: getdescriptorinfo / getaddressinfo for a multisig or Taproot descriptor
  1. 01

    Worked mental model

    Re-read the diagrams in this lesson once out loud in plain language. If you cannot explain the flow to a friend without jargon, pause and revisit the Mastering Bitcoin / Mastering Lightning chapters linked in Resources. Chapter references are intentional, not decorative.

  2. 02

    Hands-on habit

    Every protocol idea should be paired with one local experiment. That habit turns reading into builder instinct.

    1. Reproduce the happy path on regtest (or Polar for Lightning)
    2. Break it on purpose (wrong fee, expired invoice, offline peer)
    3. Write down what error you saw and which layer produced it (wallet, node, mempool, peer)
  3. 03

    Glossary check

    Pick three terms from this lesson and define them in one sentence each without opening notes. Weak definitions mean the lesson is not finished yet.

  4. 04

    Resource order

    Use Resources in order: narrative book chapter first, then BIP/BOLT for precision, then implementation docs for commands. Jumping straight to RPC flags without the mental model creates brittle knowledge.

Multisig means multiple keys must cooperate to spend. Timelocks add “not before” constraints. Together they power vaults, inheritance designs, and Lightning’s security model.

Complete Step 1 // Required reading in the study plan above, then continue here.

Step 2 — Core idea: thresholds and time

Shared custody without multisig is usually a single point of failure. Lightning’s justice system depends on relative timelocks. Blurring absolute vs relative time creates unsafe contracts.

Analogy: Multisig is a safe deposit box needing two keys. A timelock is a time-delay lock that refuses to open until a date — or until enough time has passed since the box was last sealed.

Classic Script uses OP_CHECKMULTISIG for on-chain m-of-n. Modern approaches often prefer Taproot + MuSig2 so cooperative spends look like single-sig.

Policy example: 2-of-3 keys OR (1 key after 90 days)

Loading diagram…

Policies combine thresholds and time for safety and recovery.
  • CLTV (BIP-65): absolute — unlock after a block height or timestamp
  • CSV (BIP-112 / BIP-68): relative — unlock after the output has confirmed for a relative period

Lightning commitments lean on CSV so old states become punishable after delays.

Wall clocks are not consensus

Nodes use block-based rules. Designing “7 days” means encoding that delay in locktime semantics, not trusting a server clock alone.

Done when: You can say when you’d pick CLTV vs CSV for a recovery path.

Step 3 — Try it: sketch a policy (lab)

Write one custody policy in plain language, then map it:

NeedPrefer
Unlock after a calendar/height dateCLTV
Unlock N blocks after this output confirmsCSV
Cooperative spend looks like single-sigTaproot + MuSig-style

Optionally on regtest:

bitcoin-cli -regtest getdescriptorinfo "wsh(multi(2,...))"

(Use a real descriptor from your wallet docs — do not invent keys for mainnet.)

Common mistakes

  • Building 2-of-3 without tested recovery paths and key ceremonies
  • Using absolute locks where relative locks were required (and vice versa)
  • Forgetting that mempool policy may delay non-standard scripts

Done when: Lab evidence (policy line + BIP pointer + optional descriptor) is complete.

Next lesson

Mempool & Fees — how unconfirmed transactions compete and how fee bumping works.

further reading

  • bipBIP-65 CLTV
  • bipBIP-68 Relative lock-time
  • bipBIP-112 CSV

progress // sign in

Reading is public. Sign in to mark lessons complete, sync across devices, and unlock your roadmap.

./sign-in-to-track

discussion

Discussion

prevTaproot & TapscriptnextMempool & Fees

On this page

Press Shift + ? for keyboard shortcuts.

Press R to research on Bitcoin Search.

No questions yet — be the first to ask.