84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352 | @dataclass(frozen=True)
class SpecHelpers:
"""
Define parameters and helper functions that are tightly coupled to the 4844
spec but not strictly part of it.
"""
BYTES_PER_FIELD_ELEMENT = 32
_EXHAUSTIVE_MAX_BLOBS_PER_BLOCK = (
9 # Osaka max; exhaustive is tractable up to here
)
@classmethod
def get_representative_blob_combinations(
cls,
blob_count: int,
max_blobs_per_tx: int,
) -> List[Tuple[int, ...]]:
"""
Get a bounded set of representative blob-per-tx partitions for a given
blob count, instead of exhaustively enumerating all valid partitions.
"""
n = blob_count
if n < 1:
return []
m = max_blobs_per_tx
seen: Set[Tuple[int, ...]] = set()
result: List[Tuple[int, ...]] = []
def add(combo: Tuple[int, ...]) -> None:
if combo not in seen:
seen.add(combo)
result.append(combo)
# 1. Single tx (if it fits)
# e.g. n=5, m=6 → (5,)
if n <= m:
add((n,))
# 2. All singles
# e.g. n=10 → (1,1,1,1,1,1,1,1,1,1)
if n > 1:
add((1,) * n)
# 3. Greedy pack: fill max-sized txs first
# e.g. n=10, m=6 → (6,4)
if n > m:
q, r = divmod(n, m)
greedy = (m,) * q + ((r,) if r else ())
add(greedy)
# 4. Reversed greedy
# e.g. n=10, m=6 → (4,6)
rev = tuple(reversed(greedy))
add(rev)
# 5. One big tx + singles for the rest (and reversed)
# e.g. n=10, m=6 → (6,1,1,1,1) and (1,1,1,1,6)
if n > 1:
big = min(n - 1, m)
rest = n - big
combo = (big,) + (1,) * rest
add(combo)
add(tuple(reversed(combo)))
# 6. Balanced split into two txs (and reversed)
# e.g. n=10, m=6 → (5,5); n=9, m=6 → (5,4) and (4,5)
if n > 1:
half_hi = math.ceil(n / 2)
half_lo = n - half_hi
if half_hi <= m and half_lo >= 1:
add((half_hi, half_lo))
if half_hi != half_lo:
add((half_lo, half_hi))
# 7. Uniform non-max: all txs same size, 1 < k < m
# e.g. n=12, m=6 → (4,4,4); n=15, m=6 → (5,5,5)
if n > 1:
for k in range(m - 1, 1, -1):
if n % k == 0 and n // k > 1:
add((k,) * (n // k))
break
return result
@classmethod
def get_representative_invalid_blob_combinations(
cls,
fork: Fork,
) -> List[Tuple[int, ...]]:
"""
Get a bounded set of representative invalid blob-per-tx partitions
that exceed the block blob limit by exactly one.
"""
max_blobs_per_block = fork.max_blobs_per_block()
max_blobs_per_tx = fork.max_blobs_per_tx()
total = max_blobs_per_block + 1
m = max_blobs_per_tx
seen: Set[Tuple[int, ...]] = set()
result: List[Tuple[int, ...]] = []
def add(combo: Tuple[int, ...]) -> None:
if combo not in seen:
seen.add(combo)
result.append(combo)
# 1. Single oversized tx — e.g. (16,)
add((total,))
# 2. Greedy pack of total — e.g. total=16, m=6 → (6,6,4)
q, r = divmod(total, m)
greedy = (m,) * q + ((r,) if r else ())
add(greedy)
# 3. All singles — e.g. (1,)*16
add((1,) * total)
# 4. One full tx + overflow — e.g. total=16, m=6 → (6,10)
overflow = total - m
if overflow >= 1:
add((m, overflow))
# 5. One blob + full block — e.g. (1,21)
# Per-tx-oversized elements must be last: the test sends all txs from
# one sender with sequential nonces, so a rejected non-last tx creates
# a nonce gap that causes subsequent txs to fail with NONCE_MISMATCH,
# not the expected blob error.
add((1, max_blobs_per_block))
# 6. Balanced all-valid: near-equal tx sizes, all within per-tx limit
# e.g. total=16, m=6 → (6,5,5)
num_txs = math.ceil(total / m)
base, extra = divmod(total, num_txs)
balanced = (base + 1,) * extra + (base,) * (num_txs - extra)
if all(b <= m for b in balanced):
add(balanced)
return result
@classmethod
def get_min_excess_blob_gas_for_blob_gas_price(
cls,
*,
fork: Fork,
blob_gas_price: int,
) -> int:
"""
Get the minimum required excess blob gas value to get a given blob gas
cost in a block.
"""
current_excess_blob_gas = 0
current_blob_gas_price = 1
get_blob_gas_price = fork.blob_gas_price_calculator()
gas_per_blob = fork.blob_gas_per_blob()
while current_blob_gas_price < blob_gas_price:
current_excess_blob_gas += gas_per_blob
current_blob_gas_price = get_blob_gas_price(
excess_blob_gas=current_excess_blob_gas
)
return current_excess_blob_gas
@classmethod
def get_min_excess_blobs_for_blob_gas_price(
cls,
*,
fork: Fork,
blob_gas_price: int,
) -> int:
"""
Get the minimum required excess blobs to get a given blob gas cost in a
block.
"""
gas_per_blob = fork.blob_gas_per_blob()
return (
cls.get_min_excess_blob_gas_for_blob_gas_price(
fork=fork,
blob_gas_price=blob_gas_price,
)
// gas_per_blob
)
@classmethod
def get_blob_combinations(
cls,
blob_count: int,
max_blobs_per_tx: int,
) -> List[Tuple[int, ...]]:
"""
Get all possible combinations of blobs that result in a given blob
count.
"""
combinations = [
seq
for i in range(
blob_count + 1, 0, -1
) # We can have from 1 to at most MAX_BLOBS_PER_BLOCK blobs per
# block
for seq in itertools.combinations_with_replacement(
range(1, min(blob_count + 1, max_blobs_per_tx) + 1), i
) # We iterate through all possible combinations
# And we only keep the ones that match the expected blob count
if sum(seq) == blob_count
and all(tx_blobs <= max_blobs_per_tx for tx_blobs in seq)
# Validate each tx
]
# We also add the reversed version of each combination, only if it's
# not already in the list. E.g. (4, 1) is added from (1, 4) but not (1,
# 1, 1, 1, 1) because its reversed version is identical.
combinations += [
tuple(reversed(x))
for x in combinations
if tuple(reversed(x)) not in combinations
]
return combinations
@classmethod
def all_valid_blob_combinations(cls, fork: Fork) -> List[ParameterSet]:
"""
Return all valid blob tx combinations for a given block, assuming the
given MAX_BLOBS_PER_BLOCK, whilst respecting MAX_BLOBS_PER_TX.
"""
max_blobs_per_block = fork.max_blobs_per_block()
max_blobs_per_tx = fork.max_blobs_per_tx()
exhaustive = max_blobs_per_block <= cls._EXHAUSTIVE_MAX_BLOBS_PER_BLOCK
combinations: List[Tuple[int, ...]] = []
for i in range(1, max_blobs_per_block + 1):
if exhaustive:
combinations += cls.get_blob_combinations(i, max_blobs_per_tx)
else:
combinations += cls.get_representative_blob_combinations(
i, max_blobs_per_tx
)
return [
pytest.param(
combination,
id=f"blobs_per_tx_{repr(combination).replace(' ', '')}",
)
for combination in combinations
]
@classmethod
def invalid_blob_combinations(cls, fork: Fork) -> List[ParameterSet]:
"""
Return invalid blob tx combinations for a given block that use up to
MAX_BLOBS_PER_BLOCK+1 blobs.
"""
max_blobs_per_block = fork.max_blobs_per_block()
max_blobs_per_tx = fork.max_blobs_per_tx()
invalid_combinations: List[Tuple[int, ...]] = []
if max_blobs_per_block <= cls._EXHAUSTIVE_MAX_BLOBS_PER_BLOCK:
invalid_combinations += cls.get_blob_combinations(
max_blobs_per_block + 1,
max_blobs_per_tx,
)
invalid_combinations.append((max_blobs_per_block + 1,))
else:
invalid_combinations = (
cls.get_representative_invalid_blob_combinations(fork)
)
return [
pytest.param(
combination,
id=f"blobs_per_tx_{repr(combination).replace(' ', '')}",
)
for combination in invalid_combinations
]
|