This Milestone is a second follow-up of the PoC done in %Adaptive DAL POC. After preparing the DAL skip list for Adjustable DAL in %Extend DAL skip list cells' content, we focus here on implementing the different primitives and extending existing code to support Adjustable DAL: protocol & refutation games extensions, rollup node extensions.

A follow-up of this milestone is already available here: %Adjustable DAL SDK integration

Work breakdown

• Protocol
  • (hours) (@iguerNL ) (MR !15523 (merged)) New reveal data channel request request_adal_page for rollups in L1's PVM sig (without refutations)
    • (Improvement MR !15632 (merged))
  • Implement refutation games for adjustable DAL in the protocol (partially reuse MR !15236 (closed))
    • (hours) (@iguerNL) (MR !15658 (merged)) Extending produce_proof case
    • (hours) (@iguerNL) (MRs !16135 (closed), !16151 (closed) and !16158 (closed)) Extending verify_proof case - ETA:15 Jan

• Rollup node
  • (hours) (@iguerNL ) (!15651 (merged)) The rollup node can answer Request_adal_page cases from the kernel
  • (days) (@iguerNL ) The rollup node relies on skip list cells stored on L1 to decide if it imports normal DAL pages
    • (hours) (MR !15639 (merged)) DAL: Refactoring to expose skip list cells content
    • (hours) (MR !15640 (merged)) Use L1 to check status of DAL slots from proto point of view

Challenges

• choose the right design for the adjustable dal primitive (see below)

Deliverables

• The protocol supports a variant of DAL called "adjustable DAL", where the rollups kernels decide what's attested.

TODO

• grep for ADAL/FIXME and ADAL/TODO in the repo

Design question

For reveal_dal_page the interface is:

 | Request_dal_page of Dal_slot_repr.Page.t

We used the following interface during the adjustable DAL PoC:

  | Request_adal_page of {
      page_id : Dal_slot_repr.Page.t;
      attestation_threshold_per_mil : int;
    }

We may want to:

• an optional list of desired publishers (None means any)
• provide the threshold as a rational number, or as a pair (numerator = number of attested shards, denominator = number of total shards)