mratsim

func dacPairing[HashLen](
       sigsets: ptr UncheckedArray[SignatureSet[HashLen]],
       contexts: ptr UncheckedArray[ContextMultiAggregateVerify[DST]],
       numBatches: uint32,
       batchID: uint32,
       subsetStart: uint32,
       subsetStopEx: uint32
     ): bool =
  ## Distribute pairing computation using a recursive divide-and-conquer (DAC) algorithm

mratsim

ethereum/eth2.0-pm#193

Nimbus

• Mainnet launch, documentation

• Thanks for supporters, in particular those who supported us on Gitcoin over a year ago.

• Hot fixes yesterday, another scheduled today

• Release management: mailing lists, hash of releases

• Software:

mratsim

# beacon_chain
# Copyright (c) 2018-2020 Status Research & Development GmbH
# Licensed and distributed under either of
#   * MIT license (license terms in the root directory or at https://opensource.org/licenses/MIT).
#   * Apache v2 license (license terms in the root directory or at https://www.apache.org/licenses/LICENSE-2.0).
# at your option. This file may not be copied, modified, or distributed except according to those terms.

import
  # Standard library
  std/[tables, os, options],

mratsim

#52 call - https://github.com/ethereum/eth2.0-pm/issues/191

Nimbus

Networking:
- Improve tracking of resources: streams, channels
- Gossipsub audit fixes (done late because 1.1 was not tested enough during its allocated phase)

Core:
- Toledo

mratsim

Agenda
https://github.com/ethereum/eth2.0-pm/issues/184
————————
————————
Testing and Release updates

Eth 1.0 release candidate WIP

Zinken

mratsim

import arraymancer
import sequtils
import random
import strformat

# https://d2l.ai/d2l-en.pdf 3.2 LinearRegressionImplementationfromScratch english version.
iterator data_iter[T](batch_size:Natural, features:Tensor[T], labels:Tensor[T]): (Tensor[T],Tensor[T]) =
  let num_examples = len(features)
  var indices = toSeq(countup(0,num_examples - 1))
  random.shuffle(indices)

mratsim

import
  # Internal
  ./milagro, ./common

proc PAIR_BLS12381_double(A: var ECP2_BLS12381, a, b, c: var FP2_BLS12381) {.importc, cdecl.}
proc PAIR_BLS12381_add(A, B: var ECP2_BLS12381, a, b, c: var FP2_BLS12381) {.importc, cdecl.}
proc ECP_BLS12381_set(P: var ECP_BLS12381, a, b: BIG_384): int {.importc, cdecl.}
proc PAIR_BLS12381_line(v: var FP12_BLS12381, A, B: var ECP2_BLS12381, Qx, Qy: ptr FP_BLS12381) {.importc, cdecl.}
proc PAIR_BLS12381_ate(r: var FP12_BLS12381, A: var ECP2_BLS12381, B: var ECP_BLS12381) {.importc, cdecl.}

mratsim

https://github.com/ethereum/eth2.0-pm/issues/181

Nimbus

Audit:
- Last phase of audit started
  - Validator core: secrets & keystores
  - Attestation/block proposal + Slashing protection
  - Gossipsub (1.1)
  - RPC

mratsim

Agenda: https://github.com/ethereum/eth2.0-pm/issues/178

Nimbus:

Audit:
- Highlighted several potential for malicious attestations or blocks
  to exhaust the system memory, so now use bounded buffer and explicit drops
  when late
  
Current focus:

mratsim

https://github.com/ethereum/eth2.0-pm/issues/173

Nimbus

Medalla:
1. Losing peers
2. Syncing performance
3. (very) High-memory usage for 2 caches:
    - epoch cache that in particular caches validators public keys
      was way too aggressive after a couple speed optimizations (gigabytes!)