Skip to content

Instantly share code, notes, and snippets.

@gedigi
gedigi / aptos-oidb-zk-ceremony_attestation.log
Created February 22, 2024 01:03
Attestation for aptos-oidb-zk-ceremony MPC Phase 2 Trusted Setup ceremony
Hey, I'm gedigi-19227040 and I have contributed to the aptos-oidb-zk-ceremony.
The following are my contribution signatures:
Circuit # 1 (main)
Contributor # 11
Contribution Hash: 6195ff42 ef1b9085 e2b154ec 62feefdf
bc3a6cc5 8b2b4166 2881c21f 291953fc
e0c394c2 1a834e43 2f6fa1e1 f5b84897
c617b63c e89c13f1 897af640 316abe6c
@gedigi
gedigi / aptos-oidb-zk-ceremony_attestation.log
Created February 14, 2024 19:20
Attestation for aptos-oidb-zk-ceremony MPC Phase 2 Trusted Setup ceremony
Hey, I'm gedigi-19227040 and I have contributed to the aptos-oidb-zk-ceremony.
The following are my contribution signatures:
Circuit # 1 (main)
Contributor # 5
Contribution Hash: 79ca112a 57fd6f1d 8d68a78e 9560d1bc
17b8f3a9 80c12321 5d18589c 3c6a1e79
934d48db 65387a13 aa76cc11 950f887f
2b01b4d4 20a9e029 d4d15d95 b86fde4a

Keybase proof

I hereby claim:

  • I am gedigi on github.
  • I am gedigi (https://keybase.io/gedigi) on keybase.
  • I have a public key whose fingerprint is 425C FA29 7FC4 FDED 5383 544E F03F F8C2 BEE6 46E0

To claim this, I am signing this object:

def spiral(p):
x, y, n = 0, 0, 1
output = [[0 for _ in range(p)] for _ in range(p)]
start_x, start_y = 0, 0
iteration = 1
m = p*p
while (n < m):
for _ in range(p - iteration):
output[start_x + x][start_y + y] = n
ssh-ed25519 AAAAC3NzaC1lZDI1NTE5AAAAIAzoKQizURQKiMEZPdxvrp7xvnWXKjNMcF083k8H8Xr4 gdg@mustafar
@gedigi
gedigi / Dockerfile
Last active July 22, 2018 17:38
pwntainer
# pwntainer by gedigi
#
# DEPRECTAED
#
# SEE:
# - https://github.com/gedigi/pwntainer
# - https://hub.docker.com/r/gedigi/pwntainer/
import sys
def tryGuess(num, highest = 100, lowest = 1):
print "MACHINE: is %d the right guess?" % num
response = ''
while response not in ["yes", "too small", "too big"]:
response = raw_input("HUMAN: ")
if response == "yes":
print "MACHINE: YAY! I WON THE GAME!"
sys.exit()
import random
lower = [chr(x) for x in range(ord('a'), ord('z')+1)]
upper = [chr(x) for x in range(ord('A'), ord('Z')+1)]
special = ["!", "@", "#", "$", "%", "^", "&", "*", "(", ")", "_", "-", "=", "+", "<", ">", ",", ".", "/", "?", ";", ":", "|", "\\", "}", "\]", "\{", "[", "~", "`", "}" ]
number = range(0, 9)
def generatePassword(strength = 'strong'):
if strength == 'strong':
specials = random.sample(special, 3)
# Find if a number is prime
import math
def isPrime(num):
if num in [0, 1, 2, 3, 5]:
return ''
lastDigit = int(str(num)[-1])
sumDigits = sum(map(int, str(num)))
if sumDigits % 3 == 0 or lastDigit % 2 == 0 or lastDigit in [0, 2, 5]: