CRYPTO NEWS

When I have a hash algo that creates deterministic 12 bit arrays. How do I calculate the unique secrets between two distinct secrets with 75%collision

I have following code:

import math

n = 11

p = 1 – math.factorial(2n) / (2knmath.factorial(2*n – k))

print(p)

k = 2**((n-1)/2)*(math.sqrt(2**-p))

Cannot create Safe from at https://dev.gnosis-safe.io/

I’m trying to create a Safe App, and am following this tutorial https://docs.gnosis-safe.io/build-with-safe/sdks/safe-apps/testing-your-safe-app It pointed me to https://dev.gnosis-safe.io/ where I’m suppose to be able to create a Safe, but I get an error, when following these steps Steps Visit https://dev.gnosis-safe.io/ Connect address Attempt to "Create Safe" Result 4. TypeError: b is undefined e Welcome.tsx:88 c::Listen

I’m trying to create a Safe App, and am following this tutorial https://docs.gnosis-safe.io/build-with-safe/sdks/safe-apps/testing-your-safe-app

It pointed me to https://dev.gnosis-safe.io/

where I’m suppose to be able to create a Safe, but I get an error, when following these steps

Steps

  1. Visit https://dev.gnosis-safe.io/
  2. Connect address
  3. Attempt to "Create Safe"

Result

4.

TypeError: b is undefined     e Welcome.tsx:88     c runtime.js:63     _invoke runtime.js:293     E runtime.js:118     [...]     e Welcome.tsx:112 

aats

Expected

  1. Can proceed in creating a Safe successfully

When I have a hash algo that creates deterministic 12 bit arrays. How do I calculate the unique secrets between two distinct secrets with 75%collision

Shopping cart
There are no products in the cart!
Continue shopping
0