Use engine API-compatible FIELD_ELEMENTS_PER_BLOB in minimal preset

Makefile

@@ -212,7 +212,7 @@ gen_kzg_setups:
 	if ! test -d venv; then python3 -m venv venv; fi; \
 	. venv/bin/activate; \
 	pip3 install -r requirements.txt; \
-	python3 ./gen_kzg_trusted_setups.py --secret=1337 --g1-length=4 --g2-length=65 --output-dir ${CURRENT_DIR}/presets/minimal/trusted_setups; \
+	python3 ./gen_kzg_trusted_setups.py --secret=1337 --g1-length=4096 --g2-length=65 --output-dir ${CURRENT_DIR}/presets/minimal/trusted_setups; \
 	python3 ./gen_kzg_trusted_setups.py --secret=1337 --g1-length=4096 --g2-length=65 --output-dir ${CURRENT_DIR}/presets/mainnet/trusted_setups
 
 # For any generator, build it using the run_generator function.

presets/minimal/deneb.yaml

@@ -2,8 +2,8 @@
 
 # Misc
 # ---------------------------------------------------------------
-# [customized]
-FIELD_ELEMENTS_PER_BLOB: 4
+# `uint64(4096)`
+FIELD_ELEMENTS_PER_BLOB: 4096
 # [customized]
 MAX_BLOB_COMMITMENTS_PER_BLOCK: 16
 # `uint64(6)`

tests/core/pyspec/eth2spec/test/deneb/unittests/polynomial_commitments/test_polynomial_commitments.py

@@ -139,20 +139,22 @@ def test_barycentric_outside_domain(spec):
 @single_phase
 def test_barycentric_within_domain(spec):
     """
-    Test barycentric formula correctness by using it to evaluate a polynomial at all the points of its domain
+    Test barycentric formula correctness by using it to evaluate a polynomial at various points inside its domain
     (the roots of unity).
 
     Then make sure that we would get the same result if we evaluated it from coefficient form without using the
     barycentric formula
     """
+    rng = random.Random(5566)
     poly_coeff, poly_eval = get_poly_in_both_forms(spec)
     roots_of_unity_brp = spec.bit_reversal_permutation(spec.ROOTS_OF_UNITY)
 
     assert len(poly_coeff) == len(poly_eval) == len(roots_of_unity_brp)
     n = len(poly_coeff)
 
-    # Iterate over the entire domain
-    for i in range(n):
+    # Iterate over some roots of unity
+    for i in range(12):
+        i = rng.randint(0, n - 1)
         # Grab a root of unity and use it as the evaluation point
         z = int(roots_of_unity_brp[i])
 
@@ -175,15 +177,17 @@ def test_compute_kzg_proof_within_domain(spec):
     Create and verify KZG proof that p(z) == y
     where z is in the domain of our KZG scheme (i.e. a relevant root of unity).
     """
+    rng = random.Random(5566)
     blob = get_sample_blob(spec)
     commitment = spec.blob_to_kzg_commitment(blob)
     polynomial = spec.blob_to_polynomial(blob)
 
     roots_of_unity_brp = spec.bit_reversal_permutation(spec.ROOTS_OF_UNITY)
 
-    for i, z in enumerate(roots_of_unity_brp):
+    # Let's test some roots of unity
+    for _ in range(6):
+        z = rng.choice(roots_of_unity_brp)
         proof, y = spec.compute_kzg_proof_impl(polynomial, z)
-
         assert spec.verify_kzg_proof_impl(commitment, z, y, proof)