portlandhodl

BIP 110 vs. BIP 54

Poison Blocks, Sigop DoS Attacks, and Consensus Hardening

---

1. The Common Thread

Both BIP 110 and BIP 54 address the possibility of constructing valid Bitcoin blocks that are intentionally expensive to validate.

portlandhodl

Can Bobs 1/2016th of Bitcoin's Hashrate 55% the Network though luck into a BIP110 activation?

tl;dr No. The probability is approximately 10⁻²⁸⁵³ — effectively zero.

---

Setup

• Network hashrate: H
• Miner's hashrate: h = H / 2016

portlandhodl

Blocked Accounts

Name	Handle	Comments
BoozyTheClown	@TheBoozles
ANTON	@Anton__BTC
PlanB	@100trillionUSD	Scammer
MMCrypto	@MMCrypto	Scammer
Daniel Donavan	@caoimhinllc
Greg Tonoski	@GregTonoski	Intellectually Dishonest

portlandhodl

Bitcoin Dev Topics

• Mempool Editor
  • Repo
  • Notes
    • Written in rust
    • Splits the TUI from the core logic
• Deserialize logic! (Go over this!)

portlandhodl

Features

• Startup flags printout
• Log manipulation - Viewer

Test

test_mempool_accept.py fails for the wrong reason on line 308 when ScriptSig size is extended because the push style in the test is pushing more than 520 bytes.

portlandhodl

#!/bin/bash

# Bitcoin daemon setup script
# This script sets up bitcoind with proper user, directories, and systemd service

set -e  # Exit on error

# Colors for output
RED='\033[0;31m'
GREEN='\033[0;32m'

portlandhodl

#!/bin/bash

# Get peer info and disconnect any peer with "knots" in the subver field
bitcoin-cli getpeerinfo | jq -r '.[] | select(.subver | ascii_downcase | contains("knots")) | .id' | while read peer_id; do
    if [ ! -z "$peer_id" ]; then
        echo "Disconnecting peer ID $peer_id with knots client"
        bitcoin-cli disconnectnode "" "$peer_id"
    fi
done

portlandhodl

Notes about Sparse Merkle Trees

• The primary issue with a SMT is the calculation between each leaf and their intersection with other leaves.
• A tree with a single sparse element is very easy as you just can add that element in an calculate the path up the tree.
• When you have multiple keys then you need to make sure when you calculate the path up the tree you need to consider the impact other leaves have on your path to get to the root.

portlandhodl

#include <iostream>
#include <chrono>
#include <openssl/sha.h>
#include <cpuid.h>

bool check_sha_support() {
    unsigned int eax, ebx, ecx, edx;
    if (__get_cpuid(7, &eax, &ebx, &ecx, &edx)) {
        return (ebx & (1 << 29)) != 0;  // Check bit 29 for SHA extensions
    }

portlandhodl

use actix_web::{get, web, App, HttpResponse, HttpServer, Responder};
use bitcoincore_rpc::{Auth, Client, RpcApi};
use serde_json::Value;

struct AppState {
    btc_client: Client,
}

#[get("/blocktemplate")]
async fn get_block_template(data: web::Data<AppState>) -> impl Responder {