Clone the capella
branch in the Prysm repo and build the binaries
$ git clone https://github.com/prysmaticlabs/prysm.git
$ cd prysm
$ git checkout capella
$ bazel build //cmd/prysmctl
By: terencechain
EIP-4844 introduces a new kind of transaction type to Ethereum, which accepts "blobs" of data to be persisted in the beacon node for a short period of time. These changes are forwards compatible with Ethereum's scaling roadmap, and blobs are small enough to keep disk use manageable. Here are all the relevant links with descriptions
// Problem: COMPUTE THE LONGEST CONTIGUOUS INCREASING SUBARRAY | |
// | |
// An array is increasing if each element is less than its succeeding element except for the last element. | |
// Implement an algorithm that takes as input an array A of n elements, | |
// and returns the beginning and ending indices of a longest increasing subarray of A. | |
// | |
// For example, if A =(2,11,3,5,13,7,19,17,23), | |
// the longest increasing subarray is (3,5,13), and you should return (2,4) | |
// Problem: Sum Swap | |
// | |
// Given two array of integers, find a pair of values (one value from each array) that you can swap | |
// to give the two arrays the same sum. | |
// | |
// Input:{4,1,2,1,1,2} and {3, 6, 3, 3} | |
// Output: {1, 3} | |
func BenchmarkValidateAggregateAndProof(b *testing.B) { | |
db, _ := dbtest.SetupDB(b) | |
var testing *testing.T | |
p := p2ptest.NewTestP2P(testing) | |
validators := uint64(256) | |
beaconState, privKeys := testutil.DeterministicGenesisState(b, validators) | |
blk := testutil.NewBeaconBlock() | |
require.NoError(b, db.SaveBlock(context.Background(), blk)) |