Author

Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 251. (Read 229433 times)

member
Activity: 174
Merit: 12

Did you try this bro ?

no, I don't understand what it is.
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
Enother interesting code - https://github.com/jairopaiva/BitcoinExprCracker

Search metadata for finding privkey... Needs modification for work
uses 1 processor core, does not work on 0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798

Did you try this bro ?

:
K is prrivkey, b is a picies of privkey:

For example, with n = 6, trace(58) gives me:

  # k = 111010
  # i = 2, b = 1
  add(1Q, 1Q)
  add(2Q, 1Q)
  # i = 3, b = 1
  add(3Q, 3Q)
  add(6Q, 1Q)
  # i = 4, b = 0
  add(7Q, 7Q)
  # i = 5, b = 1
  add(14Q, 14Q)
  add(28Q, 1Q)
  # i = 6, b = 0
  add(29Q, 29Q)


Huh
newbie
Activity: 1
Merit: 0
is there any new method for trying to find private keys? vidmate app download insta save
 
member
Activity: 174
Merit: 12
Enother interesting code - https://github.com/jairopaiva/BitcoinExprCracker

Search metadata for finding privkey... Needs modification for work
uses 1 processor core, does not work on 0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk

Code:
import sys
import time
import random
#from tqdm import tqdm
from time import sleep
import secp256k1 as ice

print('\n      B I N A R Y   S E E D   S C A N   Q U A D R O   \n')
print(' 11_________________0____________________________________________\n')
x=16000
y=131071
list=[]
x0=0b100000000000000000000000000000000000000000000
for n in range(y):
    x1 = (x0+n)
    a1 = bin(random.randrange(131072,262143))#[2:].zfill(18)
    a1 = (a1)[2:]
    for i in range(x):
        a0 = str("1")           
        a2 = str("0")
        a3 = bin(random.randrange(x1,0b111111111111111111111111111111111111111111111))
        a3 = (a3)[3:]#.zfill(44)
        a4 = bin(random.randrange(x1,0b111111111111111111111111111111111111111111111))
        a4 = (a4)[3:]#.zfill(44)
        a5 = bin(random.randrange(x1,0b111111111111111111111111111111111111111111111))
        a5 = (a5)[3:]#.zfill(44)
        a6 = bin(random.randrange(x1,0b111111111111111111111111111111111111111111111))
        a6 = (a6)[3:]#.zfill(44)
        binb = "".join(a0+a1+a2+a3)
        binc = "".join(a0+a1+a2+a4)
        bind = "".join(a0+a1+a2+a5)
        bine = "".join(a0+a1+a2+a6)
        list.append(binb)
        list.append(binc)
        list.append(bind)
        list.append(bine)
        if len(list)==x:
            line_count=0
            for bina in (list):
                bina!='\n'
                addr = ice.privatekey_to_address(0, True, int(bina,2))
                line_count+=1
                                 
                if addr.startswith('16jY7'): # 16jY7
                    ran = int(bina,2)
                    print('',bina, '\n')
                    sys.stdout.write('\r ' + hex(ran))
                    sys.stdout.write(' ' + '| ' + addr + ' ' + str(n))
                    sleep(1)
                    sys.stdout.write('\n\n continue...\n\n')
                    sleep(1)

                if addr == "16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN":
                    ran = int(bina,2)
                    print('\n\n Target found!!' + hex(ran) + ' \n ' + addr,'\n')
                    file=open(u"16j.Target.Info.txt","a")
                    file.write('\n ' + hex(ran) + ' | ' + addr)
                    file.close()
                    sleep(2)
                    wait = input("Press Enter to Exit.")
                    sleep(1)
                    exit()
                   
                if line_count==x:
                    list.clear()
                   
        if len(list)==0:
            print(' scan... ', str(n), end='\r')                       

Ca 42000 keys/s from c000000000000000 to ffffffffffffffff... The sector between  11_________________0 comprise a range of 131071 and will be processed.
The rest of this line are random numbers from 4 different generators..
The counter reflects the number of loops...

      B I N A R Y   S E E D   S C A N   Q U A D R O

 11_________________0____________________________________________

 1110010110110011011010011110001111111110100110111011100101000111

 0xe5b369e3fe9bb947 | 16jY7mM6wrpuAy53vKkh7QXm1JNdWK9Myu 19

 continue...

 1110010011000111001010001111000110100111001000001001110001000100

 0xe4c728f1a7209c44 | 16jY7Ezk5et98CVBWYEigGRwWovzhEtaQ3 121

 continue...

 scan...  192

Hi. I think your idea interesting. In this article another method how to recover privkey with add pubkeys what you think about this ?
https://toadstyle.org/cryptopals/66.txt

K is prrivkey, b is a picies of privkey:

For example, with n = 6, trace(58) gives me:

  # k = 111010
  # i = 2, b = 1
  add(1Q, 1Q)
  add(2Q, 1Q)
  # i = 3, b = 1
  add(3Q, 3Q)
  add(6Q, 1Q)
  # i = 4, b = 0
  add(7Q, 7Q)
  # i = 5, b = 1
  add(14Q, 14Q)
  add(28Q, 1Q)
  # i = 6, b = 0
  add(29Q, 29Q)

And here's trace(62):

  # k = 111110
  # i = 2, b = 1
  add(1Q, 1Q)
  add(2Q, 1Q)
  # i = 3, b = 1
  add(3Q, 3Q)
  add(6Q, 1Q)
  # i = 4, b = 1
  add(7Q, 7Q)
  add(14Q, 1Q)
  # i = 5, b = 1
  add(15Q, 15Q)
  add(30Q, 1Q)
  # i = 6, b = 0
  add(31Q, 31Q)





asic miner
github.com/achow1o1

update: Kiss
1J8wBriLsHvE52Jah75bKU1VSxj9btzLeq
1EhRDeGsoQVkAsiCtbDUbNnRW8a977bduS

Update2
2021.03.02
1CAsB6DdK6ezYzefzRe3SuQ1bZztsgaiQS
12JQGbJUHohtfoPbbZKbF8Z8hW5wYde1KN
1DKsKYzpqaTAg3Q4KrCBJ7AS4R1YyQrisE
1GymA7nkPZVBz3crj2NuFfGZsngTTX51Sb

How you crack them bro ? Thx



Enother interesting code - https://github.com/jairopaiva/BitcoinExprCracker

Search metadata for finding privkey... Needs modification for work

[moderator's note: consecutive posts merged]
jr. member
Activity: 49
Merit: 1
Test Code for the 64 bit range... ca. 310000000 keys/hr...

Code:
import random
from threading import Thread
import secp256k1 as ice
from time import sleep
print('\n ========= ================= ==ADDRESS HUNTER== ================= ==========\n\n')
y=1000000
count=-2000000
def process1(number):
    line_count=0
    num = random.randrange(0x8000000000000000,0xffffffffffffffff)
    for i in range(number):
        num+=i
        addr = ice.privatekey_to_address(0, True, num)
        lineA = (addr, hex(num))
        line_count+=1
                    
        if '16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN' in lineA:
            file=open(u"BTH.Target.Info.txt","a")
            file.write('\n ' + str(lineA))
            file.close()
            wait = input("Press Enter to Exit.")
            exit()
                        
        if line_count == y:
            print(' current line: ', str(lineA))
            line_count=0
                    
while True:
    count+=(2*y)
    number = y
    threads = []
    print('\n Total Scanned Lines: ' + str(count) + '\n')
    for n in range(0,2):
        t = Thread(target=process1, args=(number,))
        threads.append(t)
        t.start()
        
    for t in threads:
        t.join()

donate BTC:  1DonateZNR9BUaCqJTgXCoyyCpRSosFujR
I tested your code, but the wrong ddd code doesn't collide even with 2 hex, which is a big problem



this is what your code should look like which works at 100% delete tqdm slowing code 10%
import random
from tqdm import tqdm
import secp256k1 as ice
for x in tqdm(range(100000000)):
 num = random.randrange(0xd2c00,0xd2cff)
 add = ice.privatekey_to_address(0,True,num)
 if "1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum" in (add):
  f=open("von.txt","a")
  f.write(str(num)+"-"+(add)+"\n")
  f.close()

I see you didn't understand the principle of my code...

This code (slightly modified) for the search for that Pubkey of 16jY7.... with 4 Threads make more as 380000000 Keys in 30 minutes...
I'll keep working on it... I'm sure there's more to come^^

Code:
import time
import random
import secp256k1 as ice
from time import sleep
from threading import Thread
from multiprocessing import Value
t = time.ctime()
print('',t)
print('\n |========== ========== ==========! PUBKEY HUNTER !========== ========== ==========||============\n\n')
print(' [*] create privkeys....', end='\r')

list=[]
a=2
y=1048576
counter = Value('L')
def process1(counter,number,n):
    ran = random.randrange(0x8000000000000001,0xffffffffffffffff)
    for i in range(number):
        ran+=1
        pub = ice.privatekey_to_h160(0, True, ran).hex()
        lineA = pub, hex(ran)
        list.append(lineA)
        if len(list)==y:
            for line in list:
                line!='\n'
                with counter.get_lock():
                    counter.value += 1
           
                if '3ee4133d991f52fdf6a25c9834e0745ac74248a4' in line:
                    threads.clear()
                    a=0
                    f=open("16jY7.txt","a")
                    f.write(str(line) +"\n")
                    f.close()
                    print('\n\n Target found!! \n' + str(line))
                    exit()
               
                if (counter.value)%y == 0:
                    print(' [ Recent-Line:', str(line),'] Total:', str(counter.value))#, end='\r')
                    list.clear()
                       
while len(list)<=y:
    number = y
    threads = []
    for n in range(a):
        t = Thread(target=process1, args=(counter,number,n))
        threads.append(t)
        t.start()

    for t in threads:
        t.join()

ok i take it back, I won't go into that anymore there are only 2 options 64 address has total epic fail hex or in this range is not at all happy hunting

The range doesn't matter in principle, we're just unlucky that we came too late and the lower areas have already been solved... every higher range reduces the chance of finding the desired address. Of course, luck plays a big part...
The "fun" factor and further learning how to use Python inspire the whole thing...

so don't fret Smiley Happy hunting!! despite everything ...
jr. member
Activity: 67
Merit: 1
Test Code for the 64 bit range... ca. 310000000 keys/hr...

Code:
import random
from threading import Thread
import secp256k1 as ice
from time import sleep
print('\n ========= ================= ==ADDRESS HUNTER== ================= ==========\n\n')
y=1000000
count=-2000000
def process1(number):
    line_count=0
    num = random.randrange(0x8000000000000000,0xffffffffffffffff)
    for i in range(number):
        num+=i
        addr = ice.privatekey_to_address(0, True, num)
        lineA = (addr, hex(num))
        line_count+=1
                    
        if '16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN' in lineA:
            file=open(u"BTH.Target.Info.txt","a")
            file.write('\n ' + str(lineA))
            file.close()
            wait = input("Press Enter to Exit.")
            exit()
                        
        if line_count == y:
            print(' current line: ', str(lineA))
            line_count=0
                    
while True:
    count+=(2*y)
    number = y
    threads = []
    print('\n Total Scanned Lines: ' + str(count) + '\n')
    for n in range(0,2):
        t = Thread(target=process1, args=(number,))
        threads.append(t)
        t.start()
        
    for t in threads:
        t.join()

donate BTC:  1DonateZNR9BUaCqJTgXCoyyCpRSosFujR
I tested your code, but the wrong ddd code doesn't collide even with 2 hex, which is a big problem



this is what your code should look like which works at 100% delete tqdm slowing code 10%
import random
from tqdm import tqdm
import secp256k1 as ice
for x in tqdm(range(100000000)):
 num = random.randrange(0xd2c00,0xd2cff)
 add = ice.privatekey_to_address(0,True,num)
 if "1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum" in (add):
  f=open("von.txt","a")
  f.write(str(num)+"-"+(add)+"\n")
  f.close()

I see you didn't understand the principle of my code...

This code (slightly modified) for the search for that Pubkey of 16jY7.... with 4 Threads make more as 380000000 Keys in 30 minutes...
I'll keep working on it... I'm sure there's more to come^^

Code:
import random
import secp256k1 as ice
from time import sleep
from threading import Thread
from multiprocessing import Value

print('\n            ========== ==========! PUBKEY HUNTER !========== ==========      \n\n')
print(' [*] create privkeys....', end='\r')

list=[]
y=1000000
counter = Value('L')
def process1(counter,number,n):
    ran = random.randrange(0x8000000000000001,0xffffffffffffffff)  
    for i in range(number):
        ran+=i
        pub = ice.privatekey_to_h160(0, True, ran).hex()
        PubKey = pub
        list.append(PubKey)
        if len(list)==y:
            for line in (list):
                line!='\n'
                with counter.get_lock():
                    counter.value += y
                
                if '3ee4133d991f52fdf6a25c9834e0745ac74248a4' in line:
                    f=open("16j.txt","a")
                    f.write(str(line) + "-" + (hex(ran)) + "\n")
                    f.close()
                    wait = input("Press Enter to Exit.")
                    sleep(1)
                    exit()
                    
                if (counter.value)%y == 0:
                    print(' [+] Recent PubKey: ', str(line), ' | Total:', str(counter.value), end='\r')
                    list.clear()
                    

while True:
    number = y
    threads = []
    for n in range(0,4):
        t = Thread(target=process1, args=(counter,number,n))
        threads.append(t)
        t.start()

    for t in threads:
        t.join()

ok i take it back, I won't go into that anymore there are only 2 options 64 address has total epic fail hex or in this range is not at all happy hunting
jr. member
Activity: 49
Merit: 1
Test Code for the 64 bit range... ca. 310000000 keys/hr...

Code:
import random
from threading import Thread
import secp256k1 as ice
from time import sleep
print('\n ========= ================= ==ADDRESS HUNTER== ================= ==========\n\n')
y=1000000
count=-2000000
def process1(number):
    line_count=0
    num = random.randrange(0x8000000000000000,0xffffffffffffffff)
    for i in range(number):
        num+=i
        addr = ice.privatekey_to_address(0, True, num)
        lineA = (addr, hex(num))
        line_count+=1
                    
        if '16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN' in lineA:
            file=open(u"BTH.Target.Info.txt","a")
            file.write('\n ' + str(lineA))
            file.close()
            wait = input("Press Enter to Exit.")
            exit()
                        
        if line_count == y:
            print(' current line: ', str(lineA))
            line_count=0
                    
while True:
    count+=(2*y)
    number = y
    threads = []
    print('\n Total Scanned Lines: ' + str(count) + '\n')
    for n in range(0,2):
        t = Thread(target=process1, args=(number,))
        threads.append(t)
        t.start()
        
    for t in threads:
        t.join()

donate BTC:  1DonateZNR9BUaCqJTgXCoyyCpRSosFujR
I tested your code, but the wrong ddd code doesn't collide even with 2 hex, which is a big problem



this is what your code should look like which works at 100% delete tqdm slowing code 10%
import random
from tqdm import tqdm
import secp256k1 as ice
for x in tqdm(range(100000000)):
 num = random.randrange(0xd2c00,0xd2cff)
 add = ice.privatekey_to_address(0,True,num)
 if "1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum" in (add):
  f=open("von.txt","a")
  f.write(str(num)+"-"+(add)+"\n")
  f.close()

I see you didn't understand the principle of my code...

This code (slightly modified) for the search for that Pubkey of 16jY7.... with 4 Threads make more as 380000000 Keys in 30 minutes...
I'll keep working on it... I'm sure there's more to come^^

Code:
import time
import random
import secp256k1 as ice
from time import sleep
from threading import Thread
from multiprocessing import Value
t = time.ctime()
print('',t)
print('\n |========== ========== ==========! PUBKEY HUNTER !========== ========== ==========||============\n\n')
print(' [*] create privkeys....', end='\r')

list=[]
a=2
y=1048576
counter = Value('L')
def process1(counter,number,n):
    ran = random.randrange(0x8000000000000001,0xffffffffffffffff)
    for i in range(number):
        ran+=1
        pub = ice.privatekey_to_h160(0, True, ran).hex()
        lineA = pub, hex(ran)
        list.append(lineA)
        if len(list)==y:
            for line in list:
                line!='\n'
                with counter.get_lock():
                    counter.value += 1
           
                if '3ee4133d991f52fdf6a25c9834e0745ac74248a4' in line:
                    threads.clear()
                    a=0
                    f=open("16jY7.txt","a")
                    f.write(str(line) +"\n")
                    f.close()
                    print('\n\n Target found!! \n' + str(line))
                    exit()
               
                if (counter.value)%y == 0:
                    print(' [ Recent-Line:', str(line),'] Total:', str(counter.value))#, end='\r')
                    list.clear()
                       
while len(list)<=y:
    number = y
    threads = []
    for n in range(a):
        t = Thread(target=process1, args=(counter,number,n))
        threads.append(t)
        t.start()

    for t in threads:
        t.join()

jr. member
Activity: 67
Merit: 1
Test Code for the 64 bit range... ca. 310000000 keys/hr...

Code:
import random
from threading import Thread
import secp256k1 as ice
from time import sleep
print('\n ========= ================= ==ADDRESS HUNTER== ================= ==========\n\n')
y=1000000
count=-2000000
def process1(number):
    line_count=0
    num = random.randrange(0x8000000000000000,0xffffffffffffffff)
    for i in range(number):
        num+=i
        addr = ice.privatekey_to_address(0, True, num)
        lineA = (addr, hex(num))
        line_count+=1
                    
        if '16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN' in lineA:
            file=open(u"BTH.Target.Info.txt","a")
            file.write('\n ' + str(lineA))
            file.close()
            wait = input("Press Enter to Exit.")
            exit()
                        
        if line_count == y:
            print(' current line: ', str(lineA))
            line_count=0
                    
while True:
    count+=(2*y)
    number = y
    threads = []
    print('\n Total Scanned Lines: ' + str(count) + '\n')
    for n in range(0,2):
        t = Thread(target=process1, args=(number,))
        threads.append(t)
        t.start()
        
    for t in threads:
        t.join()

donate BTC:  1DonateZNR9BUaCqJTgXCoyyCpRSosFujR
I tested your code, but the wrong ddd code doesn't collide even with 2 hex, which is a big problem



this is what your code should look like which works at 100% delete tqdm slowing code 10%
import random
from tqdm import tqdm
import secp256k1 as ice
for x in tqdm(range(100000000)):
 num = random.randrange(0xd2c00,0xd2cff)
 add = ice.privatekey_to_address(0,True,num)
 if "1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum" in (add):
  f=open("von.txt","a")
  f.write(str(num)+"-"+(add)+"\n")
  f.close()
jr. member
Activity: 37
Merit: 1
Never give up on puzzle 64 guys!
it's only damn 16 HEX characters!
jr. member
Activity: 49
Merit: 1
start the scrypt with double click .. simply to use in Python...
You need:
faster "bit" there is a library from "ice" https://github.com/iceland2k14/secp256k1 there it is necessary to throw its libraries into the folder with the script.

donate BTC:  1DonateZNR9BUaCqJTgXCoyyCpRSosFujR

you dont have GPU ? any GPU ?

This code is only for CPU, working with two Threads...

Sure, I use GPU too, but I don't can coding for Cuda applications like, vanitygen, Kangaroo, etc...

i will sugggest same working your code at c and gpu, above link use git scripts, working 10005 better then you python code , ttoal same function,
even if your cpu have gpu inside, like i3-6100 process have gpu, its also work on this rotar, and auto use gpu at cpu based command,
https://github.com/phrutis/Rotor-Cuda, for fully random at gpu like bitcrack is BitCrack2, use that, you will forget python
dont forget merit me.... Smiley

I know Rotor-Cuda... and many more cuda programs... but I enjoy coding myself...

I do not have enough sendable merit. Sorry Dude!
member
Activity: 330
Merit: 34
start the scrypt with double click .. simply to use in Python...
You need:
faster "bit" there is a library from "ice" https://github.com/iceland2k14/secp256k1 there it is necessary to throw its libraries into the folder with the script.

donate BTC:  1DonateZNR9BUaCqJTgXCoyyCpRSosFujR

you dont have GPU ? any GPU ?

This code is only for CPU, working with two Threads...

Sure, I use GPU too, but I don't can coding for Cuda applications like, vanitygen, Kangaroo, etc...

i will sugggest same working your code at c and gpu, above link use git scripts, working 10005 better then you python code , ttoal same function,
even if your cpu have gpu inside, like i3-6100 process have gpu, its also work on this rotar, and auto use gpu at cpu based command,
https://github.com/phrutis/Rotor-Cuda, for fully random at gpu like bitcrack is BitCrack2, use that, you will forget python
dont forget merit me.... Smiley
jr. member
Activity: 49
Merit: 1
start the scrypt with double click .. simply to use in Python...
You need:
faster "bit" there is a library from "ice" https://github.com/iceland2k14/secp256k1 there it is necessary to throw its libraries into the folder with the script.

donate BTC:  1DonateZNR9BUaCqJTgXCoyyCpRSosFujR

you dont have GPU ? any GPU ?

This code is only for CPU, working with two Threads...

Sure, I use GPU too, but I don't can coding for Cuda applications like, vanitygen, Kangaroo, etc...
member
Activity: 330
Merit: 34
start the scrypt with double click .. simply to use in Python...
You need:
faster "bit" there is a library from "ice" https://github.com/iceland2k14/secp256k1 there it is necessary to throw its libraries into the folder with the script.

donate BTC:  1DonateZNR9BUaCqJTgXCoyyCpRSosFujR

you dont have GPU ? any GPU ?
jr. member
Activity: 49
Merit: 1
start the scrypt with double click .. simply to use in Python...
You need:
faster "bit" there is a library from "ice" https://github.com/iceland2k14/secp256k1 there it is necessary to throw its libraries into the folder with the script.

donate BTC:  1DonateZNR9BUaCqJTgXCoyyCpRSosFujR
legendary
Activity: 3500
Merit: 2792
Enjoy 500% bonus + 70 FS
how can i start the script and what do i need?
jr. member
Activity: 49
Merit: 1
Test Code for the 64 bit range... ca. 310000000 keys/hr...

Code:
import random
from threading import Thread
import secp256k1 as ice
from time import sleep
print('\n ========= ================= ==ADDRESS HUNTER== ================= ==========\n\n')
y=1000000
count=-2000000
def process1(number):
    line_count=0
    num = random.randrange(0x8000000000000000,0xffffffffffffffff)
    for i in range(number):
        num+=i
        addr = ice.privatekey_to_address(0, True, num)
        lineA = (addr, hex(num))
        line_count+=1
                    
        if '16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN' in lineA:
            file=open(u"BTH.Target.Info.txt","a")
            file.write('\n ' + str(lineA))
            file.close()
            wait = input("Press Enter to Exit.")
            exit()
                        
        if line_count == y:
            print(' current line: ', str(lineA))
            line_count=0
                    
while True:
    count+=(2*y)
    number = y
    threads = []
    print('\n Total Scanned Lines: ' + str(count) + '\n')
    for n in range(0,2):
        t = Thread(target=process1, args=(number,))
        threads.append(t)
        t.start()
        
    for t in threads:
        t.join()

donate BTC:  1DonateZNR9BUaCqJTgXCoyyCpRSosFujR
newbie
Activity: 9
Merit: 5
I’ve tried to use bitcrack and kangaroo and a few other windows based apps. I never thought about parallels but thanks so! You’re talking about M1 Mac right? I obviously should utilize the time to learn lol


I have nothing but free time on my hands lately and I've been like obsessed with it, it's fascinating. I was trying to take a jab at it with some computer experience and I find that all (well most) of the tools out there for cracking aren't compatible with my macbook air (lastest m1 model). I was wondering if anyone had any recommendations fo software or anything  considering my circumstance and using a macbook air, I know it's nothing compared to what's out there but it's all I have. Any recommendations  because I'm all ears!
I've used MacOS before, I've never had any compatibility issues with these programs:
Parallels Desktop - https://www.parallels.com/
Homebrew - https://brew.sh/
member
Activity: 174
Merit: 12
I have nothing but free time on my hands lately and I've been like obsessed with it, it's fascinating. I was trying to take a jab at it with some computer experience and I find that all (well most) of the tools out there for cracking aren't compatible with my macbook air (lastest m1 model). I was wondering if anyone had any recommendations fo software or anything  considering my circumstance and using a macbook air, I know it's nothing compared to what's out there but it's all I have. Any recommendations  because I'm all ears!
I've used MacOS before, I've never had any compatibility issues with these programs:
Parallels Desktop - https://www.parallels.com/
Homebrew - https://brew.sh/
Jump to: