HackMD
    • Create new note
    • Create a note from template
    • Sharing Link copied
    • /edit
    • View mode
      • Edit mode
      • View mode
      • Book mode
      • Slide mode
      Edit mode View mode Book mode Slide mode
    • Customize slides
    • Note Permission
    • Read
      • Only me
      • Signed-in users
      • Everyone
      Only me Signed-in users Everyone
    • Write
      • Only me
      • Signed-in users
      • Everyone
      Only me Signed-in users Everyone
    • Commenting & Invitee
    • Publishing
      Please check the box to agree to the Community Guidelines.
      Everyone on the web can find and read all notes of this public team.
      After the note is published, everyone on the web can find and read this note.
      See all published notes on profile page.
    • Commenting Enable
      Disabled Forbidden Owners Signed-in users Everyone
    • Permission
      • Forbidden
      • Owners
      • Signed-in users
      • Everyone
    • Invitee
    • No invitee
    • Options
    • Versions and GitHub Sync
    • Transfer ownership
    • Delete this note
    • Note settings
    • Template
    • Save as template
    • Insert from template
    • Export
    • Dropbox
    • Google Drive Export to Google Drive
    • Gist
    • Import
    • Dropbox
    • Google Drive Import from Google Drive
    • Gist
    • Clipboard
    • Download
    • Markdown
    • HTML
    • Raw HTML
Menu Note settings Sharing Create Help
Create Create new note Create a note from template
Menu
Options
Versions and GitHub Sync Transfer ownership Delete this note
Export
Dropbox Google Drive Export to Google Drive Gist
Import
Dropbox Google Drive Import from Google Drive Gist Clipboard
Download
Markdown HTML Raw HTML
Back
Sharing
Sharing Link copied
/edit
View mode
  • Edit mode
  • View mode
  • Book mode
  • Slide mode
Edit mode View mode Book mode Slide mode
Customize slides
Note Permission
Read
Only me
  • Only me
  • Signed-in users
  • Everyone
Only me Signed-in users Everyone
Write
Only me
  • Only me
  • Signed-in users
  • Everyone
Only me Signed-in users Everyone
Comment & Invitee
Publishing
Please check the box to agree to the Community Guidelines.
Everyone on the web can find and read all notes of this public team.
After the note is published, everyone on the web can find and read this note.
See all published notes on profile page.
More (Comment, Invitee)
Commenting Enable
Disabled Forbidden Owners Signed-in users Everyone
Permission
Owners
  • Forbidden
  • Owners
  • Signed-in users
  • Everyone
Invitee
No invitee
   owned this note    owned this note      
Published Linked with GitHub
Like BookmarkBookmarked
Subscribed
  • Any changes
    Be notified of any changes
  • Mention me
    Be notified of mention me
  • Unsubscribe
Subscribe
# Two slots PBS with unconditional payment Author: @terencechain Over the last few days, I reviewed Vitalik's post on [two slot proposer builder separation](https://ethresear.ch/t/two-slot-proposer-builder-separation/10980). The main idea is to split the current mev-boost's commit-reveal scheme into an in-protocol two-slot scheme. Where the builder submits the header, the proposer proposes the blind block, some attesters vote for the blind block, and when there are enough blind block votes, the builder reveals the full block. The rest of the attesters and aggregators perform the rest of the duties similar to today post attestation cut off time at 1/3 of the slot. In the following sections, I'll break down the interactions into steps, then wrap up the post with some analysis of attack vectors and open challenges. ### Terminologies - **Slot**: Where one beacon block gets proposed - **Header (or proposer) slot**: The first half of the slot. Think of it like a commit slot - **Payload (or builder) slot**: The second half of the slot. Think of it like a reveal slot. The original post had it as an intermediate slot - **Execution header**: Execution information where transactions are blinded - **Execution payload**: Execution information where transactions are in clear - **Blind Beacon block**: Block contains execution header - **Beacon block**: Block contains execution payload - **Blind block attester**: Vote for blind block - **Attester**: Vote for beacon block ### Step 0: Builder registration on the beacon chain Builder is part of the consensus actor and registered in the beacon chain. Similar to the validator deposit workflow, we need a builder deposit workflow. Builder will be part of `BeaconState` and probably look close to the `Validator` registry structure. Open challenges: - UX ### Step 1: Builder header submission Builder submits an `ExecutionHeader` with `Bid` to the `builder_header_subnet` as close to the start of the slot as possible. Proposer receives them and does basic p2p validations on the subnet. It checks the following. - Builder is registered - Builder has not been slashed. (Will there be any slashing conditions?) - Builder has enough balances to pay the bid There's not much reason to re-gossip the header back to peers given there's just one proposer per slot, and the proposer is incentivized to be well-connected to all the builders. Open challenges: - New gossip network for the builder to submit header + bid to the proposer - Unlikely DOS vectors for the proposer ### Step 2: Proposer header selection and blind block submission At the start of the slot, the proposer will choose the "best" `ExecutionHeader` to include for blind block proposal at the header slot. The "best" here is a little subjective, it could be the header with the highest bid. Or it could be the header with the highest bid that satisfies some inclusion list property. It's unclear whether the notion of "best" should be part of the consensus protocol (i.e mev burn?) or just let the proposer choose whatever it wants. The proposer will submit the blind block to the `beacon_blind_block_subnet`. Proposer boost is applied to the on-time blind block. Open challenges: - Proposer header selection - Slashing condition for signing more than one blind block - New gossip network for proposer to submit blind block ### Step 3: Attester attestation submission for blind block Before the attestation cutoff threshold during the header slot, some attesters (think one committee worth) will attest the blind block to be valid and canonical. There's no notion of execution validity here since the blind block can't be executed. The attesters will attest to the blind block for consensus validity, and it's the head of the chain. Given the beacon block root is the same between blind block and beacon block. The existing Attestation structure can likely be reused (nice!) Attester will broadcast the attestation to the `blind_block_attestation_subnet` as soon as the blind block is validated with consensus rules and fork choice. Open challenges: - New gossip subnet for blind block attestation - Attester committee selection and shuffling. I mentioned one committee, but it could be more than one committee. How do we determine what size of the committees is safe enough? What is the trade-off here? - The builder and proposer trust the attester committee here through honest majority assumption. What malicious things can blind-block attesters do? How likely or damaging are attacks like post-ex reorg? - Fork choice complexity on the client implementation. We need (slot, block) combo. The client implements different structures. Most clients use a proto array, Prysm uses a doubly linked list. - Given attestation structure is the same, we might be able to re-use the existing attestation subnet. Is that worth optimization for? ### Step 4: Builder reveals blind block and submits full beacon block Bulders listen on both the `blind_block_attestation_subnet` and the `beacon_blind_block_subnet`. When the builder sees that the following conditions are satisfied - Its execution header has been included in a blind block - There are enough attestations from the blind block attesters for its blind block to be "safe" (subjectively reorg-resistent) The builder will then reconstructs the full beacon block, which includes `ExecutionPayload` and the attestations that voted the blind block and broadcast it out at the start of the payload slot to the `beacon_block_subnet` (same subnet that we have been using for the beacon block today) Open challenges: - Confidence to determine that the blind block is "safe" ### Step 5: Attesters and aggregators vote for the beacon block. Same as today Once the builder broadcasts the beacon block, the rest of the interactions between attesters and aggregators remain similar to today's attester cut-off and aggregator cut-off times. The subtle difference here is that the attester verifies full beacon block originated from the builder rather than the proposer. Builder releasing the block on time should have a proposer boost. (or builder boost? lol) Open challenges: - Same trust assumption as today. Attester committees via honest majority to not reorg the chain for MEV stealing - Similar Fork choice complexity on client implementation as step 3 ### Attack vectors and open questions - A single slot is now split into two intermediate slots. The duration will be increased. How does that affect UX. I believe portions of steps can be overlapped, it's worth studying how much parallelization can be achieved - Blind attester committee shuffling. How often? How many committees and the trade-offs - Skip slot scenarios - Proposer is offline during header slot - Builder is offline during payload slot - Both are offline - Can the protocol optimize these skip slot scenarios so that we don't have waste / idle time - How does the builder determine when it's safe to reveal the full payload - Fockchoice complexities. Do we need to account for (block, slot) combo? - General design makes it hard for the builder to screw the proposer given unconditional payment. Can the proposer screw the builder in any other ways? (ie self slash, try to reorg the chain, special attacks... etc)

Import from clipboard

Advanced permission required

Your current role can only read. Ask the system administrator to acquire write and comment permission.

This team is disabled

Sorry, this team is disabled. You can't edit this note.

This note is locked

Sorry, only owner can edit this note.

Reach the limit

Sorry, you've reached the max length this note can be.
Please reduce the content or divide it to more notes, thank you!

Import from Gist

Import from Snippet

or

Export to Snippet

Are you sure?

Do you really want to delete this note?
All users will lost their connection.

Create a note from template

Create a note from template

Oops...
This template is not available.


Upgrade

All
  • All
  • Team
No template found.

Create custom template


Upgrade

Delete template

Do you really want to delete this template?

This page need refresh

You have an incompatible client version.
Refresh to update.
New version available!
See releases notes here
Refresh to enjoy new features.
Your user state has changed.
Refresh to load new user state.

Sign in

Forgot password

or

By clicking below, you agree to our terms of service.

Sign in via Facebook Sign in via Twitter Sign in via GitHub Sign in via Dropbox

New to HackMD? Sign up

Help

  • English
  • 中文
  • Français
  • Deutsch
  • 日本語
  • Español
  • Català
  • Ελληνικά
  • Português
  • italiano
  • Türkçe
  • Русский
  • Nederlands
  • hrvatski jezik
  • język polski
  • Українська
  • हिन्दी
  • svenska
  • Esperanto
  • dansk

Documents

Tutorials

Book Mode Tutorial

Slide Mode Tutorial

YAML Metadata

Contacts

Facebook

Twitter

Discord

Feedback

Send us email

Resources

Releases

Pricing

Blog

Policy

Terms

Privacy

Cheatsheet

Syntax Example Reference
# Header Header 基本排版
- Unordered List
  • Unordered List
1. Ordered List
  1. Ordered List
- [ ] Todo List
  • Todo List
> Blockquote
Blockquote
**Bold font** Bold font
*Italics font* Italics font
~~Strikethrough~~ Strikethrough
19^th^ 19th
H~2~O H2O
++Inserted text++ Inserted text
==Marked text== Marked text
[link text](https:// "title") Link
![image alt](https:// "title") Image
`Code` Code 在筆記中貼入程式碼
```javascript
var i = 0;
```
var i = 0;
:smile: :smile: Emoji list
{%youtube youtube_id %} Externals
$L^aT_eX$ LaTeX
:::info
This is a alert area.
:::

This is a alert area.

Versions

Versions and GitHub Sync

Sign in to link this note to GitHub Learn more
This note is not linked with GitHub Learn more
 
Add badge Pull Push GitHub Link Settings
Upgrade now

Version named by    

More Less
  • Edit
  • Delete

Note content is identical to the latest version.
Compare with
    Choose a version
    No search result
    Version not found

Feedback

Submission failed, please try again

Thanks for your support.

On a scale of 0-10, how likely is it that you would recommend HackMD to your friends, family or business associates?

Please give us some advice and help us improve HackMD.

 

Thanks for your feedback

Remove version name

Do you want to remove this version name and description?

Transfer ownership

Transfer to
    Warning: is a public team. If you transfer note to this team, everyone on the web can find and read this note.

      Link with GitHub

      Please authorize HackMD on GitHub

      Please sign in to GitHub and install the HackMD app on your GitHub repo. Learn more

       Sign in to GitHub

      HackMD links with GitHub through a GitHub App. You can choose which repo to install our App.

      Push the note to GitHub Push to GitHub Pull a file from GitHub

        Authorize again
       

      Choose which file to push to

      Select repo
      Refresh Authorize more repos
      Select branch
      Select file
      Select branch
      Choose version(s) to push
      • Save a new version and push
      • Choose from existing versions
      Available push count

      Upgrade

      Pull from GitHub

       
      File from GitHub
      File from HackMD

      GitHub Link Settings

      File linked

      Linked by
      File path
      Last synced branch
      Available push count

      Upgrade

      Danger Zone

      Unlink
      You will no longer receive notification when GitHub file changes after unlink.

      Syncing

      Push failed

      Push successfully