Skip to content

Instantly share code, notes, and snippets.

View migeyel's full-sized avatar
😘

Miguel Oliveira migeyel

😘
  • São Paulo, Brasil
View GitHub Profile
local e={}local t,a,o=require,{},{startup=e}
local function i(n)local s=o[n]
if s~=nil then if s==e then
error("loop or previous error loading module '"..n..
"'",2)end;return s end;o[n]=e;local h=a[n]if h then s=h(n)elseif t then s=t(n)else
error("cannot load '"..n.."'",2)end;if s==nil then s=true end;o[n]=s;return s end
a["ecnet.util"]=function(...)
local n={__tostring=function(r)return string.char(unpack(r))end,__index={toHex=function(r)return("%02x"):rep(
#r):format(unpack(r))end,isEqual=function(r,d)if
type(d)~="table"then return false end;if#r~=#d then return false end;local l=0
@migeyel
migeyel / fast_vanity.py
Last active September 8, 2019 18:22
Some Krist Proof-of-Concept Algorithms
# Proof of Concept Vanity Miner using hash chains
# Requires only 1 hash function per address check
from hashlib import sha256
from os import urandom
from time import clock
address_byte_lookup = "0000000111111122222223333333444444455555556666666777777788888889999999aaaaaaabbbbbbbcccccccdddddddeeeeeeefffffffggggggghhhhhhhiiiiiiijjjjjjjkkkkkkklllllllmmmmmmmnnnnnnnooooooopppppppqqqqqqqrrrrrrrssssssstttttttuuuuuuuvvvvvvvwwwwwwwxxxxxxxyyyyyyyzzzzzzzeeee"
# Shifts a hash chain by 1

Keybase proof

I hereby claim:

  • I am migeyel on github.
  • I am migeyel (https://keybase.io/migeyel) on keybase.
  • I have a public key ASCIGbsap8KHsegqo-vFU7mFSottEvKbgXbKaj708TvnAAo

To claim this, I am signing this object: