Skip to content
Blockchain LabTHE VENTURE STUDIO

LibraryScaling2019Design paperCorpus record

Nightshade: NEAR's sharding design

Nightshade. NEAR team.

Nightshade is NEAR's sharding design: chunks of a block are produced per shard and a block attests to those chunks, so one validator need not execute every shard.

A reading of the project's public design document. Not a copy, not a benchmark, and not an offer.

Nightshade is NEAR's sharding design: chunks of a block are produced per shard and a block attests to those chunks, so one validator need not execute every shard.
Evidence
Primary paper
Re-measured
No
Assumptions
3
Records linked
3

01 Claim ledger

What the paper is allowed to say

Each row is a sentence already in the study. The status is the same on every row: a model claim, not a live measurement.

  1. Claim 01 · Paper model

    The defect

    The NEAR white paper already in this library is not this document. Sharding has its own text.

  2. Claim 02 · Paper model

    The proposal

    Nightshade is NEAR's sharding design: chunks of a block are produced per shard and a block attests to those chunks, so one validator need not execute every shard.

  3. Claim 03 · Paper model

    The mechanism

    A block contains a header plus chunks. A validator assigned to a shard produces the chunk. Others attest.

  4. Claim 04 · Paper model

    The bound

    This note does not say the live network matches every section of the paper.

02 Three cuts

Observation, model, falsifier

A desk does not stop at the summary. Each claim is cut three ways, using only this study's own assumptions and checks. Nothing here is a new figure.

  1. 01 The defect

    Observation

    What the study says

    The NEAR white paper already in this library is not this document. Sharding has its own text.

    Model

    What has to hold

    You are reading the Nightshade paper. The NEAR white paper is the separate overview.

    Falsifier

    What would retire it

    What does a block commit to if a chunk is missing?

  2. 02 The proposal

    Observation

    What the study says

    Nightshade is NEAR's sharding design: chunks of a block are produced per shard and a block attests to those chunks, so one validator need not execute every shard.

    Model

    What has to hold

    You are reading the Nightshade paper. The NEAR white paper is the separate overview.

    Falsifier

    What would retire it

    What does a block commit to if a chunk is missing?

  3. 03 The mechanism

    Observation

    What the study says

    A block contains a header plus chunks. A validator assigned to a shard produces the chunk. Others attest.

    Model

    What has to hold

    No price, supply, yield, or adoption figure is added by this desk.

    Falsifier

    What would retire it

    What does a block commit to if a chunk is missing?

  4. 04 The bound

    Observation

    What the study says

    This note does not say the live network matches every section of the paper.

    Model

    What has to hold

    You are reading the Nightshade paper. The NEAR white paper is the separate overview.

    Falsifier

    What would retire it

    What does a block commit to if a chunk is missing?

03 Sequence

One action, as an operating tape

  1. 01A block contains a header plus chunks. A validator assigned to a shard produces the chunk. Others attest.
  2. 02Data availability of chunks is the usual sharding risk. A header without the chunk is not enough to execute that shard.
  3. 03Resharding, if the paper discusses it, changes who must hold which state. It is not a configuration detail.

04 Load-bearing

The argument, and where a pitch drops it

  1. What the name has to mean

    The cut

    Nightshade is NEAR's sharding design: chunks of a block are produced per shard and a block attests to those chunks, so one validator need not execute every shard.

    Why it carries weight

    If this cut is skipped, the paper's name is being used without the mechanism that makes the name mean anything.

    Where it is dropped

    This note does not say the live network matches every section of the paper.

  2. What actually moves

    The cut

    Data availability of chunks is the usual sharding risk. A header without the chunk is not enough to execute that shard.

    Why it carries weight

    If this cut is skipped, the paper's name is being used without the mechanism that makes the name mean anything.

    Where it is dropped

    A later client, parameter or reward formula is a different object from this paragraph.

  3. What a later deployment may change

    The cut

    Resharding, if the paper discusses it, changes who must hold which state. It is not a configuration detail.

    Why it carries weight

    If this cut is skipped, the paper's name is being used without the mechanism that makes the name mean anything.

    Where it is dropped

    This note does not say the live network matches every section of the paper.

05 Register

What has to be true

  • Model · Not re-measured

    You are reading the Nightshade paper. The NEAR white paper is the separate overview.

  • Model · Not re-measured

    The document is the one at the source URL. A marketing page with the same brand is not this text.

  • Model · Not re-measured

    No price, supply, yield, or adoption figure is added by this desk.

06 Divergence

What happened after the paper

A receipt that crosses shards is a message. Its failure mode is part of the design.

A later client, parameter set, or reward formula is a different object. Cite this paper for the mechanism. Cite a primary release for the network. This desk has not re-run the proof.

07 Pre-mortem

What to check before you use the idea

  4. 0 of 3 marked on this browser. A mark is a reading note, not a pass, a rating, or a recommendation.

08 Anatomy

The paper, in the order a builder needs

The problem it names

The NEAR white paper already in this library is not this document. Sharding has its own text.

What the design proposes

  • A block contains a header plus chunks. A validator assigned to a shard produces the chunk. Others attest.
  • Data availability of chunks is the usual sharding risk. A header without the chunk is not enough to execute that shard.
  • Resharding, if the paper discusses it, changes who must hold which state. It is not a configuration detail.

How the mechanism is specified

  • A block contains a header plus chunks. A validator assigned to a shard produces the chunk. Others attest.
  • Data availability of chunks is the usual sharding risk. A header without the chunk is not enough to execute that shard.
  • Resharding, if the paper discusses it, changes who must hold which state. It is not a configuration detail.

What this page does not treat as proven

  • This note does not say the live network matches every section of the paper.
  • It quotes no throughput.
  • A receipt that crosses shards is a message. Its failure mode is part of the design.

Why the desk still reads it

Nightshade is NEAR's sharding design: chunks of a block are produced per shard and a block attests to those chunks, so one validator need not execute every shard.

09 Lexicon

Terms, opened into the record

Chunk
A shard's portion of a block.
Shard
A partition of state. A validator of one shard has not executed the others.

10 Repository

Every linked record on this page

Underlined words open a page that already exists: a concept, a protocol profile, a failure record, or another paper. If a word is not underlined, this desk does not have a record for it.

This is Blockchain Lab's reading of a public design paper. It is not the paper, not a copy of it, and not an offer of tokens, equity, custody or a partnership. Later network behaviour can diverge from the text. Nothing here is investment, legal or technical advice.

Research status: Design paper. Last reviewed: 1 October 2026. This is a reading of a public paper, not investment, legal or security advice.