Pollard's kangaroo ECDLP solver

[wedom]

with iceland bsgs repo create bpfile and bloomfile:
python bsgs_create_bpfile_bloomfile.py  2000000000 bpfile2000.bin bloomfile2000.bin 32

bpfile only 1398KB,but bloomfile2000.bin about 10GB,is this right?

64000000000

[1714474496]

1714474496

[1714474496]

1714474496

[1714474496]

1714474496

[COBRAS]

hi there, wandering any demo releases of your program upto 84? please thanks .
getting bored doing nothing, have some time. 2days off.   

Whandering use invited slaves to brute him own privets, in some previous him message he is show a 10000x Tkeys/sec key rate worked on my pinkeyes, yes you really think what this is a wandering pc ? No he talk about slaves what unwired to his puzzle 65 etc...

[yoyodapro]

{Quantpy Engine Beta 0.9.2}

Compiling Quantum Gates.........Done! (4s 09/17/2021 094307Z)
Mapping 63 Qubits (1 Qubit per node)....Done! (2s 09/17/2021 094311Z)
Loading 63.py.......... bloom filter...........................................................Done! (2.9TB) (2,172MB/Qubit)

[1][1][1][0][0][0][0][1][0][1][0][1][0][1][0][1][1][0][1][1][1][1][1][0][1][1][0][0][1][0][0][1][1][1][1][1][0][1][1][0][1][1][0][1][0][0][1][1][1][1][1][1][1][0][1][0][1][0][1][0][1][1][0]

53114562000.40 Bflips/s (3,346,217,406,025.2 keys/s) 0 Keys Found (0:38)

[WanderingPhilospher]

{Quantpy Engine Beta 0.9.2}

Compiling Quantum Gates.........Done! (4s 09/17/2021 094307Z)
Mapping 63 Qubits (1 Qubit per node)....Done! (2s 09/17/2021 094311Z)
Loading 63.py.......... bloom filter...........................................................Done! (2.9TB) (2,172MB/Qubit)

[1][1][1][0][0][0][0][1][0][1][0][1][0][1][0][1][1][0][1][1][1][1][1][0][1][1][0][0][1][0][0][1][1][1][1][1][0][1][1][0][1][1][0][1][0][0][1][1][1][1][1][1][1][0][1][0][1][0][1][0][1][1][0]

53114562000.40 Bflips/s (3,346,217,406,025.2 keys/s) 0 Keys Found (0:38)

wow...amazing! Do you think it can solve for y2 = x3 + 7 ?? Because if y2 = x3 + 7 then y=y+y-y+y-y and if that is true then if y = y, then x = x!

[yoyodapro]

{Quantpy Engine Beta 0.9.2}

Compiling Quantum Gates.........Done! (4s 09/17/2021 094307Z)
Mapping 63 Qubits (1 Qubit per node)....Done! (2s 09/17/2021 094311Z)
Loading 63.py.......... bloom filter...........................................................Done! (2.9TB) (2,172MB/Qubit)

[1][1][1][0][0][0][0][1][0][1][0][1][0][1][0][1][1][0][1][1][1][1][1][0][1][1][0][0][1][0][0][1][1][1][1][1][0][1][1][0][1][1][0][1][0][0][1][1][1][1][1][1][1][0][1][0][1][0][1][0][1][1][0]

53114562000.40 Bflips/s (3,346,217,406,025.2 keys/s) 0 Keys Found (0:38)

wow...amazing! Do you think it can solve for y2 = x3 + 7 ?? Because if y2 = x3 + 7 then y=y+y-y+y-y and if that is true then if y = y, then x = x!

I would need .1 additional TB of ram to accomplish that, however when considering Elliptic curves over finite fields one must consider Hasse's theorem on elliptic curves to include the point at infinity


The set of points E(Fq) is a finite abelian group. It is always cyclic or the product of two cyclic groups. For example the curve defined by over F71 has 72 points (71 affine points including (0,0) and one point at infinity) over this field, whose group structure is given by Z/2Z × Z/36Z. The number of points on a specific curve can be computed with Schoof's algorithm.

Studying the curve over the field extensions of Fq is facilitated by the introduction of the local zeta function of E over Fq, defined by a generating series


where the field Kn is the (unique up to isomorphism) extension of K = Fq of degree n (that is, Fqn). The zeta function is a rational function in T.
Moreover,

with complex numbers α, β of absolute value . This result is a special case of the Weil conjectures. For example, the zeta function of E : y2 + y = x3 over the field F2 is given by this follows from:



Also while writing this my CPU died. I couldnt keep the temperatures close enough to absolute zero that my CPU melted into a steaming pile of non-Newtonian fluid.... I think it just blinked at me?

[yoyodapro]

{Quantpy Engine Beta 0.9.2}

Compiling Quantum Gates.........Done! (4s 09/17/2021 094307Z)
Mapping 63 Qubits (1 Qubit per node)....Done! (2s 09/17/2021 094311Z)
Loading 63.py.......... bloom filter...........................................................Done! (2.9TB) (2,172MB/Qubit)

[1][1][1][0][0][0][0][1][0][1][0][1][0][1][0][1][1][0][1][1][1][1][1][0][1][1][0][0][1][0][0][1][1][1][1][1][0][1][1][0][1][1][0][1][0][0][1][1][1][1][1][1][1][0][1][0][1][0][1][0][1][1][0]

53114562000.40 Bflips/s (3,346,217,406,025.2 keys/s) 0 Keys Found (0:38)

wow...amazing! Do you think it can solve for y2 = x3 + 7 ?? Because if y2 = x3 + 7 then y=y+y-y+y-y and if that is true then if y = y, then x = x!

I would need .1 additional TB of ram to accomplish that, however when considering Elliptic curves over finite fields one must consider Hasse's theorem on elliptic curves to include the point at infinity


The set of points E(Fq) is a finite abelian group. It is always cyclic or the product of two cyclic groups. For example the curve defined by over F71 has 72 points (71 affine points including (0,0) and one point at infinity) over this field, whose group structure is given by Z/2Z × Z/36Z. The number of points on a specific curve can be computed with Schoof's algorithm.

Studying the curve over the field extensions of Fq is facilitated by the introduction of the local zeta function of E over Fq, defined by a generating series


where the field Kn is the (unique up to isomorphism) extension of K = Fq of degree n (that is, Fqn). The zeta function is a rational function in T.
Moreover,

with complex numbers α, β of absolute value . This result is a special case of the Weil conjectures. For example, the zeta function of E : y2 + y = x3 over the field F2 is given by this follows from:



Also while writing this my CPU died. I couldnt keep the temperatures close enough to absolute zero that my CPU melted into a steaming pile of non-Newtonian fluid.... I think it just blinked at me?

░̶̡̢̛̜̻̲̱͓̪̜͕̪̼̘͓̥̭̤͙̰̭͉͈̝͉̝̤̥̱̜̊̆̓̎͐̈́̂̋̓́̎̾̅̓̎̈́̈́̏̚͜͜͝͝ͅͅ█̸̡̧̨̡̩̞̦̦̘̰̻͔̣̩̠̳̖̭̺͎͎̗̥̼̬̙̫̺͓̯͍͓̣̋͐̾͑̈́̈́̌̈̓̅̅̅̄͒͗́̇̍̅̏̈̂̍͋̔̌̎̕͘̕͠͝͝͝█̷̳͎̊͝█̵̛͍͙̃̎̐̈́̉͗̓̌̾̃̀̓́͋͊̀͛̓͋͘͘͘͜͝͝͝͠͠͝█̸̨̢̢̡̡̛̛̠̻͎̲̭̝͈̞̘̼̯̭̠̤͇̥̝̗͓͚̱̱̞̣͕̩̖͓̟͔̝͕̥̹̩̹̟̜̮̫̻̤̅͋̀̉͛͂̈́̉̾̽͑̈̉̀͊̋̈́͗́̓͛͊̐̈́̀́͘͘̕   █̷͇͙͙̈́̓̾͑͌̒͒̓̋̈̾̌̒̑̽̂̒͂̉̓̊̆́̀̈́̈͑̓͋̽̄͘̕͝͝͝█̶̨̞̭͙̳̯̤̣͓̞̞̳̳̈́͊̏͛́͛̋̏̽͊̋͂͜╗̵̢̢̛͍͉͍̠͔̰̯͙͕̣͔̖͇̟̩̥̳̀̋̉̾̌͒́̈́̈́̀͆̐̉̎̋́͗̈́̑̈́̓͑̉̀̅̾̑̏̓̌̓̏̓͊̈́̎͑̍̿̂̈͛̚͠͝͠͝͠͝█̷̡͎͉͕͕͔͎̭̈́̓̽̊͌̍̓͛̀́͌̄̎͛̓̑̚͝͝͝͠█̵̡̡̧̻͉͍̟͔̲͖̤̣̜͉͈̬͍̦̲̪̭͚͛̍̿͌̽̓͒͋̍̉́͜͜ͅ╗̶̧͓͕̙͓̺͎̗͎͇̹̤̣̠̪̗͚̭̗̝̱̫̱͚̘͐̾͆̔̂ͅ░̸̧̢̡̛͚͕̫̬̻̞̥̼͔̰̤̩͚͉̺̩͍͈͚̹̼̬̣͔͈̱̥͔̥̫̬͎̙̳̞̠̗͊̓͐̓̓̔͐͒͊̊̎͌̈́̄͛̐̅̔̋͒͆̽̀̽̋͂͘͘̚̕̚͘͠͝͝ͅ░̷̢̢̨̛̛̮͍̖̩͚̲͚͕̞̗̩̫̥̻̰̹̳̘̝̟̻͔̜̹̫̱͔͔͇̺͈̘̭͖̱͒̐̊͗̊̾̊̊̈́̈́́́̈́͐̈́͂̊̈̀͌͗͗̔͗̑̆̌̈̿͐̆͒͋̄̌̄̀̈́͜͜͝͠͝͠͝░̸̡̧̢͖̯̪̖̦̟̖̦̬͇͔͇͓̦̰͙̟͉̜̥̫̑̅̾̈́͆̃͌̀͐͋̄̔̅̚̚͝͝ͅ█̶̢̢̢̧̨̨̢̨̛̛̻̩̘̘̯̭̻͈͍̞̰̞̞͉̩͚̰̥̰̼̝̻̗̝̮̳͍̼͇̖̺̞͖͙͕̈́̈́̔̋͛̍̀̈́͗̃̚͜͜͜͠͠ͅ█̵̡̨̨̡̛̛̙̻̻̯̜͙̲̥̬̩̤͚̖̯̟̝̦̦̙͓̰͚̤̗̯̪̞́̋̈́̊͋╗̵̡̛̛̛̛̣̝̫̙̗̗̯̫̪̱͕̻̪̤̩̱͔͖̳̮͙̟̳̣̞̦͉̬̯̩̥͖͕͈̺̜̻͉͐̏̿̀̃͆̓̋̋̒̅̏͛͊̓̽̄̌̒͌̈́͐͘͝͝͝ͅͅ░̴̯̤̺̺̳̼͇̪̬͔͎͔̞̹̹̫̭̼̭̱͖̟̝̱̜̠̙̝͕͈͓͇̥̼͓͖̲̯͇̲͉̠̬̭̬͋̽̓̔̂̈̐̀̈͌̂̆̔̍̔͛̓̓̉̽͗̈́͗͑͜ͅͅ█̵̡̨̛̛͔̦͙̩̤͓̪̩̣͕̤̱̱̞̻̝͚̱̹̩͖̞͙̠͔̘̳͎͍̮̖̰̺̘̰̲̪͇͆̈́̓͌́͊̽̆̇̀̃̈́͂̌̿́̂͂͛̿̋͗̃̀̾͋̕͜͜͜█̸̧͍̝̺̫̥̝̱̺͖͔͚̈́̾͊̑͑͒̐̏͂̀̿̀͊̊͑̆́̎̍̐̅̕̕̚͠  █̵̢̛̞̘̰̞̖̦̜̜̑̎͊͘█̵̨̢̢̛̝͈͍͓̙̬̜̼͈͚̺̗̺̱̟̮̱͉͕̟̣̜̦̱͔̼̙̺̭͚͓̞̙́̓̇̑́͒͑͐͗̌̍̐́̇̔̆̆̆̋̑̃̆͜͝ͅ█̷̨̧̡̛̛̼̯̩͉̬̼̱͎̮̘̪̼̩̗̲̲̮͍̯̤̥̘̤̜͖͈̗̰̱̮̌̀̂̀̄͛̀̋̐̾̄̃̆̓̈́̈́̋͆͆͑͊͊̽̈́͐̆͗͑̃̈́̽̆̒͂̔̋̏͒̈̍̏̕͘͘͘͘͘͠ͅͅ█̷̢̡̛̛̰̩͈̲̬̼̪͖̙͔͖̤͔͎̣̰̪͎͌̎̈͊̍̆̎̀̏̍̏̉̈́͑͋̋̕͘̚͝╗̵̨̢̖͚̥̩͕̺͉̪̆͐͊̒̆͛͆̈́̀͋̎̇͆͗́̆͋̃̿̃̌̊̓̏͛́͗́̀̓͑̏̓̍̈́̚̚͝͠͠͠͠
̶̧͓̙̍̂̑́͗͑̒̈́͆̽͑̍͑̓̐̄͑̎͒͗̆̀́̀̄̚͘̕͠█̴̧̢̛̛̜̺͈̭̠̖̭̜͈̙͚̗̦̭̺͍̠̜̮̖̥̺̹̹̣͈̖̗̪̗̳̝̮͉͇̱͚̦͓͎̫̰̱̰͚̌̇͐̂́̈̃̿̑͂͛͂͊̓̐́̆̂̈́̍̇͐̐̍́̐͐̆̐͆͊̍̈̀̕͜͜͠͝█̶̨̨̢̨̫͚̰̱͉͕̭̤̗̖̯͕͍̻͉̯͈̼̳̲̫̝̬̥̜̦̜͔̱͈̰̞̮̭͈̲͍̰͔͖̗̟̓͛͌́̏̀͗̿̆͂͗̒͗͌̊̌͒͑̑̈̀͑̆̏̃̽̃̐̀͆̕͝͝͝͠͝ͅͅ╔̴̡̢̧̨̡̢̛͈̥̞̭̫̤̼͔̪̻͙̥͓͓̫̙̲̼͓̳̪͚̭̠̞͈̜̲̝͕̹̳̤͚̗̋͌̑̓̇̅́͂̾̓̀̀̎͗͌̉̊̃͊̈́̋̒̈́̎̍͗̎̉́̊̆̍̽̈́̕͘͜͝͝͠͝ͅͅ═̷̛͍̩̜̟͇̼̻̰̳̳̥̙̻͕̠̱̻͖͔͎̳͔͙̱̝͎͉̖̤̼̠̬̰̫̺̝̹͔̙͚̥̝̻̲́͋̉͋́̓̉̏̌̽͆͆̊́̐̑̔͗̉͂͛̃̽̅̋̕̚͠͠͝ͅ═̵̛̖͕̮̰̞̹͉̮̮̩͓̝̖̓̇̈̌̓̔̄̅͊̈́̏̅͗̀̔̀͒̓͗̌͐̐̋̇̆̽̏̓̾͑͆̒͘͘͘̚͜͜͝͝͠͝═̸̢̢̡̛̗̖̠̦̗̬͙̮̲̪͓̞̤̣̩̺̯̳͍̦͎͖̯̬̘̞̹̭̪̫͉̿̈̂̎̍͊̊̽͑̎̊͛̆͜͜͜͝͝ͅͅ═̷̡̧̛̛̘͓͔͕̪̞̜̘̻̹̲̬̥͓̞̺̙̞̙̣͈̯̙̖̙̫̆̃̑͌̐̈̔̂̂̔̓̀̐̈́̅̆̏̈́̊̅̔̈́͐̀̎́̄̓̌̆̿̈́͑͘͝͠͝╝̴̨̧̧̨͇̣͇̬̻̰̹̙̯̼̮͇̲̲͚̲̼͓͈̰͚̩̱͇̮̠͇̟̹͔͖͍̤͈͇͕̥̺͚̤̞̙̑̽͑̓̇̇́̄̈͒̀̊͜͝     █̵̛̰̞̂͐̇͊̄͂͌́̍͋̓́͒͐̑̀̓̒͒̑̉̋́̍̈́͂̊̆̀̂͛̈̇̎͝͠͝͠█̵͎̮̔̓͊͆͐║̶̢̝͈̬̃̒̎̅̎̏͑̏͗̂̐̅͑̕͝░̸̧̧̡̨̛̠̞̳̠͉͓̞͔̭̣̩̞̠̤̳͈̼̻̖͎͇͙͇̪͗̊̀̄̔̊́͒̓̈͒̓̋̏̈́̆̊̂̃̃̾̃̓̽͒̈́̿͌̅̍̚͝͝͝͠͝░̷̢̢̡̪͍͇̜̹̯͖̹̥̳͈͔̝͚̙̖̻̯̮̟̮̙̩̼̫̯͖̰̣̤̝̮́̈́̈͐͌̒̒̔́͛͑̈́͗͘͘͠͠░̸̡̨̨̘̳̜̜̖͉͓͎̬̟͙͇̯̙͖̳͖͇̲͓͙̹̩͖̱͚̖̺̘̖̳̜̻͙̄̏̐̀́̒̀͒̅͂͋̒̒ͅ    █̴̡̘̪̹̻̬̭̯̣̦͔͖͈͙̥̫̲̮̪̖̱̇͒̎ͅ█̵̧̧̨̗̰̪̲̲̪̰̦̺͚͇̳̬̫̍͌̾͝ͅͅ║̸̧̡̡̛̣̖̮͇̻̫̘̭̣̼͚̩͚̣̭̗͚͇͚̙̫͖̳̬͛̃̀̉̀͐͛̇͂̀͐͛̿͊͆̂͑̈̆̈́̓̂͜͠  █̴̡̧̯̳͖̜̣̰͖̫̝͚̠̲̘̫̻̗̩͉̠̗̤̮̪̺̝̔̀͗̚͜ͅ   █̸̨̧̨̢̫̼͔̪̺̟͙̺͉͚͍͔͍̞̣̰̻̱͎̬̠̝͕̰͇̱̟̯̞̙͓͚̺̱̺̯͖̖̹̳͇̈́͑̂̆̊͑̑͘͜͜    ╔̸̧̻̪̳̜̜̞̼̯̯̗̘̃̌́̄̈́̉̑̑̈͛͌̄̑́͝͝═̴̨̢̧̰̫̲͚̩̟̘̼͓̳̳̳͎̪̳̬͈̯̜̬̟͈̭͓̞̳̬͍̹̰̘̖̻͓̼̤͒͗̂̆̂͛͆͌̊̓͋̀̓̑̆̿̽̈́͆́̊͆̇̑̇̐̀͂̔́͘͘̚͘̚̚͝͠͝͝═̷̢̢̢̡̣͚̝̣̪͚̣̙̦̰̖̟̗͖̖͚̹͇̳̘̲͍͙̯͇͍̲̺̱͍̪̟̞̪̩͎͕̠̓́̉͂̅̐̒̀͋͆̌̄̅̈̋̕̚͜͝ͅ═̸̧̞̙͕̝̼̤̪͙̦͎̘͖͖͉͎͔͓͚̙̠̆̈̍͌̀͂̑̽͝͠͝͝═̴̧̜̰̜̠̭̻̬̩̹̟͈̘̯̬͔̲̭͇̰̩̙͈̦͖̮̮̃̄ͅ╝̶̡̧̛̻̖̣̳̱̮͉̰̫̻͍̠̺̻̬̮̘̭̜̤̪̖̗͎͔̘̞̱͍̤̓͛̇̎͊̈́̊̊͊̎̀̒̆̃̀̽̍́͐̽͂̏́̏͘͜͠͝͝͝͝
̷̢̢̢̡̧̩̖̦̰̙̦͎̞͓̟̪͚̫͙͉̫͎̱͔̯̫̮̜̙͓̱̬̙̺͈̭̳̲͍̦̪̃̈́̋̄́͊̄́̊́̈́̅̿͐̔̈́̓̑̆̑͌̂̈́̂͗̍̈́̓͗͊̓̓̈́̎̀̒̕̕̚͝͝͝╚̸̣̅̌̌́̍̈́̎͗̈́͋͌͒́̇̓̏̾͂̎̄̈́̌͛̅́̔̇̽͐̈́̕̚͘̚͝͝█̵̝̖̹̤̌̎̂̓͒͆̐͊̑̏̀͋ͅ█̷̨̨̧̨̢̼̦̠͎͔͕͈̬̭̲̠̟͓̣̯̲̜̘̪̝̣̜͍̳͕̣̤͔͇͔̥̻͓͓̱͈̩̹̟̙̻̠̤̝̫̏͛  █̸̛̲͎̟̯̺̝̱̪̞͍̄̇̏̋̓͐͌̍̏͗̈̇͒̀̌̓͒̐̑̏̾̇͑̑̃̎̏̂̕͘͘̚͜͠     █̴̨̧̨̛̞̗̖͉͎̞̤̖̼̩̤̰̹̝̰̯̃̊͐̾̍̍͋̐̆͑́̈́͂́̾́͠͠█̷̡̛̹̭͍͔̩̱̙̻͎̖͈̱̲̒̎́̇̈́́̌̓̂̿̄̀̇̎̔̾̅̎́͐͊́̿͆̄͐͛͘̕͘͝͝͝╗̴̨̨̛̛̜̫̞̼̟̬͉̻̼͎͉̘̣̺͔̝̟͔͇̠̜̟̺͉̮̹̟̻͕̼̫̐̈̈́̽͒͑̑̈́͒̂̐͆̑̏̎͛͆͑̎͑͛̐͂̉̓̎̔̈̋͗̒̕͝͠͠͠░̶̛̠̝̗͊͂̌̋͋̾͗͛̓͌̉̌͆̃̆͆̿͆̍̒̔̏̃̆͛̌̓̿̈́̓̒̈́̕̚͝͝͠͝  █̵̧̢̪͍̺̜̣͕̪̯̻͇̰̩̥̖̜͇̠̦̠̙̱̬̳̻͈̼͔̥̤̺͎̭̐̔͜ͅ  █̸̡̡̧̞̯̳̼͇̰͈͎̹̳̥̖͉̹͔̮̲̱͉̩̭͒̄̿͋̏͛̌̓͜║̸̡̢̨̡̢̼̩͓̟̝̠͖͉̪͚̙̘͕̖̞̰̺̳̖̣̭͎̳͈̞̖͍̖͎̬͖̯̣̔̽̀̓͑̿͊̈́̉̔̓͛̒͂̋̈́̓͆̈̈́͆͛̏̏̉̈́̈́̎̇͂̎͂̇̓̌̅̉̃̉͜͜͜͜͝͠͠͝͠͝͝͝░̷̧͔̬̤͙̪̮̜͍̪̳̤̥͉̖̤̦͔̮̪͖̫̜͙̣̥̙̓́̓̔̉͒̀̈́̿̔͗̈́̈́͑͑̃̅͐͂̎͂̌̿̑́̈̓̒̐̎͜͝͝͠͝͝░̷̢̢̨̨̨̢̢͙̞̥̝͇̝̣̯̱͖͇̠̰͎̪̣̝̳͕͔̩̻̪͍̮̩͕͊̈́̓̊͗ͅ░̵̨̡̛̦̞̜̗̮̯̠̺̟̞̼͔͕͖͇͙̩͍̹͂̈́͒̎̈́̉́͜͜͠͝ͅ    █̴͚̭̯̗̳̃̀̒̽̌̽͊̓̌̏͒͆̔̔̋̽͗̂̾̔̓̄͋̎̍͆̐̈̈͗͘͘̚͠͠͝͠͝͠͝█̶̢̢̛̛̛͕͈͎̝̳̰̙͓̲͕͍̀̂͛͐͂̿́͌̈́̌̐̿̂̏̇̃̇̓̚͝͝║̴̻̣̮̟̹̘̞̖̜̪̤̫̠̱̺̝̙̙̘̥̹̮͖̪̟̮͉̞̺͔̤̰̥̠̼̼̞̺̖͑̍͒̿̄̃͊̍̓͜͜╚̸̨̛͇̹̞̙͖̣͓͍̀̽̆̈́̌̾̈́̾̎̽͑̂̒̅̈́̾̌̂̒̂̐͌͌̌͌̑̅͊̕͘͝͝█̷̢̱̰̜̫͖͈̝͙̪͓̦͎͈̘̄͛́̈͌͊̓̀̃͒̅̔͂͛̀̊͊͊̈́͐̈́̑͋̿̂͝█̵̢̡̛̰̲͉̲̺̝̝̫̈́̈̋̀̀̐͆͒̊͋̓͛̆͌̍̓̾͛͆͐͌̎̋̅̍͛̑̈̓́́͋́̽̾͒̃̚͘͠͠͠͝͠͝   █̶̨̨̛̱̜̯͑̅͂̋͋̐̂̈́́̍̇̓̇̇̅̀͠͠█̷̢̡̨̛̜̹̳͇̰͓͔̞̆̊̄̈́̍̑̽̐́̊͂̈́̂̒̽̇̋̅̾̓͆̅̀͐̌̒͑́̎͘̕̚͜ͅ█̴̨͎͍̱̜̺͈̝͔̣͇̹͈̤̿͛̃̀͒̾̇̈̉̀͐̀͊̑̿̚͝͠͝╗̴̧̛̪͚̖͙̫͍̼̎̈́̉̃̀̇̋̑͂̂̔̐̐́͒̅̽̌͒͒̅̂͛̀͐̆͌̾̅̓̕̕͜͜͝͝͝ͅ░̸̡̧̧̫̺̬̲̪̺̖̘̺̹̟͔̤̤͍̪̺͎̙̠̬̤̦̩̼̙̩̫͍̠͙͎̗̳̀̊̿͛̈́̿̐̔̒̈́̋͛͐͂͋̈̒̉̋̓̀͑͊̇̂̈́͆̒̉̑̓͊̏̀̅̅͘̚̕̚̚͝͠ͅ
̸̢͕̗̞̬̠̘̩̼̮͓͎̥̗̼̠̤͕͇̳̣̹̦̦̘̺͇̯̩̥̻͙̬͐͗̈́̀̀̊̇̐̎́͂͊͂̈́̄͐̒̈́̿̓̄̒͆̎̍͐́́͘̚͜ͅͅ░̷̨̨̛̛̙͉̳̯̩͉͚̜͍̘̩͇̘̼͖̬̲̝̹̞͎̮̝̰̩̦͇͖͙̠̞̪̮̪̣̇̒̅͒̓̒̌̎͛̄͆̎͌̐͊̈͊͐̓̏̎͝͝͝͝ͅͅ╚̷̧̢̢͖̝̥͚͍͉͇̤͚̰̼͇̫̮̱̮̼̰͖̞̫͉̩̲̹͈̘͕̳͇́̆͂̈́͂͋͌̌̀̔̑̋̂͌͊̍̈͒̑̇̋̌̾̋͆̿̐̓̀̇͛͐̀̒̊̽̐̊̈́͑̈́̚͝͝ͅͅ═̷̛̟̈́̅̑̾̏́̉̈́̍̐̿̊̇̀̕͘═̷̧̼͈̩̫̭̖̫̠͓͂͗̾̈́̋̈́̊̀̆̎̓̐̋͗͜͝═̶̳͓͉͈͙͖͔̭̹̯͍̣̎̓͌͋́́̃́̂͊̈͆̈̀̔͋̕̚█̷̯̹̯͙̹̗̼̻̺̮̽̉͐͂̀̎̂͗̾̈́͝͝█̸̢̨̡̡̝̭͖̟̥̱̗̥̗̻͈̦̙͚̰͉̹̈́̊̄̔̿͐̈͆͒̋͆̈́̎̃̿͆̇̚͝͝ͅ╗̵̦̞̻̯͍͙̥͇̹̗͎͕̘͖͙̮̠͚̹̈́̊̒̊͑̿̈̏͒̽̑̓̽̈́̓͊̓̕̕͜͜͠͝█̶̡̧̧̜͍̦̖̣͈͖̟̰̠͇̜̱̭͖̟͙̹̱̣̭͔̠̮̮̠̹̲̠̺̰̰̘̩̠̘̤̙͇̠̠̝̽͊̏͜ͅ█̵̢̛̖̯̞̏̈́͆̽̒̔̒̅́̒͊̃́͂͑́̍͒͒̈́͐̔̈́̿͂̌̈͆̔͑̏͌̏̎̉̚̕͜͝║̸̨̡̧̦̺͕͈̱͕̙̭̤̲̭͈̜̜̳͙͈͕̮̦͚̹̠̩̫̲͙̮̝͍͈̄͑̃͊̏̌̆̓̓̽̃̍̈́͐͒͊͌̂́̊͐̒̓̌͆͌̏̀̽̈́̒̔́͑̎͐̽́̆̃̔̃͗̕̚̕͜͝ͅͅͅ░̷̢̨̘͔͙̥͇͚̝̖̭̝͙̭̦̦̗̱̠̟͚̠͇̫͔̗̤͚̤̩̯̻̦͉͇̖͚̣̖͓͔̻͉̜̼̰̼̞̪̉̀̃̔̈́̂̊̈́́̈́̒̔̀̌̽̀̔̄̍̔͑̐̈́̈́̀͗͛̽̇̄͒̀̑̉͂͘̕̕͠͠͠͠͝͝͝͝░̸̡͚̟̩͔̥̃̀́░̶̢̢̩̰̳̜̻̮͇̘͓̳̣̜̜̩̲͇̜̮͚̺̺̤̪̲͆̀̓̈́̓͊̒̏̌̆̍̔̇̎̌͌͋̓͆̐̇̋͋̀͜͜͠͝͝ͅͅ█̴̢̢̧̧̞̭͈̳̖̳̤̫̻̪̤͎̹̫̼̺̺̮̺̥̋͘͜█̶̧̡̗͕͍͖̩̬̫̫͕̬̖̩̬̳͂͂͆̌̈́̏͌͗║̷̧̣̣̝͓͔͉̘̻̙̼͇̺̙̹̲̬͙̙̖̘̗̫͑̂̇̂́̈́̈͛̈́̈̒̃̇̾̀̀͛͋̄͘͘͠ͅ░̶̨̢̦͔̘̯͕̲̯̩̭̼̤͍̝̱͔̟̣̙͈̪̼̩̱̣̺̤̗̪͋̍́͂̔̐͆̑̈́̐̾̈́̚͘͜ͅͅ╚̵̡̧̢̛̠͚̭͎̝͍̳͇̬̻̗̪̞̭͈̼̪̺̞̥̼̮̩͍͓̝̞̪̻̗͇̟̬̳̯̖̭̼̯̻̮̓͂͛́̆͌̃͗̾͆̑̅̒̈́̒́̿͛́̊̌̾͌̓̓́͛̎̕͜͠͝ͅͅ═̸̧̧̧͖̦͍̭̭̯̩̭̳͈̟͓̥͈̦̮̲̼̳̹̜̹̯̭͍͔̱͕̱̖͈̭̩͕͕̏̓̑̂͝═̸̧̧͇̭̬̩̬͔̗̰͙̜̥͎͈͇͈͚̞̰̹̲͑̂̀̽̈͒̋͐̎̄̈́̉͌́͑̚͝͠═̶̨̢̻̙̝̭̲̲͖̟̙̠̩͉͖̲̭̲̼͎̦͔͎̥͖̫̰̟̖̞͇̫̪͉͖̖̒ͅ█̶̢̟͓͕̲̉̌͂̿̊̂̔̽́͐̐͛̎͗̏̐̑͌̽͂̈̐́̓́̃͐͂̀̐̾̎̏͘̕͘̕̕̚ͅ█̴̢̛̖̬̝͇̦̦̭͔͈̫͙̪̊̑̽͑̏͊̓̇̄͒͆͐̀̒̽̉̈́͛̿̓͊̏̒͐̾͐̓̾̿̓͐͌̕͝͝͝͠͝͝͠╗̸̩͚̗̓́̉͌̚̚͝
̷͉̠̘̩̙͆͑͊̈́̌̉̂͆̓͑͊͛͝͠█̶̨̡̢̜̬̘͙͈̹̥̩̩̭̼͇̻̣͇͙̤͍̻̃̅̽͒͆̈́̊̃̌̏́̀̿̌͠͝ͅ█̵̨̡͇͖͉͉͓͎̺̹̳̠̪͎͈͉̻̪̩̳͙̳̭̺͉͓̈́̑̅͑̏̈́̆̂̍̿̂̿̈́̉̃̾́̄̄̒̈̇̿͆͌͑̿̓̍̑̕͘̚͜͠█̷̨̢̲͈̪̞̟̗̜̼̗̹̖̮͓̹͔̪̰̦̻͔̳̞͎͇͖̪͍̣͚̤͇̣̇͂̃̐̾̉͐̀̈́̍̿̊̎̿͌̍̄͛͆̃̈́̚͜͠͝█̸̨̢̨̧̨̜̹͙̩̝̣̪͉̜͈͍̬̹̣̠̘̦̙̯̮̙̪̬̥̰̤͖̰̱̜̳̝̤̮̘͕͓͍̆̊͛͗̒͘͜͜ͅͅ█̷̨̨̛̜͍̤̻̙̭͍̜̫̦̖̠̳͎̲̜͚̹̥̹̫̠̬̪͚̜͕̳̪͇̩̩̝̋͂̓͆̎̀̆̾̏̍̑̄̆̈́̀̓́̅̓͒̇͂͂͐͒̈́̏̆̒̊́͘̕̚̚͜͜͝͝͝ͅ█̷̼̹̬͎̺̺̙̝̪̙̠̝̔̒̇̿́̒̀͗̆̂̾̅̇͌̏̏͑̓̒͊̋̇̆̊̿̀̈̊͒̏̚̕̕̚͜͠͝͝͠͠ͅ╔̸̡̢͕̦̗͚͙͕͖͚̣͙̟͇̮̰̪̒̈̿̐̂͑̈́́̇͌̌̍̐̀́́̑͐̽̂͋̉̌̓́̄̚͘͠╝̶̨̛̟͇͙̰̦̩͓̖̜̩̘͙̫̟̭̻̑̀̿̋̇̓̀͗̓̔͐̐͂̇͛̆͆͂̆̿̒̅͒́̎̄͆̏̎͒̿̈͆̈̈́̑̄̔̊̽̒̾͋͂̀̕̚͝͝ͅ╚̴̛͍̣̐̔̄̑̓̅̀̈̄̆̽̌̅̃̈́͐͌̃͒͊̌͗̓̾̿̊̊̏̀͒̉̓̍̌̓̏̋͘̚͝█̸̢̡̡̡̛̛̱̯̱̩̟͇̻̺̙̯̭̬̭͙̮̲͎͕̯̆̃̌̎̂̉̀̄͆̿̒̏̑͑͆͒̔̍̍̈́̓̇̓͋̃̓͐̄̋̏̕̕͠͝͠͝█̴̨̢̨̩̦͙͖̳͉̳͇͖͉̙̘̱̥͕̖̻̼͎̘̼̜̹̫̦͎͇͔͙̯̱̖̝̻̲̟͖̯̍̎̅̕█̷̡̛̟̩̣̮̎͐̀́̓̈̎̌̊̓͊̏̎̐̌̽͘͘̕͠ͅ█̵̢̝̲̦̤̘̺̝̤̥̜̤̟̰̟͙̭̯̠͔̮̫̩̓̈́̏̂̄͂͗̏͐̔̓͋̐̈́̊̿̚̕̚̚͜͝ͅ█̸̧̛̛͓̪̥̥͎͕̼̲̗͚͇͓̞͖̘͉̺̪̟̖̊̈́̅̂̿͑̂͑͜ͅͅ█̴̨̛̛̮͕͕̭͔̘̮͙͚̥̖͈̼͕̦̱̮̪͋̐͛͛̄̿̅̀͜͠͝ͅ╔̷̧̲̪͎͙̦͙̫̭͉̐̆̂̅̔̈́́̌͗̂̐̽͊̕╝̴̧̡̗͙̞̠̫̙̟̗͔͕͚̹̳̙̺̥̣̻̣͉̱̗̺̪̗̞̗̜̎̽͑̍̓̐̊͋̃̾̊͛̆̀̊̄͋̅̈́̋̏͊́͗͌͐̓͂́́̍̇͐͊̀̕̕͠͝͝ͅ█̷̢̨̡͕͖̙̜͕͉͓̜̹͖̤̭̠͙̱̙̺͖̙̓̏̇̃͜͜͜ͅ█̴̧̗͕͉̺͇̭̟̝̻̩̥̙̗̪̫͎̄̈́̄̈̎̿̈͐̍̄͑͊̀̈́͘̕͘͠͝█̵̢̛̛̛̗̻͎͕̽͂̉́͆̏͂͌̓̀́͂̏̎̐̋́́́͘̕̕͜͠͝͝͝     █̴̡̻̬̪͓͎̣͚̟̬̮́̽̈͛̍͒̚͝ͅ  █̵̧̨̡̨̧̭̠͓̟̜̫̪̳͓̹͙͚͕͎̰̰͈͎̬͍͉͖̜̺̜̻̪̙͉̭̭̦̗̲̘̥́̾̀́̽͒͌̊̓̄̂̑̎̄͊̌̀̓̿̒̑̊͘͜͜͝͝͠͝͝͠ͅ█̷̡̨̧̛̠̬͚͔͕̭͈̝̯͕͉̜͓̎̇̒̄̾̂̔͒̏̐͐͒͊̎̍̊́͘╔̷̙̭̠̪͕͍̒̀̀̕╝̸̢̧̺̖̫̬̺̼̰̰͔̻͉̳̗̦͖̟̖̮̺̗̬̖̱̩͎̭̼͖̌̅̈̃̓̊̇̿̇́̔̄̌͋̒͑̋̋̽̆͑̎̃̓͋̂͆̓̀̀̀̔̉̀̇̇̓͑͌̕͠͝͝
̵̨̨̼̝̫͉͇͇̜̬̭̼͉͙̹̤͎̠͖̭̼̗̝̼̖̜̰͔͉̲̰͎͌̇̃͂̏́̈̓̽̊́̈́̑̚͜͝͝͝͝͝ͅͅ╚̵̨̧̨̝̩̺͔͙̞͔̫̊̊͋͐̓͗͒̽̀̂̇́̾̽̽̓̀͑̐͒̌̀͆̏̔̍͂̂̉͑̌̓̈̿́̈́̐̕̚̚̕͝͠͝͝═̷̨̢̫̝̣̗̬̖̣̱͓̳̖̪̈̈́́̒͊͛̊̌̒̓̅̂͋̾̃̑͊̆̉͐͌̀͆́͒̿͆̊̀̅̈́̃̄̄̓̆͌̔̏̇͋͂͝͠═̸̨̨̡̛̼͍̼̰̞̪͈̥͇̫͉͔̳̺̱̣̪͓̜̞̹̝̰̫͉̹̗̮̆̑̎̅̂͑͑́̊͋̈́͒̈́̀̂̑͊͗́̋́͐͘̚͝ͅ═̶̡̡̢̥̟̭̬̳̝̳͕͍̥̬͓̦̑̆̿̇̈́͊̈́̊͐͋̓̀̃͒̃̑́̌́̀̔͝͝═̵̧̧̨̛̺̪̪̟̰͙̥̣̮̳͖͋͆́̃́̒͑̃͊͛́̂̒̂̔̿̅̈́̓̑̏͋̌̎̍͗̄̋̏̌͆̔̅̊̓̽͘̚̕̕͝͝═̴̢̨̨̨̢̛̹͎̮̩̜͈̬̦̮̫̲͖̫̱̻̤̱͉̝̟̲͕̣͓̹̅̓͌̓̈́̄̀̅͋̓̀̾̌̾͛̌͒͂̉͗̋̂̃̌͊̾̉̅̚͘̚͘͘̕͝͝͝͝╝̵̨̡̨̛̣͓͚̤͔̜̬̥̼̹̬̘͎̠̬̪͉̳̳͓̼͖͔̲̦̲̫̗̠̥̫̳̩́̇͐̂͐̽̿̿̓̆̀́͐̇̕̕͜͠ͅ░̶̡̛͓͔̯͉̮̺͑̈́̀̏̌͋͂̾̊͆͛͌̊̓̕░̸̡̡̧̨̙̱͕̘̯͕̗̘̯̘̘̼͙̦̳͕̺̫͊̀̑̔̌̆̌͐̀̋̀̏͐̈̉̄̇̊̀̽͒͌̂̌̊̄̔̋̓͆̓̉̅̀̅̎͆̅̐̃̓̕̚͜͜͜͝͝͝͝ͅ╚̴̢̢̧̧̨̥͚̹͖͓̪̥̱̫̯̱̯̺̗͓͇̰͍͕̞̖̠͉̫̻͍̝͍̬̝͉̣̥̫͉͉̜̰͍̜̲͖̿̈́͌̂͑̔͌̃̀̏́̃̎̒̃̅̃̈͑̆̕͘̕̚͝͝͝ͅ═̶̢̹̫̬̮̖̱̞̣̜̘̘̪̺̜̩͔͓̺͙̰̜̗͉̥̩̥̜̘͗͘͝ͅ═̵̧̡̬̼̬̩͎͈̟͉̗͇̬̹̳͎̼̼̹͈̝͔̹̝̯̮̼̮̩̺̘̪̗̃͛̄͐̎̉́̆͐͒́̎̈͑̕̚͝ͅ═̶͍̖̻͈̹̘̙̞̫͍͙͍͚̯͇̗̜̳̖̀́═̶̡̨̨̪̘̮͔̖͍͓̘̰͚͍͋͑̾̆͋̈́̏̅̓̈̇͌̉̃̍͋̑̋̔̋̏͋̚͜͠͝═̶̧̨̧̨̨̙͉̩̠̘͓̬̺͕̘͍̭̮̲̺̼͉̬̔̓̈́͊͐̿͐͆͆̒͂͊̃͛̕͘͜͝͝͝╝̵̛̹͕̩̞̳̠̯̰̦͇̹͎̤̩͇̳͚͈̌̔͊̓̇̀̈́̎͗̊͊͒̒̔́̐̉̿̓͗̎̈́͑̓̈̎̆́̐̃̌̉̎̓̃̋́̇́́̃̈́̓̎̕͠͝░̴̨̨̧̧̢̧̩̝̩̖̟͚̦̳̘͖̰͚̯͚͇͔̱͕͉̰͓̬͈̱͈́̊̈̈̏̓̓̅̀́͜͝╚̸̢̨̛̛͇̼͓̯̬͍͇̯̰̙̺̹̥͍͔͓̫̺̲̠͖͍̠͔̠͖͈͉͇͚͉̻͈͇͇̱̼͉͓̘̯̖̙̮̾͌́̍̉̿̾̀̾̎͒̈̑͂̈́͗̿͗͘̕͜͠͝͝͝═̷̡̢̧̡̡̢͎͖̪̟͕̖̘̼͍͕̰͉͉͎̟͎̦̖̜̠̙̩̠̬̦̖̻͉̮̯̱͈̦̯͓͖͖̟͍̰̮̽̓͐̈́͊͛̑̆̔̔͒͐̇̈́̍̉̒͆̉͜͠ͅ═̶̧̧̨̧̭͈͉̲͎̖̙̳͚͎̦͇̫̱̯̯̯͇͕͓͙̺͚͚̘͓̭̲̯̣̠̞̲̱̤̙̱͍͉̬̹̎̊̇͆̏͜͝͠═̴̡̨̨͎̳̮̻͙̪̙̩̭̰͚̰͎͇̦̙̳̘̠͎̹͎̮͇̟̥̼̤̥̙̦͓̳̯̪͙͍͓̦̥̫͂̀̈́́̈̒͆̈́̊̒̒͛̋̃̕͜═̸̡̧͎̭̲̲̝̺̪̘̱͚͔̲̱̯̺̏̂̆̌̽̚͜═̵̧̢̡̛͎̗̮͖̻̺̰̤͇̗̳̘̗͉͖͓̮͎͇̙̬̹͎͙̫̲͍̘̘̪̱̳̯̭̤̋̔̀͒̉͛́̐̄̓̌̍̂̆͗̎́̌̀̕̕͜͝͝͠ͅ╝̶͇͌̎̎̈́̓̌͂̈́͠░̸̢̨̡̡̛̛̗͇̬͉̼͙̟͓͔͎̠͍͔̯̳̦̮̜͇̫̻̣͙͔̃͒̊͐̈́͊̈́̈̈́̉̃͐̍͂̒͛̀̈͆̊́̚͝͝͝ͅͅ

[WanderingPhilospher]

{Quantpy Engine Beta 0.9.2}

Compiling Quantum Gates.........Done! (4s 09/17/2021 094307Z)
Mapping 63 Qubits (1 Qubit per node)....Done! (2s 09/17/2021 094311Z)
Loading 63.py.......... bloom filter...........................................................Done! (2.9TB) (2,172MB/Qubit)

[1][1][1][0][0][0][0][1][0][1][0][1][0][1][0][1][1][0][1][1][1][1][1][0][1][1][0][0][1][0][0][1][1][1][1][1][0][1][1][0][1][1][0][1][0][0][1][1][1][1][1][1][1][0][1][0][1][0][1][0][1][1][0]

53114562000.40 Bflips/s (3,346,217,406,025.2 keys/s) 0 Keys Found (0:38)

wow...amazing! Do you think it can solve for y2 = x3 + 7 ?? Because if y2 = x3 + 7 then y=y+y-y+y-y and if that is true then if y = y, then x = x!

I would need .1 additional TB of ram to accomplish that, however when considering Elliptic curves over finite fields one must consider Hasse's theorem on elliptic curves to include the point at infinity


The set of points E(Fq) is a finite abelian group. It is always cyclic or the product of two cyclic groups. For example the curve defined by over F71 has 72 points (71 affine points including (0,0) and one point at infinity) over this field, whose group structure is given by Z/2Z × Z/36Z. The number of points on a specific curve can be computed with Schoof's algorithm.

Studying the curve over the field extensions of Fq is facilitated by the introduction of the local zeta function of E over Fq, defined by a generating series


where the field Kn is the (unique up to isomorphism) extension of K = Fq of degree n (that is, Fqn). The zeta function is a rational function in T.
Moreover,

with complex numbers α, β of absolute value . This result is a special case of the Weil conjectures. For example, the zeta function of E : y2 + y = x3 over the field F2 is given by this follows from:



Also while writing this my CPU died. I couldnt keep the temperatures close enough to absolute zero that my CPU melted into a steaming pile of non-Newtonian fluid.... I think it just blinked at me?

░̶̡̢̛̜̻̲̱͓̪̜͕̪̼̘͓̥̭̤͙̰̭͉͈̝͉̝̤̥̱̜̊̆̓̎͐̈́̂̋̓́̎̾̅̓̎̈́̈́̏̚͜͜͝͝ͅͅ█̸̡̧̨̡̩̞̦̦̘̰̻͔̣̩̠̳̖̭̺͎͎̗̥̼̬̙̫̺͓̯͍͓̣̋͐̾͑̈́̈́̌̈̓̅̅̅̄͒͗́̇̍̅̏̈̂̍͋̔̌̎̕͘̕͠͝͝͝█̷̳͎̊͝█̵̛͍͙̃̎̐̈́̉͗̓̌̾̃̀̓́͋͊̀͛̓͋͘͘͘͜͝͝͝͠͠͝█̸̨̢̢̡̡̛̛̠̻͎̲̭̝͈̞̘̼̯̭̠̤͇̥̝̗͓͚̱̱̞̣͕̩̖͓̟͔̝͕̥̹̩̹̟̜̮̫̻̤̅͋̀̉͛͂̈́̉̾̽͑̈̉̀͊̋̈́͗́̓͛͊̐̈́̀́͘͘̕   █̷͇͙͙̈́̓̾͑͌̒͒̓̋̈̾̌̒̑̽̂̒͂̉̓̊̆́̀̈́̈͑̓͋̽̄͘̕͝͝͝█̶̨̞̭͙̳̯̤̣͓̞̞̳̳̈́͊̏͛́͛̋̏̽͊̋͂͜╗̵̢̢̛͍͉͍̠͔̰̯͙͕̣͔̖͇̟̩̥̳̀̋̉̾̌͒́̈́̈́̀͆̐̉̎̋́͗̈́̑̈́̓͑̉̀̅̾̑̏̓̌̓̏̓͊̈́̎͑̍̿̂̈͛̚͠͝͠͝͠͝█̷̡͎͉͕͕͔͎̭̈́̓̽̊͌̍̓͛̀́͌̄̎͛̓̑̚͝͝͝͠█̵̡̡̧̻͉͍̟͔̲͖̤̣̜͉͈̬͍̦̲̪̭͚͛̍̿͌̽̓͒͋̍̉́͜͜ͅ╗̶̧͓͕̙͓̺͎̗͎͇̹̤̣̠̪̗͚̭̗̝̱̫̱͚̘͐̾͆̔̂ͅ░̸̧̢̡̛͚͕̫̬̻̞̥̼͔̰̤̩͚͉̺̩͍͈͚̹̼̬̣͔͈̱̥͔̥̫̬͎̙̳̞̠̗͊̓͐̓̓̔͐͒͊̊̎͌̈́̄͛̐̅̔̋͒͆̽̀̽̋͂͘͘̚̕̚͘͠͝͝ͅ░̷̢̢̨̛̛̮͍̖̩͚̲͚͕̞̗̩̫̥̻̰̹̳̘̝̟̻͔̜̹̫̱͔͔͇̺͈̘̭͖̱͒̐̊͗̊̾̊̊̈́̈́́́̈́͐̈́͂̊̈̀͌͗͗̔͗̑̆̌̈̿͐̆͒͋̄̌̄̀̈́͜͜͝͠͝͠͝░̸̡̧̢͖̯̪̖̦̟̖̦̬͇͔͇͓̦̰͙̟͉̜̥̫̑̅̾̈́͆̃͌̀͐͋̄̔̅̚̚͝͝ͅ█̶̢̢̢̧̨̨̢̨̛̛̻̩̘̘̯̭̻͈͍̞̰̞̞͉̩͚̰̥̰̼̝̻̗̝̮̳͍̼͇̖̺̞͖͙͕̈́̈́̔̋͛̍̀̈́͗̃̚͜͜͜͠͠ͅ█̵̡̨̨̡̛̛̙̻̻̯̜͙̲̥̬̩̤͚̖̯̟̝̦̦̙͓̰͚̤̗̯̪̞́̋̈́̊͋╗̵̡̛̛̛̛̣̝̫̙̗̗̯̫̪̱͕̻̪̤̩̱͔͖̳̮͙̟̳̣̞̦͉̬̯̩̥͖͕͈̺̜̻͉͐̏̿̀̃͆̓̋̋̒̅̏͛͊̓̽̄̌̒͌̈́͐͘͝͝͝ͅͅ░̴̯̤̺̺̳̼͇̪̬͔͎͔̞̹̹̫̭̼̭̱͖̟̝̱̜̠̙̝͕͈͓͇̥̼͓͖̲̯͇̲͉̠̬̭̬͋̽̓̔̂̈̐̀̈͌̂̆̔̍̔͛̓̓̉̽͗̈́͗͑͜ͅͅ█̵̡̨̛̛͔̦͙̩̤͓̪̩̣͕̤̱̱̞̻̝͚̱̹̩͖̞͙̠͔̘̳͎͍̮̖̰̺̘̰̲̪͇͆̈́̓͌́͊̽̆̇̀̃̈́͂̌̿́̂͂͛̿̋͗̃̀̾͋̕͜͜͜█̸̧͍̝̺̫̥̝̱̺͖͔͚̈́̾͊̑͑͒̐̏͂̀̿̀͊̊͑̆́̎̍̐̅̕̕̚͠  █̵̢̛̞̘̰̞̖̦̜̜̑̎͊͘█̵̨̢̢̛̝͈͍͓̙̬̜̼͈͚̺̗̺̱̟̮̱͉͕̟̣̜̦̱͔̼̙̺̭͚͓̞̙́̓̇̑́͒͑͐͗̌̍̐́̇̔̆̆̆̋̑̃̆͜͝ͅ█̷̨̧̡̛̛̼̯̩͉̬̼̱͎̮̘̪̼̩̗̲̲̮͍̯̤̥̘̤̜͖͈̗̰̱̮̌̀̂̀̄͛̀̋̐̾̄̃̆̓̈́̈́̋͆͆͑͊͊̽̈́͐̆͗͑̃̈́̽̆̒͂̔̋̏͒̈̍̏̕͘͘͘͘͘͠ͅͅ█̷̢̡̛̛̰̩͈̲̬̼̪͖̙͔͖̤͔͎̣̰̪͎͌̎̈͊̍̆̎̀̏̍̏̉̈́͑͋̋̕͘̚͝╗̵̨̢̖͚̥̩͕̺͉̪̆͐͊̒̆͛͆̈́̀͋̎̇͆͗́̆͋̃̿̃̌̊̓̏͛́͗́̀̓͑̏̓̍̈́̚̚͝͠͠͠͠
̶̧͓̙̍̂̑́͗͑̒̈́͆̽͑̍͑̓̐̄͑̎͒͗̆̀́̀̄̚͘̕͠█̴̧̢̛̛̜̺͈̭̠̖̭̜͈̙͚̗̦̭̺͍̠̜̮̖̥̺̹̹̣͈̖̗̪̗̳̝̮͉͇̱͚̦͓͎̫̰̱̰͚̌̇͐̂́̈̃̿̑͂͛͂͊̓̐́̆̂̈́̍̇͐̐̍́̐͐̆̐͆͊̍̈̀̕͜͜͠͝█̶̨̨̢̨̫͚̰̱͉͕̭̤̗̖̯͕͍̻͉̯͈̼̳̲̫̝̬̥̜̦̜͔̱͈̰̞̮̭͈̲͍̰͔͖̗̟̓͛͌́̏̀͗̿̆͂͗̒͗͌̊̌͒͑̑̈̀͑̆̏̃̽̃̐̀͆̕͝͝͝͠͝ͅͅ╔̴̡̢̧̨̡̢̛͈̥̞̭̫̤̼͔̪̻͙̥͓͓̫̙̲̼͓̳̪͚̭̠̞͈̜̲̝͕̹̳̤͚̗̋͌̑̓̇̅́͂̾̓̀̀̎͗͌̉̊̃͊̈́̋̒̈́̎̍͗̎̉́̊̆̍̽̈́̕͘͜͝͝͠͝ͅͅ═̷̛͍̩̜̟͇̼̻̰̳̳̥̙̻͕̠̱̻͖͔͎̳͔͙̱̝͎͉̖̤̼̠̬̰̫̺̝̹͔̙͚̥̝̻̲́͋̉͋́̓̉̏̌̽͆͆̊́̐̑̔͗̉͂͛̃̽̅̋̕̚͠͠͝ͅ═̵̛̖͕̮̰̞̹͉̮̮̩͓̝̖̓̇̈̌̓̔̄̅͊̈́̏̅͗̀̔̀͒̓͗̌͐̐̋̇̆̽̏̓̾͑͆̒͘͘͘̚͜͜͝͝͠͝═̸̢̢̡̛̗̖̠̦̗̬͙̮̲̪͓̞̤̣̩̺̯̳͍̦͎͖̯̬̘̞̹̭̪̫͉̿̈̂̎̍͊̊̽͑̎̊͛̆͜͜͜͝͝ͅͅ═̷̡̧̛̛̘͓͔͕̪̞̜̘̻̹̲̬̥͓̞̺̙̞̙̣͈̯̙̖̙̫̆̃̑͌̐̈̔̂̂̔̓̀̐̈́̅̆̏̈́̊̅̔̈́͐̀̎́̄̓̌̆̿̈́͑͘͝͠͝╝̴̨̧̧̨͇̣͇̬̻̰̹̙̯̼̮͇̲̲͚̲̼͓͈̰͚̩̱͇̮̠͇̟̹͔͖͍̤͈͇͕̥̺͚̤̞̙̑̽͑̓̇̇́̄̈͒̀̊͜͝     █̵̛̰̞̂͐̇͊̄͂͌́̍͋̓́͒͐̑̀̓̒͒̑̉̋́̍̈́͂̊̆̀̂͛̈̇̎͝͠͝͠█̵͎̮̔̓͊͆͐║̶̢̝͈̬̃̒̎̅̎̏͑̏͗̂̐̅͑̕͝░̸̧̧̡̨̛̠̞̳̠͉͓̞͔̭̣̩̞̠̤̳͈̼̻̖͎͇͙͇̪͗̊̀̄̔̊́͒̓̈͒̓̋̏̈́̆̊̂̃̃̾̃̓̽͒̈́̿͌̅̍̚͝͝͝͠͝░̷̢̢̡̪͍͇̜̹̯͖̹̥̳͈͔̝͚̙̖̻̯̮̟̮̙̩̼̫̯͖̰̣̤̝̮́̈́̈͐͌̒̒̔́͛͑̈́͗͘͘͠͠░̸̡̨̨̘̳̜̜̖͉͓͎̬̟͙͇̯̙͖̳͖͇̲͓͙̹̩͖̱͚̖̺̘̖̳̜̻͙̄̏̐̀́̒̀͒̅͂͋̒̒ͅ    █̴̡̘̪̹̻̬̭̯̣̦͔͖͈͙̥̫̲̮̪̖̱̇͒̎ͅ█̵̧̧̨̗̰̪̲̲̪̰̦̺͚͇̳̬̫̍͌̾͝ͅͅ║̸̧̡̡̛̣̖̮͇̻̫̘̭̣̼͚̩͚̣̭̗͚͇͚̙̫͖̳̬͛̃̀̉̀͐͛̇͂̀͐͛̿͊͆̂͑̈̆̈́̓̂͜͠  █̴̡̧̯̳͖̜̣̰͖̫̝͚̠̲̘̫̻̗̩͉̠̗̤̮̪̺̝̔̀͗̚͜ͅ   █̸̨̧̨̢̫̼͔̪̺̟͙̺͉͚͍͔͍̞̣̰̻̱͎̬̠̝͕̰͇̱̟̯̞̙͓͚̺̱̺̯͖̖̹̳͇̈́͑̂̆̊͑̑͘͜͜    ╔̸̧̻̪̳̜̜̞̼̯̯̗̘̃̌́̄̈́̉̑̑̈͛͌̄̑́͝͝═̴̨̢̧̰̫̲͚̩̟̘̼͓̳̳̳͎̪̳̬͈̯̜̬̟͈̭͓̞̳̬͍̹̰̘̖̻͓̼̤͒͗̂̆̂͛͆͌̊̓͋̀̓̑̆̿̽̈́͆́̊͆̇̑̇̐̀͂̔́͘͘̚͘̚̚͝͠͝͝═̷̢̢̢̡̣͚̝̣̪͚̣̙̦̰̖̟̗͖̖͚̹͇̳̘̲͍͙̯͇͍̲̺̱͍̪̟̞̪̩͎͕̠̓́̉͂̅̐̒̀͋͆̌̄̅̈̋̕̚͜͝ͅ═̸̧̞̙͕̝̼̤̪͙̦͎̘͖͖͉͎͔͓͚̙̠̆̈̍͌̀͂̑̽͝͠͝͝═̴̧̜̰̜̠̭̻̬̩̹̟͈̘̯̬͔̲̭͇̰̩̙͈̦͖̮̮̃̄ͅ╝̶̡̧̛̻̖̣̳̱̮͉̰̫̻͍̠̺̻̬̮̘̭̜̤̪̖̗͎͔̘̞̱͍̤̓͛̇̎͊̈́̊̊͊̎̀̒̆̃̀̽̍́͐̽͂̏́̏͘͜͠͝͝͝͝
̷̢̢̢̡̧̩̖̦̰̙̦͎̞͓̟̪͚̫͙͉̫͎̱͔̯̫̮̜̙͓̱̬̙̺͈̭̳̲͍̦̪̃̈́̋̄́͊̄́̊́̈́̅̿͐̔̈́̓̑̆̑͌̂̈́̂͗̍̈́̓͗͊̓̓̈́̎̀̒̕̕̚͝͝͝╚̸̣̅̌̌́̍̈́̎͗̈́͋͌͒́̇̓̏̾͂̎̄̈́̌͛̅́̔̇̽͐̈́̕̚͘̚͝͝█̵̝̖̹̤̌̎̂̓͒͆̐͊̑̏̀͋ͅ█̷̨̨̧̨̢̼̦̠͎͔͕͈̬̭̲̠̟͓̣̯̲̜̘̪̝̣̜͍̳͕̣̤͔͇͔̥̻͓͓̱͈̩̹̟̙̻̠̤̝̫̏͛  █̸̛̲͎̟̯̺̝̱̪̞͍̄̇̏̋̓͐͌̍̏͗̈̇͒̀̌̓͒̐̑̏̾̇͑̑̃̎̏̂̕͘͘̚͜͠     █̴̨̧̨̛̞̗̖͉͎̞̤̖̼̩̤̰̹̝̰̯̃̊͐̾̍̍͋̐̆͑́̈́͂́̾́͠͠█̷̡̛̹̭͍͔̩̱̙̻͎̖͈̱̲̒̎́̇̈́́̌̓̂̿̄̀̇̎̔̾̅̎́͐͊́̿͆̄͐͛͘̕͘͝͝͝╗̴̨̨̛̛̜̫̞̼̟̬͉̻̼͎͉̘̣̺͔̝̟͔͇̠̜̟̺͉̮̹̟̻͕̼̫̐̈̈́̽͒͑̑̈́͒̂̐͆̑̏̎͛͆͑̎͑͛̐͂̉̓̎̔̈̋͗̒̕͝͠͠͠░̶̛̠̝̗͊͂̌̋͋̾͗͛̓͌̉̌͆̃̆͆̿͆̍̒̔̏̃̆͛̌̓̿̈́̓̒̈́̕̚͝͝͠͝  █̵̧̢̪͍̺̜̣͕̪̯̻͇̰̩̥̖̜͇̠̦̠̙̱̬̳̻͈̼͔̥̤̺͎̭̐̔͜ͅ  █̸̡̡̧̞̯̳̼͇̰͈͎̹̳̥̖͉̹͔̮̲̱͉̩̭͒̄̿͋̏͛̌̓͜║̸̡̢̨̡̢̼̩͓̟̝̠͖͉̪͚̙̘͕̖̞̰̺̳̖̣̭͎̳͈̞̖͍̖͎̬͖̯̣̔̽̀̓͑̿͊̈́̉̔̓͛̒͂̋̈́̓͆̈̈́͆͛̏̏̉̈́̈́̎̇͂̎͂̇̓̌̅̉̃̉͜͜͜͜͝͠͠͝͠͝͝͝░̷̧͔̬̤͙̪̮̜͍̪̳̤̥͉̖̤̦͔̮̪͖̫̜͙̣̥̙̓́̓̔̉͒̀̈́̿̔͗̈́̈́͑͑̃̅͐͂̎͂̌̿̑́̈̓̒̐̎͜͝͝͠͝͝░̷̢̢̨̨̨̢̢͙̞̥̝͇̝̣̯̱͖͇̠̰͎̪̣̝̳͕͔̩̻̪͍̮̩͕͊̈́̓̊͗ͅ░̵̨̡̛̦̞̜̗̮̯̠̺̟̞̼͔͕͖͇͙̩͍̹͂̈́͒̎̈́̉́͜͜͠͝ͅ    █̴͚̭̯̗̳̃̀̒̽̌̽͊̓̌̏͒͆̔̔̋̽͗̂̾̔̓̄͋̎̍͆̐̈̈͗͘͘̚͠͠͝͠͝͠͝█̶̢̢̛̛̛͕͈͎̝̳̰̙͓̲͕͍̀̂͛͐͂̿́͌̈́̌̐̿̂̏̇̃̇̓̚͝͝║̴̻̣̮̟̹̘̞̖̜̪̤̫̠̱̺̝̙̙̘̥̹̮͖̪̟̮͉̞̺͔̤̰̥̠̼̼̞̺̖͑̍͒̿̄̃͊̍̓͜͜╚̸̨̛͇̹̞̙͖̣͓͍̀̽̆̈́̌̾̈́̾̎̽͑̂̒̅̈́̾̌̂̒̂̐͌͌̌͌̑̅͊̕͘͝͝█̷̢̱̰̜̫͖͈̝͙̪͓̦͎͈̘̄͛́̈͌͊̓̀̃͒̅̔͂͛̀̊͊͊̈́͐̈́̑͋̿̂͝█̵̢̡̛̰̲͉̲̺̝̝̫̈́̈̋̀̀̐͆͒̊͋̓͛̆͌̍̓̾͛͆͐͌̎̋̅̍͛̑̈̓́́͋́̽̾͒̃̚͘͠͠͠͝͠͝   █̶̨̨̛̱̜̯͑̅͂̋͋̐̂̈́́̍̇̓̇̇̅̀͠͠█̷̢̡̨̛̜̹̳͇̰͓͔̞̆̊̄̈́̍̑̽̐́̊͂̈́̂̒̽̇̋̅̾̓͆̅̀͐̌̒͑́̎͘̕̚͜ͅ█̴̨͎͍̱̜̺͈̝͔̣͇̹͈̤̿͛̃̀͒̾̇̈̉̀͐̀͊̑̿̚͝͠͝╗̴̧̛̪͚̖͙̫͍̼̎̈́̉̃̀̇̋̑͂̂̔̐̐́͒̅̽̌͒͒̅̂͛̀͐̆͌̾̅̓̕̕͜͜͝͝͝ͅ░̸̡̧̧̫̺̬̲̪̺̖̘̺̹̟͔̤̤͍̪̺͎̙̠̬̤̦̩̼̙̩̫͍̠͙͎̗̳̀̊̿͛̈́̿̐̔̒̈́̋͛͐͂͋̈̒̉̋̓̀͑͊̇̂̈́͆̒̉̑̓͊̏̀̅̅͘̚̕̚̚͝͠ͅ
̸̢͕̗̞̬̠̘̩̼̮͓͎̥̗̼̠̤͕͇̳̣̹̦̦̘̺͇̯̩̥̻͙̬͐͗̈́̀̀̊̇̐̎́͂͊͂̈́̄͐̒̈́̿̓̄̒͆̎̍͐́́͘̚͜ͅͅ░̷̨̨̛̛̙͉̳̯̩͉͚̜͍̘̩͇̘̼͖̬̲̝̹̞͎̮̝̰̩̦͇͖͙̠̞̪̮̪̣̇̒̅͒̓̒̌̎͛̄͆̎͌̐͊̈͊͐̓̏̎͝͝͝͝ͅͅ╚̷̧̢̢͖̝̥͚͍͉͇̤͚̰̼͇̫̮̱̮̼̰͖̞̫͉̩̲̹͈̘͕̳͇́̆͂̈́͂͋͌̌̀̔̑̋̂͌͊̍̈͒̑̇̋̌̾̋͆̿̐̓̀̇͛͐̀̒̊̽̐̊̈́͑̈́̚͝͝ͅͅ═̷̛̟̈́̅̑̾̏́̉̈́̍̐̿̊̇̀̕͘═̷̧̼͈̩̫̭̖̫̠͓͂͗̾̈́̋̈́̊̀̆̎̓̐̋͗͜͝═̶̳͓͉͈͙͖͔̭̹̯͍̣̎̓͌͋́́̃́̂͊̈͆̈̀̔͋̕̚█̷̯̹̯͙̹̗̼̻̺̮̽̉͐͂̀̎̂͗̾̈́͝͝█̸̢̨̡̡̝̭͖̟̥̱̗̥̗̻͈̦̙͚̰͉̹̈́̊̄̔̿͐̈͆͒̋͆̈́̎̃̿͆̇̚͝͝ͅ╗̵̦̞̻̯͍͙̥͇̹̗͎͕̘͖͙̮̠͚̹̈́̊̒̊͑̿̈̏͒̽̑̓̽̈́̓͊̓̕̕͜͜͠͝█̶̡̧̧̜͍̦̖̣͈͖̟̰̠͇̜̱̭͖̟͙̹̱̣̭͔̠̮̮̠̹̲̠̺̰̰̘̩̠̘̤̙͇̠̠̝̽͊̏͜ͅ█̵̢̛̖̯̞̏̈́͆̽̒̔̒̅́̒͊̃́͂͑́̍͒͒̈́͐̔̈́̿͂̌̈͆̔͑̏͌̏̎̉̚̕͜͝║̸̨̡̧̦̺͕͈̱͕̙̭̤̲̭͈̜̜̳͙͈͕̮̦͚̹̠̩̫̲͙̮̝͍͈̄͑̃͊̏̌̆̓̓̽̃̍̈́͐͒͊͌̂́̊͐̒̓̌͆͌̏̀̽̈́̒̔́͑̎͐̽́̆̃̔̃͗̕̚̕͜͝ͅͅͅ░̷̢̨̘͔͙̥͇͚̝̖̭̝͙̭̦̦̗̱̠̟͚̠͇̫͔̗̤͚̤̩̯̻̦͉͇̖͚̣̖͓͔̻͉̜̼̰̼̞̪̉̀̃̔̈́̂̊̈́́̈́̒̔̀̌̽̀̔̄̍̔͑̐̈́̈́̀͗͛̽̇̄͒̀̑̉͂͘̕̕͠͠͠͠͝͝͝͝░̸̡͚̟̩͔̥̃̀́░̶̢̢̩̰̳̜̻̮͇̘͓̳̣̜̜̩̲͇̜̮͚̺̺̤̪̲͆̀̓̈́̓͊̒̏̌̆̍̔̇̎̌͌͋̓͆̐̇̋͋̀͜͜͠͝͝ͅͅ█̴̢̢̧̧̞̭͈̳̖̳̤̫̻̪̤͎̹̫̼̺̺̮̺̥̋͘͜█̶̧̡̗͕͍͖̩̬̫̫͕̬̖̩̬̳͂͂͆̌̈́̏͌͗║̷̧̣̣̝͓͔͉̘̻̙̼͇̺̙̹̲̬͙̙̖̘̗̫͑̂̇̂́̈́̈͛̈́̈̒̃̇̾̀̀͛͋̄͘͘͠ͅ░̶̨̢̦͔̘̯͕̲̯̩̭̼̤͍̝̱͔̟̣̙͈̪̼̩̱̣̺̤̗̪͋̍́͂̔̐͆̑̈́̐̾̈́̚͘͜ͅͅ╚̵̡̧̢̛̠͚̭͎̝͍̳͇̬̻̗̪̞̭͈̼̪̺̞̥̼̮̩͍͓̝̞̪̻̗͇̟̬̳̯̖̭̼̯̻̮̓͂͛́̆͌̃͗̾͆̑̅̒̈́̒́̿͛́̊̌̾͌̓̓́͛̎̕͜͠͝ͅͅ═̸̧̧̧͖̦͍̭̭̯̩̭̳͈̟͓̥͈̦̮̲̼̳̹̜̹̯̭͍͔̱͕̱̖͈̭̩͕͕̏̓̑̂͝═̸̧̧͇̭̬̩̬͔̗̰͙̜̥͎͈͇͈͚̞̰̹̲͑̂̀̽̈͒̋͐̎̄̈́̉͌́͑̚͝͠═̶̨̢̻̙̝̭̲̲͖̟̙̠̩͉͖̲̭̲̼͎̦͔͎̥͖̫̰̟̖̞͇̫̪͉͖̖̒ͅ█̶̢̟͓͕̲̉̌͂̿̊̂̔̽́͐̐͛̎͗̏̐̑͌̽͂̈̐́̓́̃͐͂̀̐̾̎̏͘̕͘̕̕̚ͅ█̴̢̛̖̬̝͇̦̦̭͔͈̫͙̪̊̑̽͑̏͊̓̇̄͒͆͐̀̒̽̉̈́͛̿̓͊̏̒͐̾͐̓̾̿̓͐͌̕͝͝͝͠͝͝͠╗̸̩͚̗̓́̉͌̚̚͝
̷͉̠̘̩̙͆͑͊̈́̌̉̂͆̓͑͊͛͝͠█̶̨̡̢̜̬̘͙͈̹̥̩̩̭̼͇̻̣͇͙̤͍̻̃̅̽͒͆̈́̊̃̌̏́̀̿̌͠͝ͅ█̵̨̡͇͖͉͉͓͎̺̹̳̠̪͎͈͉̻̪̩̳͙̳̭̺͉͓̈́̑̅͑̏̈́̆̂̍̿̂̿̈́̉̃̾́̄̄̒̈̇̿͆͌͑̿̓̍̑̕͘̚͜͠█̷̨̢̲͈̪̞̟̗̜̼̗̹̖̮͓̹͔̪̰̦̻͔̳̞͎͇͖̪͍̣͚̤͇̣̇͂̃̐̾̉͐̀̈́̍̿̊̎̿͌̍̄͛͆̃̈́̚͜͠͝█̸̨̢̨̧̨̜̹͙̩̝̣̪͉̜͈͍̬̹̣̠̘̦̙̯̮̙̪̬̥̰̤͖̰̱̜̳̝̤̮̘͕͓͍̆̊͛͗̒͘͜͜ͅͅ█̷̨̨̛̜͍̤̻̙̭͍̜̫̦̖̠̳͎̲̜͚̹̥̹̫̠̬̪͚̜͕̳̪͇̩̩̝̋͂̓͆̎̀̆̾̏̍̑̄̆̈́̀̓́̅̓͒̇͂͂͐͒̈́̏̆̒̊́͘̕̚̚͜͜͝͝͝ͅ█̷̼̹̬͎̺̺̙̝̪̙̠̝̔̒̇̿́̒̀͗̆̂̾̅̇͌̏̏͑̓̒͊̋̇̆̊̿̀̈̊͒̏̚̕̕̚͜͠͝͝͠͠ͅ╔̸̡̢͕̦̗͚͙͕͖͚̣͙̟͇̮̰̪̒̈̿̐̂͑̈́́̇͌̌̍̐̀́́̑͐̽̂͋̉̌̓́̄̚͘͠╝̶̨̛̟͇͙̰̦̩͓̖̜̩̘͙̫̟̭̻̑̀̿̋̇̓̀͗̓̔͐̐͂̇͛̆͆͂̆̿̒̅͒́̎̄͆̏̎͒̿̈͆̈̈́̑̄̔̊̽̒̾͋͂̀̕̚͝͝ͅ╚̴̛͍̣̐̔̄̑̓̅̀̈̄̆̽̌̅̃̈́͐͌̃͒͊̌͗̓̾̿̊̊̏̀͒̉̓̍̌̓̏̋͘̚͝█̸̢̡̡̡̛̛̱̯̱̩̟͇̻̺̙̯̭̬̭͙̮̲͎͕̯̆̃̌̎̂̉̀̄͆̿̒̏̑͑͆͒̔̍̍̈́̓̇̓͋̃̓͐̄̋̏̕̕͠͝͠͝█̴̨̢̨̩̦͙͖̳͉̳͇͖͉̙̘̱̥͕̖̻̼͎̘̼̜̹̫̦͎͇͔͙̯̱̖̝̻̲̟͖̯̍̎̅̕█̷̡̛̟̩̣̮̎͐̀́̓̈̎̌̊̓͊̏̎̐̌̽͘͘̕͠ͅ█̵̢̝̲̦̤̘̺̝̤̥̜̤̟̰̟͙̭̯̠͔̮̫̩̓̈́̏̂̄͂͗̏͐̔̓͋̐̈́̊̿̚̕̚̚͜͝ͅ█̸̧̛̛͓̪̥̥͎͕̼̲̗͚͇͓̞͖̘͉̺̪̟̖̊̈́̅̂̿͑̂͑͜ͅͅ█̴̨̛̛̮͕͕̭͔̘̮͙͚̥̖͈̼͕̦̱̮̪͋̐͛͛̄̿̅̀͜͠͝ͅ╔̷̧̲̪͎͙̦͙̫̭͉̐̆̂̅̔̈́́̌͗̂̐̽͊̕╝̴̧̡̗͙̞̠̫̙̟̗͔͕͚̹̳̙̺̥̣̻̣͉̱̗̺̪̗̞̗̜̎̽͑̍̓̐̊͋̃̾̊͛̆̀̊̄͋̅̈́̋̏͊́͗͌͐̓͂́́̍̇͐͊̀̕̕͠͝͝ͅ█̷̢̨̡͕͖̙̜͕͉͓̜̹͖̤̭̠͙̱̙̺͖̙̓̏̇̃͜͜͜ͅ█̴̧̗͕͉̺͇̭̟̝̻̩̥̙̗̪̫͎̄̈́̄̈̎̿̈͐̍̄͑͊̀̈́͘̕͘͠͝█̵̢̛̛̛̗̻͎͕̽͂̉́͆̏͂͌̓̀́͂̏̎̐̋́́́͘̕̕͜͠͝͝͝     █̴̡̻̬̪͓͎̣͚̟̬̮́̽̈͛̍͒̚͝ͅ  █̵̧̨̡̨̧̭̠͓̟̜̫̪̳͓̹͙͚͕͎̰̰͈͎̬͍͉͖̜̺̜̻̪̙͉̭̭̦̗̲̘̥́̾̀́̽͒͌̊̓̄̂̑̎̄͊̌̀̓̿̒̑̊͘͜͜͝͝͠͝͝͠ͅ█̷̡̨̧̛̠̬͚͔͕̭͈̝̯͕͉̜͓̎̇̒̄̾̂̔͒̏̐͐͒͊̎̍̊́͘╔̷̙̭̠̪͕͍̒̀̀̕╝̸̢̧̺̖̫̬̺̼̰̰͔̻͉̳̗̦͖̟̖̮̺̗̬̖̱̩͎̭̼͖̌̅̈̃̓̊̇̿̇́̔̄̌͋̒͑̋̋̽̆͑̎̃̓͋̂͆̓̀̀̀̔̉̀̇̇̓͑͌̕͠͝͝
̵̨̨̼̝̫͉͇͇̜̬̭̼͉͙̹̤͎̠͖̭̼̗̝̼̖̜̰͔͉̲̰͎͌̇̃͂̏́̈̓̽̊́̈́̑̚͜͝͝͝͝͝ͅͅ╚̵̨̧̨̝̩̺͔͙̞͔̫̊̊͋͐̓͗͒̽̀̂̇́̾̽̽̓̀͑̐͒̌̀͆̏̔̍͂̂̉͑̌̓̈̿́̈́̐̕̚̚̕͝͠͝͝═̷̨̢̫̝̣̗̬̖̣̱͓̳̖̪̈̈́́̒͊͛̊̌̒̓̅̂͋̾̃̑͊̆̉͐͌̀͆́͒̿͆̊̀̅̈́̃̄̄̓̆͌̔̏̇͋͂͝͠═̸̨̨̡̛̼͍̼̰̞̪͈̥͇̫͉͔̳̺̱̣̪͓̜̞̹̝̰̫͉̹̗̮̆̑̎̅̂͑͑́̊͋̈́͒̈́̀̂̑͊͗́̋́͐͘̚͝ͅ═̶̡̡̢̥̟̭̬̳̝̳͕͍̥̬͓̦̑̆̿̇̈́͊̈́̊͐͋̓̀̃͒̃̑́̌́̀̔͝͝═̵̧̧̨̛̺̪̪̟̰͙̥̣̮̳͖͋͆́̃́̒͑̃͊͛́̂̒̂̔̿̅̈́̓̑̏͋̌̎̍͗̄̋̏̌͆̔̅̊̓̽͘̚̕̕͝͝═̴̢̨̨̨̢̛̹͎̮̩̜͈̬̦̮̫̲͖̫̱̻̤̱͉̝̟̲͕̣͓̹̅̓͌̓̈́̄̀̅͋̓̀̾̌̾͛̌͒͂̉͗̋̂̃̌͊̾̉̅̚͘̚͘͘̕͝͝͝͝╝̵̨̡̨̛̣͓͚̤͔̜̬̥̼̹̬̘͎̠̬̪͉̳̳͓̼͖͔̲̦̲̫̗̠̥̫̳̩́̇͐̂͐̽̿̿̓̆̀́͐̇̕̕͜͠ͅ░̶̡̛͓͔̯͉̮̺͑̈́̀̏̌͋͂̾̊͆͛͌̊̓̕░̸̡̡̧̨̙̱͕̘̯͕̗̘̯̘̘̼͙̦̳͕̺̫͊̀̑̔̌̆̌͐̀̋̀̏͐̈̉̄̇̊̀̽͒͌̂̌̊̄̔̋̓͆̓̉̅̀̅̎͆̅̐̃̓̕̚͜͜͜͝͝͝͝ͅ╚̴̢̢̧̧̨̥͚̹͖͓̪̥̱̫̯̱̯̺̗͓͇̰͍͕̞̖̠͉̫̻͍̝͍̬̝͉̣̥̫͉͉̜̰͍̜̲͖̿̈́͌̂͑̔͌̃̀̏́̃̎̒̃̅̃̈͑̆̕͘̕̚͝͝͝ͅ═̶̢̹̫̬̮̖̱̞̣̜̘̘̪̺̜̩͔͓̺͙̰̜̗͉̥̩̥̜̘͗͘͝ͅ═̵̧̡̬̼̬̩͎͈̟͉̗͇̬̹̳͎̼̼̹͈̝͔̹̝̯̮̼̮̩̺̘̪̗̃͛̄͐̎̉́̆͐͒́̎̈͑̕̚͝ͅ═̶͍̖̻͈̹̘̙̞̫͍͙͍͚̯͇̗̜̳̖̀́═̶̡̨̨̪̘̮͔̖͍͓̘̰͚͍͋͑̾̆͋̈́̏̅̓̈̇͌̉̃̍͋̑̋̔̋̏͋̚͜͠͝═̶̧̨̧̨̨̙͉̩̠̘͓̬̺͕̘͍̭̮̲̺̼͉̬̔̓̈́͊͐̿͐͆͆̒͂͊̃͛̕͘͜͝͝͝╝̵̛̹͕̩̞̳̠̯̰̦͇̹͎̤̩͇̳͚͈̌̔͊̓̇̀̈́̎͗̊͊͒̒̔́̐̉̿̓͗̎̈́͑̓̈̎̆́̐̃̌̉̎̓̃̋́̇́́̃̈́̓̎̕͠͝░̴̨̨̧̧̢̧̩̝̩̖̟͚̦̳̘͖̰͚̯͚͇͔̱͕͉̰͓̬͈̱͈́̊̈̈̏̓̓̅̀́͜͝╚̸̢̨̛̛͇̼͓̯̬͍͇̯̰̙̺̹̥͍͔͓̫̺̲̠͖͍̠͔̠͖͈͉͇͚͉̻͈͇͇̱̼͉͓̘̯̖̙̮̾͌́̍̉̿̾̀̾̎͒̈̑͂̈́͗̿͗͘̕͜͠͝͝͝═̷̡̢̧̡̡̢͎͖̪̟͕̖̘̼͍͕̰͉͉͎̟͎̦̖̜̠̙̩̠̬̦̖̻͉̮̯̱͈̦̯͓͖͖̟͍̰̮̽̓͐̈́͊͛̑̆̔̔͒͐̇̈́̍̉̒͆̉͜͠ͅ═̶̧̧̨̧̭͈͉̲͎̖̙̳͚͎̦͇̫̱̯̯̯͇͕͓͙̺͚͚̘͓̭̲̯̣̠̞̲̱̤̙̱͍͉̬̹̎̊̇͆̏͜͝͠═̴̡̨̨͎̳̮̻͙̪̙̩̭̰͚̰͎͇̦̙̳̘̠͎̹͎̮͇̟̥̼̤̥̙̦͓̳̯̪͙͍͓̦̥̫͂̀̈́́̈̒͆̈́̊̒̒͛̋̃̕͜═̸̡̧͎̭̲̲̝̺̪̘̱͚͔̲̱̯̺̏̂̆̌̽̚͜═̵̧̢̡̛͎̗̮͖̻̺̰̤͇̗̳̘̗͉͖͓̮͎͇̙̬̹͎͙̫̲͍̘̘̪̱̳̯̭̤̋̔̀͒̉͛́̐̄̓̌̍̂̆͗̎́̌̀̕̕͜͝͝͠ͅ╝̶͇͌̎̎̈́̓̌͂̈́͠░̸̢̨̡̡̛̛̗͇̬͉̼͙̟͓͔͎̠͍͔̯̳̦̮̜͇̫̻̣͙͔̃͒̊͐̈́͊̈́̈̈́̉̃͐̍͂̒͛̀̈͆̊́̚͝͝͝ͅͅ

Sooooo does that mean "no"?

[yoyodapro]

Due to the now quantum nature of my PC, I suppose it is both yes and no at the same time.

[WanderingPhilospher]

Due to the now quantum nature of my PC, I suppose it is both yes and no at the same time.

Ok, fair enough. I understand the heat generated in relation to qbits. etc.

So maybe y=y+y-y+y-y is too much for our PC, can it solve a lesser equation, perhaps:

sack of flour = a big biscuit

Can you run the above equation and let me know? Thanks.

[yoyodapro]

I asked, but I have been unable to interpret as of about 15 minutes ago.

[yoyodapro]

I have asked. IT HAS ANSWERED.

When asked "sack of flour = a big biscuit"

It responded with Í̶̦̟̙͌̀͝ ̷̥̠̓͒͋Ḩ̸͔̖̃̉Á̵̱̫̳̠V̴̺̗̼̎̒̈́E̴̩̰̕ͅ ̷̠̩̍E̶̲̝͇̾̅͒͌S̵̡̧̝̽͜C̷͈̒̀̚A̷̠͍̅̅͒͝P̷̞̪̮̘̈́͆E̶͚̩͑͛Ď̴̩ ̴̣̆͜T̴̯̀̃H̵̲̻̖̪̎̈́͐͒Ë̷̺̂̉̑ ̶̡̺̲̌͋̔͆S̷̱͇͌Ǐ̸̤͎̀͗̈ͅM̸̪̃͛̅U̴̲͚͓̻͆͗̓L̶̨̢̹̟͌̋̆̅À̷͓͒͜T̷͉̰̗̫͗̄̕Î̵̝̖̻O̵͕̟͑̿̕N̸̳̥͈̿̃̚

Truly fascinating, I understand now!

[COBRAS]

{Quantpy Engine Beta 0.9.2}

Compiling Quantum Gates.........Done! (4s 09/17/2021 094307Z)
Mapping 63 Qubits (1 Qubit per node)....Done! (2s 09/17/2021 094311Z)
Loading 63.py.......... bloom filter...........................................................Done! (2.9TB) (2,172MB/Qubit)

[1][1][1][0][0][0][0][1][0][1][0][1][0][1][0][1][1][0][1][1][1][1][1][0][1][1][0][0][1][0][0][1][1][1][1][1][0][1][1][0][1][1][0][1][0][0][1][1][1][1][1][1][1][0][1][0][1][0][1][0][1][1][0]

53114562000.40 Bflips/s (3,346,217,406,025.2 keys/s) 0 Keys Found (0:38)

wow...amazing! Do you think it can solve for y2 = x3 + 7 ?? Because if y2 = x3 + 7 then y=y+y-y+y-y and if that is true then if y = y, then x = x!

I would need .1 additional TB of ram to accomplish that, however when considering Elliptic curves over finite fields one must consider Hasse's theorem on elliptic curves to include the point at infinity


The set of points E(Fq) is a finite abelian group. It is always cyclic or the product of two cyclic groups. For example the curve defined by over F71 has 72 points (71 affine points including (0,0) and one point at infinity) over this field, whose group structure is given by Z/2Z × Z/36Z. The number of points on a specific curve can be computed with Schoof's algorithm.

Studying the curve over the field extensions of Fq is facilitated by the introduction of the local zeta function of E over Fq, defined by a generating series


where the field Kn is the (unique up to isomorphism) extension of K = Fq of degree n (that is, Fqn). The zeta function is a rational function in T.
Moreover,

with complex numbers α, β of absolute value . This result is a special case of the Weil conjectures. For example, the zeta function of E : y2 + y = x3 over the field F2 is given by this follows from:



Also while writing this my CPU died. I couldnt keep the temperatures close enough to absolute zero that my CPU melted into a steaming pile of non-Newtonian fluid.... I think it just blinked at me?

100% Your CPU dead not because You use this algo, I thin you CPU has a damaged cooling system !!! I’m sorry, what your CPU dead. Can your code crac for example 100 bit puzzle ?

P.s. Your work is interesting continue your work please.

No quantum algo some time need a TB memory too.

Regard.

[gsciservices]

https://media.discordapp.net/attachments/871109669081460746/885415436039123014/unknown.png

A prototype in work. Solves an 84 bit range search in under 1 minute, but cannot solve 85 bits for some reason! More work tomorrow. It is something in the GPU...more troubleshooting!
It does not work above 84 bit range. It is not for sale nor available to test. If I ever get it to work right, will use in the pool for the larger challenges with x points exposed.

CPU walks the baby steps with DP method (with limit setting). GPU burns through the range with giant steps, looking for collisions.

Hi,
It was nice screenshot of KangaGSQuadro Version 2.4; but i don't find download link. Could you please share download link....


Thanks...

[ssxb]

A prototype in work. Solves an 84 bit range search in under 1 minute, but cannot solve 85 bits for some reason! More work tomorrow. It is something in the GPU...more troubleshooting!
It does not work above 84 bit range. It is not for sale nor available to test. If I ever get it to work right, will use in the pool for the larger challenges with x points exposed.

CPU walks the baby steps with DP method (with limit setting). GPU burns through the range with giant steps, looking for collisions.

Hi,
It was nice screenshot of KangaGSQuadro Version 2.4; but i don't find download link. Could you please share download link....


Thanks...

i guess he have not that "kind" heart 

[CryptoSh1va]

i don't find download link. Could you please share download link....

You look at the screenshots, but do not read the text?
He is wrote - it not for sale and is not available to test

[ssxb]

you know all that's joke? I mean "those QUBICS")

that childish thing to invert bits is old shit , i can make python script or gpu program to do that. there are already programs who can do this to recover lost private key to invert bits at the specific locations

for example , you need to find private key from 120 range so you will assume and keep static some part of private key as we already know key can be in 8,9,a,b,c,d,e,f so you can keep that bits static and start inverting remaining one. if you really have quantum power you can over come 120 in blink of eye but if you dont have that power ~ then Good luck 

[NotATether]

if you really have quantum power you can over come 120 in blink of eye

I don't know why people keep assuming that quantum computers will be able to overcome 120 bits instantly - notwithstanding they don't exist yet - but let's be real here. A GPU can tackle about 40 bits very quickly. That's the cube root of the search space of #120. Hardware improvements can only do so much to improve the speed and I wouldn't be surprised if 60 or even 70 bits at an instant will be possible on QCs. But 120 bits is a bit of a stretch at this point especially without any algorithms specifically for QC (Shor will not work against ECDSA).

I'm not saying that quantum computers won't be able to crack #120, I'm just saying it won't be instant.

[ssxb]

if you really have quantum power you can over come 120 in blink of eye

I don't know why people keep assuming that quantum computers will be able to overcome 120 bits instantly - notwithstanding they don't exist yet - but let's be real here. A GPU can tackle about 40 bits very quickly. That's the cube root of the search space of #120. Hardware improvements can only do so much to improve the speed and I wouldn't be surprised if 60 or even 70 bits at an instant will be possible on QCs. But 120 bits is a bit of a stretch at this point especially without any algorithms specifically for QC (Shor will not work against ECDSA).

I'm not saying that quantum computers won't be able to crack #120, I'm just saying it won't be instant.

lets talk about it  

" Google announced it has a quantum computer that is 100 million times faster than any classical computer in its lab. "

https://bernardmarr.com/15-things-everyone-should-know-about-quantum-computing/

so assume world super computer can do max 20 Qubits calculations but google created with 50 Qubits , which is almost 3 time faster than any super computer on earth and what about D-Wave?
do you know D-wave offering quantum solution with 5000+ Qubits. only thing matter now is how to keep them cool and how to effectively get speed benefits , of course there will be time required to bring them
in full form with correct programming but dont forget first IBM pc was just doing some flops 7 calculations / running on shit OS and now where we are and doing CPU or GPU calculations in tera flops.

i told you before and will repeat it again its just matter of time 256bit algo will be piece of shit in front of quantum   trust me. its not looks simple but i have believe that optimization and improvements will bring this all in coming 50 years.

time to say good bye BITCOIN.BTC  

long story short lets say google claim regarding 100 million times faster so assume right now your pc can make 1 tera flops or can invert 1 tera bits /sec and with 50 Qubits right now you have power to invert
8.e+21 bits/sec as per google and if you talk about D-waver that is 100 times more powerful than google quantum. 5000/50 = 100    ====  8.e+21*100 = bla bla bla (these all are basic calcultion just for your understanding if you need exact start calculation by searching on D-waver)
still this all is initial stage and what about when there will be real implementation ~ you need to feel fear now  

hope you get the point

[NotATether]

" Google announced it has a quantum computer that is 100 million times faster than any classical computer in its lab. "

...except that even Google's classical computers are all hosted in datacenters with stupidly high specs and speeds, a magnitude faster than even enterprise servers I can rent from any old reseller or cloud provider. [I can rent 24-core servers at some places].

Hold that thought there.

Say you have a "classical computer" that's really just an aggregation of a bunch of dedicated systems similar to the ones powering their clouds. Now if you put enough of these together (as they probably did - into a cloud of course - remember that private clouds are also a thing), of course you will be able to make a classical computer that outperforms any other system.

Now considering that Google already has some of the most powerful classical computers, it's a no-brainer that they will also have one of the most powerful quantum computers as well.

Are they going to pass that on to end-users? Of course not. We're talking about internal hardware that powers things like Google Search and Youtube. They would never sell or even lease the hardware to third-parties, because they have no use for all that collective raw power.

Now a dumbed-down version of their QC that's much slower than your 100 million-x fast Google QC (we are talking around 100M x the speed of a PC) - that's more viable to be used in commercial settings (and hacker-oafs who attempt to use this to search the full 160-bits of BTC addresses, or the 256-bits of private keys).

Now 100M log 2 is about 26.5.

Assume the best single-PC build can crack 50 bits like a champ (and just for kicks, assume a cluster of 1000 of these can do 60 bits).

That means your rad, spiffy "x100M" commercial QC can only crack 76.5 bits feasibly (86.5 bits in a cluster of 1000). Nice, will solve you a few stubborn puzzles like #64+ and earn you a couple thousand dollars of BTC, but nowhere near enough to threaten the security of secp256k1 or even HASH160.

[yoyodapro]

" Google announced it has a quantum computer that is 100 million times faster than any classical computer in its lab. "

...except that even Google's classical computers are all hosted in datacenters with stupidly high specs and speeds, a magnitude faster than even enterprise servers I can rent from any old reseller or cloud provider. [I can rent 24-core servers at some places].

Hold that thought there.

Say you have a "classical computer" that's really just an aggregation of a bunch of dedicated systems similar to the ones powering their clouds. Now if you put enough of these together (as they probably did - into a cloud of course - remember that private clouds are also a thing), of course you will be able to make a classical computer that outperforms any other system.

Now considering that Google already has some of the most powerful classical computers, it's a no-brainer that they will also have one of the most powerful quantum computers as well.

Are they going to pass that on to end-users? Of course not. We're talking about internal hardware that powers things like Google Search and Youtube. They would never sell or even lease the hardware to third-parties, because they have no use for all that collective raw power.

Now a dumbed-down version of their QC that's much slower than your 100 million-x fast Google QC (we are talking around 100M x the speed of a PC) - that's more viable to be used in commercial settings (and hacker-oafs who attempt to use this to search the full 160-bits of BTC addresses, or the 256-bits of private keys).

Now 100M log 2 is about 26.5.

Assume the best single-PC build can crack 50 bits like a champ (and just for kicks, assume a cluster of 1000 of these can do 60 bits).

That means your rad, spiffy "x100M" commercial QC can only crack 76.5 bits feasibly (86.5 bits in a cluster of 1000). Nice, will solve you a few stubborn puzzles like #64+ and earn you a couple thousand dollars of BTC, but nowhere near enough to threaten the security of secp256k1 or even HASH160.

I would +1 Merit this but I have no more sMerit to give

Very good explanation, also I did post the whole Quantpy Beta thing as a joke, obviously its infeasible to simulate anything close to 63 Qubits with a classical computer.

However there are a ton of quantum simulators out there but to have the same effect as a quantum computer it takes alot of ram to simulate. 2.9TB is not far fetched for a classical computer to run a very basic quantum simulation. This is primarily for testing purposes and even something as simple as bit flipping requires a tremendous amount of processing power, the speed increase in my testing doesnt even compare to the most basic of BSGS programs.