Chuan-Chun Wang a2468834

Note: PBSS in Geth >=1.13.0 removes the need to prune manually.

Old content for reference

Overview

Geth (Go-Ethereum) as of July 2022 takes about 650 GiB of space on a fast/snap sync, and then grows by ~ 14 GiB/week with default cache, ~ 8 GiB/week with more cache.

[
{
"slot": "8366820",
"parent_hash": "0x27dcb717d5921af93e2b56a82f546e1c11b33619238510cbe36e4d8c43f446a8",
"block_hash": "0x6868f8e474a163bb17f39d05847aa8e3f1b38db3cca0dfc9bd139db1da8dcde2",
"builder_pubkey": "0x8e6df6e0a9ca3fd89db2aa2f3daf77722dc4fbcd15e285ed7d9560fdf07b7d69ba504add4cc12ac999b8094ff30ed06c",
"proposer_pubkey": "0xb6d5424e28a738d002c96a19db7434fff22877272649e0ca38b579bb44398f3977f43af6c055414b7a71ec2bd7cb8480",
"proposer_fee_recipient": "0x72FDdC41CA177551Ce5949C75a92b945eFa04141",
"gas_limit": "30000000",

Overview

A bug caused by Implicit memory aliasing in go’s for loops caused the blob commitment values to be all set to the last value during encoding from go struct to a gRPC encoded value. This bug surfaced when a block that was received via a gRPC submission built using the erroneous code was the top or selected bid. The error seen would be mismatched KZG commitment.

Impact

A total of 16 slots were missed causing about 3.21 ETH missed block values.

All missed slots can be found here: https://gist.github.com/benhenryhunter/6feed90aff1a93106d629fe85a88d778

We released a fix to our regional relays and saw the bug resolved from our end but found out builders who previously did not use our library for gRPC began to use it. This caused a few more blocks to slip through requiring us to shut off getHeaders for the remainder of the night on the 14th.

	<!doctype html>
	<html>
	<head>
	<title>This is the title of the webpage!</title>
	</head>
	<body>
	<p>This is an example paragraph. Anything in the <strong>body</strong> tag will appear on the page, just like this <strong>p</strong> tag and its contents.</p>
	</body>
	</html>

	import math as m

	def pure_power(N):
	"""checks if N is a pure power, i. e. N = a^b for some integers
	a >=1, b >= 2.
	returns (a, b) if a and b are found.
	returns (N, 1) if N is not a pure power.
	See ref.1.: https://en.wikipedia.org/wiki/
	Computational_complexity_of_mathematical_operations#Elementary_functions
	for the computational complexities for each element.

	%lang starknet
	%builtins pedersen range_check bitwise

	from starkware.cairo.common.cairo_builtins import BitwiseBuiltin, HashBuiltin
	from starkware.cairo.common.bitwise import bitwise_and
	from starkware.cairo.common.math import assert_nn_le

	const WORD = 2 ** 16
	const MASK = WORD - 1
	const MASK2 = MASK * WORD