Show Posts
|
Pages: [1] 2 3 »
|
You talk about crashing SSDs, more info that you don’t know about this program or how it works. If an SSD can’t handle being written to, 12 times a day, then what’s the point of even owning one lol. Yes, this program, you control what and how often DPs are saved to your hard drive.
Now you claim 130 with DP 32 is magnitudes more than 115 with DP 25, which further shows you don’t know how kangaroo or this program works. Magnitudes? lol.
Maybe look at the code for this program that you are commenting on, before commenting on it.
I believe you are the one who should look into the source code, before making any other statements about it. Maybe check the hash lookup part, you will be surprised?... Let's say you wait 1 year to fill up your DP cache (in RAM) and decide to write it to disk. Do you think you will have to write the same amount of data you have in RAM? Before answering, maybe create a simple C program that maps a 2 TB file to memory and write a single byte at offset 10 GB for example. No seeks, no nothing. I don't think you get the actual difference between offline storage and accessing random addresses of volatile memory which is in O(1). This is why it's called "random address" indexing, any byte you want to read it gets completed in constant time. You are right though about the storage size difference, it's just 2**(0.5) between #115 with DP 25 and #130 with DP 40. I cannot answer you how many actual storage bytes were required because I don't care about how the program stored them, just their count. This program also solved #115 in 13 days (114 bit key on the Secp256K1 field). It required 2**58.36 group operations using DP25 to complete.
2**58.38 operations = 57.37 bits jump for each kang set = 2**(57.37 - 25) stored jumps each, so storage space was around 2*2**32.37 items for the complete merged "central table" / hashmap. Which is almost perfeclty equal to my estimates. I fully understand the code and how this program works. All aspects. 115 was solved with a little more than 300GB of, wait, checks notes, “files”. That was your first rant, exabytes lol. I hope no SSDs were lost solving 110 and 115 with this program. RIP SSDs and all of your exabytes that you stored. 😁 RIP my SSD's on the distributed Kangaroo project xD
|
|
|
Here is a challenge for you, yoyodapro
tra1= 1 z1= 106288458063179593712222198918999864257388713037136823178422748780706632826238 r1= 33408902042365984987451038847322594205923736706120695378294680733511094442526 s1= 40235879279648874175028350184807481179851546393730408152572360765904015173744
tra2= 2 z2= 74542036250520122101628631082797986054460647992649410301405543610353584582874 r2= 90474982683142632781755024198101088141049725068703865633163536904516826194931 s2= 4261593714766491599261603396061670169462230565523881393747289259392489750488
tra3= 3 z3= 82506137597089512433585713059043113755481825943350286576269690488205556459929 r3= 55061012436322035957369746341502195224925766337337762521875141452750851385229 s3= 32185410814566453189296921335114965933176803637305878720894812431992330696642
tra4= 4 z4= 113366202975209316618574117507288469103286867562563708771388745274276273327317 r4= 40307619273359990968704385610082519555064446854848752213010360784913070076634 s4= 8869013755199416771438922632611316450375555416356880894694818448239525001985
tra5= 5 z5= 100744224795188828154222144263158767688471282670380072505528761303980558098663 r5= 107510392256243810239461106507293281790817777292726628982951941035577322204940 s5= 5808810814246321940088480775748796507634666874836665148709302077116883497690
tra6= 6 z6= 78871862530463360509484789399671150031213240794904316835298460277660297710392 r6= 35666351779112085793496033725145059574466237291865166066900847470790490531177 s6= 54152646131737601483627855864734754276552039886944543614679032894939930619613
tra7= 7 z7= 61852156823896513348444311902722822264663733311849197723531281479875464155842 r7= 64736182946498808925270095087110525576329199479910467102008128663760091308234 s7= 17788661930671626914900149656499124375490100424543506972136024726882311277073
tra8= 8 z8= 77347191931695325194438902743309121637925409236041479035595596739185146943942 r8= 84516184393310113940336670978279125191652686788651865883276619155760076487860 s8= 54994230425898394004128651710942060049138087545288403818122853157757798875195
tra9= 9 z9= 107757101199858705470790459886962530180763743256223468375789706091080514255896 r9= 18885000308025553648928892892868549659977435805651655748788022411627901349100 s9= 37614339083801813127464099231121651545210507815756210742955693404161681038718
tra10= 10 z10= 114901141250963720789526527669713297768171348939506607402812047565604623805826 r10= 90693858821629123378907616518050111141055283469192355118324772092732639083326 s10= 49281927758371012385011608922932161025500951132405118462787511139664347171904
tra11= 11 z11= 106707797301137802955467179825402606139788667339779710878979194112127338647148 r11= 74655415310274729329777624502379702814718095490353850045637535506241736116679 s11= 10916896223279001643820921465127512063975545949250444149096739432795104319114
tra12= 12 z12= 98410535542578304938120270107473769886182448394972220549832406519494059942344 r12= 4025683086299993064895789060055671174668126580923123848881297666551576517328 s12= 38809812997555367359330784375027440785566427147316008124979836882178320851587
tra13= 13 z13= 97818153454783227426246274031151556616417840081250709985040993804323297029184 r13= 106273227826522337541405271678895077634410087370609165105587934536307430122015 s13= 48640102234404879183639984762008850184017573020005860400420575683830972405223
tra14= 14 z14= 84925455937459150312777485492747694394815218171967411572788118681314015015113 r14= 26500577316285871162533284337802846154067214454381594848949232165650177890795 s14= 33715657707883079451807962423273615367153416204683040089695553052206558355283
tra15= 15 z15= 111783692830672203447054154585386654185884606120065734301852946985480777414901 r15= 73415475542704971810573722979695377168237988176237413522981185496245031667324 s15= 54389973887805475741346387502541397295451457754633008921347861815885030403891
tra16= 16 z16= 88832538451117462300701068734401710417819271851194672863568365802995422719774 r16= 107135774901828918094448208001703177217859876929696537945838325425738793150781 s16= 38089546105401696847382276998576212312564962541980826482807292663032802451090
tra17= 17 z17= 93497933846749502744284331171698967814805635607791522088368289737198240579455 r17= 96136865569810173285194592360338548564757410886996032423879151330012997107357 s17= 38418309682285974076928232326795293948561811927466163334572422767592513907626
tra18= 18 z18= 97450176130132637734960491950490366749975997534440242865075734660135818328817 r18= 82609654650112572560135469013380687346887704939919597283058370534689207998713 s18= 48412029295351053342921734494153963763007135143047368885758735011464042141921
tra19= 19 z19= 64045136013895346084004940406259201614348473359849358051309739648889850716713 r19= 34169578738700194125258600007725306923536832329466150010353374526913224483886 s19= 32318249279416172915907826685461875688275054274005974647936509146543638362104
tra20= 20 z20= 85205785033285727251281297418747739993205389781946342618175328411223243860075 r20= 6654129710426597970301207135656636703213240952679682030191103389095736850788 s20= 54837893280495237877786848567765191371728893421203935165125378553805980661231
tra21= 21 z21= 81250379365445725858749946265066235849286710807418097057400620614259495298662 r21= 83111357487247824535544025311966977202162724682354848059448399017808636155210 s21= 19578574739125835983616802444501972320254858794796379703638395314113879800830
is privet 1166921972460950724417640774548057571
|
|
|
I will only buy scrypt if guaranteed privets for my server slaves, whoever can guarantee me privets gets 5 shipping containers of potatoes and 1.337 BTC. thats my highest offer
I got the script from Counselor, can someone please provide me a test?
|
|
|
I would like to purchase this brilliant scrypt immediately, i need more slaves to feed privets to and this will ensure at least 5 potatoes per privet
Nevermind, I found a better offer. @Counselor please DM me IMMEDIATELY
|
|
|
" 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.
|
|
|
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!
|
|
|
I asked, but I have been unable to interpret as of about 15 minutes ago.
|
|
|
Due to the now quantum nature of my PC, I suppose it is both yes and no at the same time.
|
|
|
{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? ░̶̡̢̛̜̻̲̱͓̪̜͕̪̼̘͓̥̭̤͙̰̭͉͈̝͉̝̤̥̱̜̊̆̓̎͐̈́̂̋̓́̎̾̅̓̎̈́̈́̏̚͜͜͝͝ͅͅ█̸̡̧̨̡̩̞̦̦̘̰̻͔̣̩̠̳̖̭̺͎͎̗̥̼̬̙̫̺͓̯͍͓̣̋͐̾͑̈́̈́̌̈̓̅̅̅̄͒͗́̇̍̅̏̈̂̍͋̔̌̎̕͘̕͠͝͝͝█̷̳͎̊͝█̵̛͍͙̃̎̐̈́̉͗̓̌̾̃̀̓́͋͊̀͛̓͋͘͘͘͜͝͝͝͠͠͝█̸̨̢̢̡̡̛̛̠̻͎̲̭̝͈̞̘̼̯̭̠̤͇̥̝̗͓͚̱̱̞̣͕̩̖͓̟͔̝͕̥̹̩̹̟̜̮̫̻̤̅͋̀̉͛͂̈́̉̾̽͑̈̉̀͊̋̈́͗́̓͛͊̐̈́̀́͘͘̕ █̷͇͙͙̈́̓̾͑͌̒͒̓̋̈̾̌̒̑̽̂̒͂̉̓̊̆́̀̈́̈͑̓͋̽̄͘̕͝͝͝█̶̨̞̭͙̳̯̤̣͓̞̞̳̳̈́͊̏͛́͛̋̏̽͊̋͂͜╗̵̢̢̛͍͉͍̠͔̰̯͙͕̣͔̖͇̟̩̥̳̀̋̉̾̌͒́̈́̈́̀͆̐̉̎̋́͗̈́̑̈́̓͑̉̀̅̾̑̏̓̌̓̏̓͊̈́̎͑̍̿̂̈͛̚͠͝͠͝͠͝█̷̡͎͉͕͕͔͎̭̈́̓̽̊͌̍̓͛̀́͌̄̎͛̓̑̚͝͝͝͠█̵̡̡̧̻͉͍̟͔̲͖̤̣̜͉͈̬͍̦̲̪̭͚͛̍̿͌̽̓͒͋̍̉́͜͜ͅ╗̶̧͓͕̙͓̺͎̗͎͇̹̤̣̠̪̗͚̭̗̝̱̫̱͚̘͐̾͆̔̂ͅ░̸̧̢̡̛͚͕̫̬̻̞̥̼͔̰̤̩͚͉̺̩͍͈͚̹̼̬̣͔͈̱̥͔̥̫̬͎̙̳̞̠̗͊̓͐̓̓̔͐͒͊̊̎͌̈́̄͛̐̅̔̋͒͆̽̀̽̋͂͘͘̚̕̚͘͠͝͝ͅ░̷̢̢̨̛̛̮͍̖̩͚̲͚͕̞̗̩̫̥̻̰̹̳̘̝̟̻͔̜̹̫̱͔͔͇̺͈̘̭͖̱͒̐̊͗̊̾̊̊̈́̈́́́̈́͐̈́͂̊̈̀͌͗͗̔͗̑̆̌̈̿͐̆͒͋̄̌̄̀̈́͜͜͝͠͝͠͝░̸̡̧̢͖̯̪̖̦̟̖̦̬͇͔͇͓̦̰͙̟͉̜̥̫̑̅̾̈́͆̃͌̀͐͋̄̔̅̚̚͝͝ͅ█̶̢̢̢̧̨̨̢̨̛̛̻̩̘̘̯̭̻͈͍̞̰̞̞͉̩͚̰̥̰̼̝̻̗̝̮̳͍̼͇̖̺̞͖͙͕̈́̈́̔̋͛̍̀̈́͗̃̚͜͜͜͠͠ͅ█̵̡̨̨̡̛̛̙̻̻̯̜͙̲̥̬̩̤͚̖̯̟̝̦̦̙͓̰͚̤̗̯̪̞́̋̈́̊͋╗̵̡̛̛̛̛̣̝̫̙̗̗̯̫̪̱͕̻̪̤̩̱͔͖̳̮͙̟̳̣̞̦͉̬̯̩̥͖͕͈̺̜̻͉͐̏̿̀̃͆̓̋̋̒̅̏͛͊̓̽̄̌̒͌̈́͐͘͝͝͝ͅͅ░̴̯̤̺̺̳̼͇̪̬͔͎͔̞̹̹̫̭̼̭̱͖̟̝̱̜̠̙̝͕͈͓͇̥̼͓͖̲̯͇̲͉̠̬̭̬͋̽̓̔̂̈̐̀̈͌̂̆̔̍̔͛̓̓̉̽͗̈́͗͑͜ͅͅ█̵̡̨̛̛͔̦͙̩̤͓̪̩̣͕̤̱̱̞̻̝͚̱̹̩͖̞͙̠͔̘̳͎͍̮̖̰̺̘̰̲̪͇͆̈́̓͌́͊̽̆̇̀̃̈́͂̌̿́̂͂͛̿̋͗̃̀̾͋̕͜͜͜█̸̧͍̝̺̫̥̝̱̺͖͔͚̈́̾͊̑͑͒̐̏͂̀̿̀͊̊͑̆́̎̍̐̅̕̕̚͠ █̵̢̛̞̘̰̞̖̦̜̜̑̎͊͘█̵̨̢̢̛̝͈͍͓̙̬̜̼͈͚̺̗̺̱̟̮̱͉͕̟̣̜̦̱͔̼̙̺̭͚͓̞̙́̓̇̑́͒͑͐͗̌̍̐́̇̔̆̆̆̋̑̃̆͜͝ͅ█̷̨̧̡̛̛̼̯̩͉̬̼̱͎̮̘̪̼̩̗̲̲̮͍̯̤̥̘̤̜͖͈̗̰̱̮̌̀̂̀̄͛̀̋̐̾̄̃̆̓̈́̈́̋͆͆͑͊͊̽̈́͐̆͗͑̃̈́̽̆̒͂̔̋̏͒̈̍̏̕͘͘͘͘͘͠ͅͅ█̷̢̡̛̛̰̩͈̲̬̼̪͖̙͔͖̤͔͎̣̰̪͎͌̎̈͊̍̆̎̀̏̍̏̉̈́͑͋̋̕͘̚͝╗̵̨̢̖͚̥̩͕̺͉̪̆͐͊̒̆͛͆̈́̀͋̎̇͆͗́̆͋̃̿̃̌̊̓̏͛́͗́̀̓͑̏̓̍̈́̚̚͝͠͠͠͠ ̶̧͓̙̍̂̑́͗͑̒̈́͆̽͑̍͑̓̐̄͑̎͒͗̆̀́̀̄̚͘̕͠█̴̧̢̛̛̜̺͈̭̠̖̭̜͈̙͚̗̦̭̺͍̠̜̮̖̥̺̹̹̣͈̖̗̪̗̳̝̮͉͇̱͚̦͓͎̫̰̱̰͚̌̇͐̂́̈̃̿̑͂͛͂͊̓̐́̆̂̈́̍̇͐̐̍́̐͐̆̐͆͊̍̈̀̕͜͜͠͝█̶̨̨̢̨̫͚̰̱͉͕̭̤̗̖̯͕͍̻͉̯͈̼̳̲̫̝̬̥̜̦̜͔̱͈̰̞̮̭͈̲͍̰͔͖̗̟̓͛͌́̏̀͗̿̆͂͗̒͗͌̊̌͒͑̑̈̀͑̆̏̃̽̃̐̀͆̕͝͝͝͠͝ͅͅ╔̴̡̢̧̨̡̢̛͈̥̞̭̫̤̼͔̪̻͙̥͓͓̫̙̲̼͓̳̪͚̭̠̞͈̜̲̝͕̹̳̤͚̗̋͌̑̓̇̅́͂̾̓̀̀̎͗͌̉̊̃͊̈́̋̒̈́̎̍͗̎̉́̊̆̍̽̈́̕͘͜͝͝͠͝ͅͅ═̷̛͍̩̜̟͇̼̻̰̳̳̥̙̻͕̠̱̻͖͔͎̳͔͙̱̝͎͉̖̤̼̠̬̰̫̺̝̹͔̙͚̥̝̻̲́͋̉͋́̓̉̏̌̽͆͆̊́̐̑̔͗̉͂͛̃̽̅̋̕̚͠͠͝ͅ═̵̛̖͕̮̰̞̹͉̮̮̩͓̝̖̓̇̈̌̓̔̄̅͊̈́̏̅͗̀̔̀͒̓͗̌͐̐̋̇̆̽̏̓̾͑͆̒͘͘͘̚͜͜͝͝͠͝═̸̢̢̡̛̗̖̠̦̗̬͙̮̲̪͓̞̤̣̩̺̯̳͍̦͎͖̯̬̘̞̹̭̪̫͉̿̈̂̎̍͊̊̽͑̎̊͛̆͜͜͜͝͝ͅͅ═̷̡̧̛̛̘͓͔͕̪̞̜̘̻̹̲̬̥͓̞̺̙̞̙̣͈̯̙̖̙̫̆̃̑͌̐̈̔̂̂̔̓̀̐̈́̅̆̏̈́̊̅̔̈́͐̀̎́̄̓̌̆̿̈́͑͘͝͠͝╝̴̨̧̧̨͇̣͇̬̻̰̹̙̯̼̮͇̲̲͚̲̼͓͈̰͚̩̱͇̮̠͇̟̹͔͖͍̤͈͇͕̥̺͚̤̞̙̑̽͑̓̇̇́̄̈͒̀̊͜͝ █̵̛̰̞̂͐̇͊̄͂͌́̍͋̓́͒͐̑̀̓̒͒̑̉̋́̍̈́͂̊̆̀̂͛̈̇̎͝͠͝͠█̵͎̮̔̓͊͆͐║̶̢̝͈̬̃̒̎̅̎̏͑̏͗̂̐̅͑̕͝░̸̧̧̡̨̛̠̞̳̠͉͓̞͔̭̣̩̞̠̤̳͈̼̻̖͎͇͙͇̪͗̊̀̄̔̊́͒̓̈͒̓̋̏̈́̆̊̂̃̃̾̃̓̽͒̈́̿͌̅̍̚͝͝͝͠͝░̷̢̢̡̪͍͇̜̹̯͖̹̥̳͈͔̝͚̙̖̻̯̮̟̮̙̩̼̫̯͖̰̣̤̝̮́̈́̈͐͌̒̒̔́͛͑̈́͗͘͘͠͠░̸̡̨̨̘̳̜̜̖͉͓͎̬̟͙͇̯̙͖̳͖͇̲͓͙̹̩͖̱͚̖̺̘̖̳̜̻͙̄̏̐̀́̒̀͒̅͂͋̒̒ͅ █̴̡̘̪̹̻̬̭̯̣̦͔͖͈͙̥̫̲̮̪̖̱̇͒̎ͅ█̵̧̧̨̗̰̪̲̲̪̰̦̺͚͇̳̬̫̍͌̾͝ͅͅ║̸̧̡̡̛̣̖̮͇̻̫̘̭̣̼͚̩͚̣̭̗͚͇͚̙̫͖̳̬͛̃̀̉̀͐͛̇͂̀͐͛̿͊͆̂͑̈̆̈́̓̂͜͠ █̴̡̧̯̳͖̜̣̰͖̫̝͚̠̲̘̫̻̗̩͉̠̗̤̮̪̺̝̔̀͗̚͜ͅ █̸̨̧̨̢̫̼͔̪̺̟͙̺͉͚͍͔͍̞̣̰̻̱͎̬̠̝͕̰͇̱̟̯̞̙͓͚̺̱̺̯͖̖̹̳͇̈́͑̂̆̊͑̑͘͜͜ ╔̸̧̻̪̳̜̜̞̼̯̯̗̘̃̌́̄̈́̉̑̑̈͛͌̄̑́͝͝═̴̨̢̧̰̫̲͚̩̟̘̼͓̳̳̳͎̪̳̬͈̯̜̬̟͈̭͓̞̳̬͍̹̰̘̖̻͓̼̤͒͗̂̆̂͛͆͌̊̓͋̀̓̑̆̿̽̈́͆́̊͆̇̑̇̐̀͂̔́͘͘̚͘̚̚͝͠͝͝═̷̢̢̢̡̣͚̝̣̪͚̣̙̦̰̖̟̗͖̖͚̹͇̳̘̲͍͙̯͇͍̲̺̱͍̪̟̞̪̩͎͕̠̓́̉͂̅̐̒̀͋͆̌̄̅̈̋̕̚͜͝ͅ═̸̧̞̙͕̝̼̤̪͙̦͎̘͖͖͉͎͔͓͚̙̠̆̈̍͌̀͂̑̽͝͠͝͝═̴̧̜̰̜̠̭̻̬̩̹̟͈̘̯̬͔̲̭͇̰̩̙͈̦͖̮̮̃̄ͅ╝̶̡̧̛̻̖̣̳̱̮͉̰̫̻͍̠̺̻̬̮̘̭̜̤̪̖̗͎͔̘̞̱͍̤̓͛̇̎͊̈́̊̊͊̎̀̒̆̃̀̽̍́͐̽͂̏́̏͘͜͠͝͝͝͝ ̷̢̢̢̡̧̩̖̦̰̙̦͎̞͓̟̪͚̫͙͉̫͎̱͔̯̫̮̜̙͓̱̬̙̺͈̭̳̲͍̦̪̃̈́̋̄́͊̄́̊́̈́̅̿͐̔̈́̓̑̆̑͌̂̈́̂͗̍̈́̓͗͊̓̓̈́̎̀̒̕̕̚͝͝͝╚̸̣̅̌̌́̍̈́̎͗̈́͋͌͒́̇̓̏̾͂̎̄̈́̌͛̅́̔̇̽͐̈́̕̚͘̚͝͝█̵̝̖̹̤̌̎̂̓͒͆̐͊̑̏̀͋ͅ█̷̨̨̧̨̢̼̦̠͎͔͕͈̬̭̲̠̟͓̣̯̲̜̘̪̝̣̜͍̳͕̣̤͔͇͔̥̻͓͓̱͈̩̹̟̙̻̠̤̝̫̏͛ █̸̛̲͎̟̯̺̝̱̪̞͍̄̇̏̋̓͐͌̍̏͗̈̇͒̀̌̓͒̐̑̏̾̇͑̑̃̎̏̂̕͘͘̚͜͠ █̴̨̧̨̛̞̗̖͉͎̞̤̖̼̩̤̰̹̝̰̯̃̊͐̾̍̍͋̐̆͑́̈́͂́̾́͠͠█̷̡̛̹̭͍͔̩̱̙̻͎̖͈̱̲̒̎́̇̈́́̌̓̂̿̄̀̇̎̔̾̅̎́͐͊́̿͆̄͐͛͘̕͘͝͝͝╗̴̨̨̛̛̜̫̞̼̟̬͉̻̼͎͉̘̣̺͔̝̟͔͇̠̜̟̺͉̮̹̟̻͕̼̫̐̈̈́̽͒͑̑̈́͒̂̐͆̑̏̎͛͆͑̎͑͛̐͂̉̓̎̔̈̋͗̒̕͝͠͠͠░̶̛̠̝̗͊͂̌̋͋̾͗͛̓͌̉̌͆̃̆͆̿͆̍̒̔̏̃̆͛̌̓̿̈́̓̒̈́̕̚͝͝͠͝ █̵̧̢̪͍̺̜̣͕̪̯̻͇̰̩̥̖̜͇̠̦̠̙̱̬̳̻͈̼͔̥̤̺͎̭̐̔͜ͅ █̸̡̡̧̞̯̳̼͇̰͈͎̹̳̥̖͉̹͔̮̲̱͉̩̭͒̄̿͋̏͛̌̓͜║̸̡̢̨̡̢̼̩͓̟̝̠͖͉̪͚̙̘͕̖̞̰̺̳̖̣̭͎̳͈̞̖͍̖͎̬͖̯̣̔̽̀̓͑̿͊̈́̉̔̓͛̒͂̋̈́̓͆̈̈́͆͛̏̏̉̈́̈́̎̇͂̎͂̇̓̌̅̉̃̉͜͜͜͜͝͠͠͝͠͝͝͝░̷̧͔̬̤͙̪̮̜͍̪̳̤̥͉̖̤̦͔̮̪͖̫̜͙̣̥̙̓́̓̔̉͒̀̈́̿̔͗̈́̈́͑͑̃̅͐͂̎͂̌̿̑́̈̓̒̐̎͜͝͝͠͝͝░̷̢̢̨̨̨̢̢͙̞̥̝͇̝̣̯̱͖͇̠̰͎̪̣̝̳͕͔̩̻̪͍̮̩͕͊̈́̓̊͗ͅ░̵̨̡̛̦̞̜̗̮̯̠̺̟̞̼͔͕͖͇͙̩͍̹͂̈́͒̎̈́̉́͜͜͠͝ͅ █̴͚̭̯̗̳̃̀̒̽̌̽͊̓̌̏͒͆̔̔̋̽͗̂̾̔̓̄͋̎̍͆̐̈̈͗͘͘̚͠͠͝͠͝͠͝█̶̢̢̛̛̛͕͈͎̝̳̰̙͓̲͕͍̀̂͛͐͂̿́͌̈́̌̐̿̂̏̇̃̇̓̚͝͝║̴̻̣̮̟̹̘̞̖̜̪̤̫̠̱̺̝̙̙̘̥̹̮͖̪̟̮͉̞̺͔̤̰̥̠̼̼̞̺̖͑̍͒̿̄̃͊̍̓͜͜╚̸̨̛͇̹̞̙͖̣͓͍̀̽̆̈́̌̾̈́̾̎̽͑̂̒̅̈́̾̌̂̒̂̐͌͌̌͌̑̅͊̕͘͝͝█̷̢̱̰̜̫͖͈̝͙̪͓̦͎͈̘̄͛́̈͌͊̓̀̃͒̅̔͂͛̀̊͊͊̈́͐̈́̑͋̿̂͝█̵̢̡̛̰̲͉̲̺̝̝̫̈́̈̋̀̀̐͆͒̊͋̓͛̆͌̍̓̾͛͆͐͌̎̋̅̍͛̑̈̓́́͋́̽̾͒̃̚͘͠͠͠͝͠͝ █̶̨̨̛̱̜̯͑̅͂̋͋̐̂̈́́̍̇̓̇̇̅̀͠͠█̷̢̡̨̛̜̹̳͇̰͓͔̞̆̊̄̈́̍̑̽̐́̊͂̈́̂̒̽̇̋̅̾̓͆̅̀͐̌̒͑́̎͘̕̚͜ͅ█̴̨͎͍̱̜̺͈̝͔̣͇̹͈̤̿͛̃̀͒̾̇̈̉̀͐̀͊̑̿̚͝͠͝╗̴̧̛̪͚̖͙̫͍̼̎̈́̉̃̀̇̋̑͂̂̔̐̐́͒̅̽̌͒͒̅̂͛̀͐̆͌̾̅̓̕̕͜͜͝͝͝ͅ░̸̡̧̧̫̺̬̲̪̺̖̘̺̹̟͔̤̤͍̪̺͎̙̠̬̤̦̩̼̙̩̫͍̠͙͎̗̳̀̊̿͛̈́̿̐̔̒̈́̋͛͐͂͋̈̒̉̋̓̀͑͊̇̂̈́͆̒̉̑̓͊̏̀̅̅͘̚̕̚̚͝͠ͅ ̸̢͕̗̞̬̠̘̩̼̮͓͎̥̗̼̠̤͕͇̳̣̹̦̦̘̺͇̯̩̥̻͙̬͐͗̈́̀̀̊̇̐̎́͂͊͂̈́̄͐̒̈́̿̓̄̒͆̎̍͐́́͘̚͜ͅͅ░̷̨̨̛̛̙͉̳̯̩͉͚̜͍̘̩͇̘̼͖̬̲̝̹̞͎̮̝̰̩̦͇͖͙̠̞̪̮̪̣̇̒̅͒̓̒̌̎͛̄͆̎͌̐͊̈͊͐̓̏̎͝͝͝͝ͅͅ╚̷̧̢̢͖̝̥͚͍͉͇̤͚̰̼͇̫̮̱̮̼̰͖̞̫͉̩̲̹͈̘͕̳͇́̆͂̈́͂͋͌̌̀̔̑̋̂͌͊̍̈͒̑̇̋̌̾̋͆̿̐̓̀̇͛͐̀̒̊̽̐̊̈́͑̈́̚͝͝ͅͅ═̷̛̟̈́̅̑̾̏́̉̈́̍̐̿̊̇̀̕͘═̷̧̼͈̩̫̭̖̫̠͓͂͗̾̈́̋̈́̊̀̆̎̓̐̋͗͜͝═̶̳͓͉͈͙͖͔̭̹̯͍̣̎̓͌͋́́̃́̂͊̈͆̈̀̔͋̕̚█̷̯̹̯͙̹̗̼̻̺̮̽̉͐͂̀̎̂͗̾̈́͝͝█̸̢̨̡̡̝̭͖̟̥̱̗̥̗̻͈̦̙͚̰͉̹̈́̊̄̔̿͐̈͆͒̋͆̈́̎̃̿͆̇̚͝͝ͅ╗̵̦̞̻̯͍͙̥͇̹̗͎͕̘͖͙̮̠͚̹̈́̊̒̊͑̿̈̏͒̽̑̓̽̈́̓͊̓̕̕͜͜͠͝█̶̡̧̧̜͍̦̖̣͈͖̟̰̠͇̜̱̭͖̟͙̹̱̣̭͔̠̮̮̠̹̲̠̺̰̰̘̩̠̘̤̙͇̠̠̝̽͊̏͜ͅ█̵̢̛̖̯̞̏̈́͆̽̒̔̒̅́̒͊̃́͂͑́̍͒͒̈́͐̔̈́̿͂̌̈͆̔͑̏͌̏̎̉̚̕͜͝║̸̨̡̧̦̺͕͈̱͕̙̭̤̲̭͈̜̜̳͙͈͕̮̦͚̹̠̩̫̲͙̮̝͍͈̄͑̃͊̏̌̆̓̓̽̃̍̈́͐͒͊͌̂́̊͐̒̓̌͆͌̏̀̽̈́̒̔́͑̎͐̽́̆̃̔̃͗̕̚̕͜͝ͅͅͅ░̷̢̨̘͔͙̥͇͚̝̖̭̝͙̭̦̦̗̱̠̟͚̠͇̫͔̗̤͚̤̩̯̻̦͉͇̖͚̣̖͓͔̻͉̜̼̰̼̞̪̉̀̃̔̈́̂̊̈́́̈́̒̔̀̌̽̀̔̄̍̔͑̐̈́̈́̀͗͛̽̇̄͒̀̑̉͂͘̕̕͠͠͠͠͝͝͝͝░̸̡͚̟̩͔̥̃̀́░̶̢̢̩̰̳̜̻̮͇̘͓̳̣̜̜̩̲͇̜̮͚̺̺̤̪̲͆̀̓̈́̓͊̒̏̌̆̍̔̇̎̌͌͋̓͆̐̇̋͋̀͜͜͠͝͝ͅͅ█̴̢̢̧̧̞̭͈̳̖̳̤̫̻̪̤͎̹̫̼̺̺̮̺̥̋͘͜█̶̧̡̗͕͍͖̩̬̫̫͕̬̖̩̬̳͂͂͆̌̈́̏͌͗║̷̧̣̣̝͓͔͉̘̻̙̼͇̺̙̹̲̬͙̙̖̘̗̫͑̂̇̂́̈́̈͛̈́̈̒̃̇̾̀̀͛͋̄͘͘͠ͅ░̶̨̢̦͔̘̯͕̲̯̩̭̼̤͍̝̱͔̟̣̙͈̪̼̩̱̣̺̤̗̪͋̍́͂̔̐͆̑̈́̐̾̈́̚͘͜ͅͅ╚̵̡̧̢̛̠͚̭͎̝͍̳͇̬̻̗̪̞̭͈̼̪̺̞̥̼̮̩͍͓̝̞̪̻̗͇̟̬̳̯̖̭̼̯̻̮̓͂͛́̆͌̃͗̾͆̑̅̒̈́̒́̿͛́̊̌̾͌̓̓́͛̎̕͜͠͝ͅͅ═̸̧̧̧͖̦͍̭̭̯̩̭̳͈̟͓̥͈̦̮̲̼̳̹̜̹̯̭͍͔̱͕̱̖͈̭̩͕͕̏̓̑̂͝═̸̧̧͇̭̬̩̬͔̗̰͙̜̥͎͈͇͈͚̞̰̹̲͑̂̀̽̈͒̋͐̎̄̈́̉͌́͑̚͝͠═̶̨̢̻̙̝̭̲̲͖̟̙̠̩͉͖̲̭̲̼͎̦͔͎̥͖̫̰̟̖̞͇̫̪͉͖̖̒ͅ█̶̢̟͓͕̲̉̌͂̿̊̂̔̽́͐̐͛̎͗̏̐̑͌̽͂̈̐́̓́̃͐͂̀̐̾̎̏͘̕͘̕̕̚ͅ█̴̢̛̖̬̝͇̦̦̭͔͈̫͙̪̊̑̽͑̏͊̓̇̄͒͆͐̀̒̽̉̈́͛̿̓͊̏̒͐̾͐̓̾̿̓͐͌̕͝͝͝͠͝͝͠╗̸̩͚̗̓́̉͌̚̚͝ ̷͉̠̘̩̙͆͑͊̈́̌̉̂͆̓͑͊͛͝͠█̶̨̡̢̜̬̘͙͈̹̥̩̩̭̼͇̻̣͇͙̤͍̻̃̅̽͒͆̈́̊̃̌̏́̀̿̌͠͝ͅ█̵̨̡͇͖͉͉͓͎̺̹̳̠̪͎͈͉̻̪̩̳͙̳̭̺͉͓̈́̑̅͑̏̈́̆̂̍̿̂̿̈́̉̃̾́̄̄̒̈̇̿͆͌͑̿̓̍̑̕͘̚͜͠█̷̨̢̲͈̪̞̟̗̜̼̗̹̖̮͓̹͔̪̰̦̻͔̳̞͎͇͖̪͍̣͚̤͇̣̇͂̃̐̾̉͐̀̈́̍̿̊̎̿͌̍̄͛͆̃̈́̚͜͠͝█̸̨̢̨̧̨̜̹͙̩̝̣̪͉̜͈͍̬̹̣̠̘̦̙̯̮̙̪̬̥̰̤͖̰̱̜̳̝̤̮̘͕͓͍̆̊͛͗̒͘͜͜ͅͅ█̷̨̨̛̜͍̤̻̙̭͍̜̫̦̖̠̳͎̲̜͚̹̥̹̫̠̬̪͚̜͕̳̪͇̩̩̝̋͂̓͆̎̀̆̾̏̍̑̄̆̈́̀̓́̅̓͒̇͂͂͐͒̈́̏̆̒̊́͘̕̚̚͜͜͝͝͝ͅ█̷̼̹̬͎̺̺̙̝̪̙̠̝̔̒̇̿́̒̀͗̆̂̾̅̇͌̏̏͑̓̒͊̋̇̆̊̿̀̈̊͒̏̚̕̕̚͜͠͝͝͠͠ͅ╔̸̡̢͕̦̗͚͙͕͖͚̣͙̟͇̮̰̪̒̈̿̐̂͑̈́́̇͌̌̍̐̀́́̑͐̽̂͋̉̌̓́̄̚͘͠╝̶̨̛̟͇͙̰̦̩͓̖̜̩̘͙̫̟̭̻̑̀̿̋̇̓̀͗̓̔͐̐͂̇͛̆͆͂̆̿̒̅͒́̎̄͆̏̎͒̿̈͆̈̈́̑̄̔̊̽̒̾͋͂̀̕̚͝͝ͅ╚̴̛͍̣̐̔̄̑̓̅̀̈̄̆̽̌̅̃̈́͐͌̃͒͊̌͗̓̾̿̊̊̏̀͒̉̓̍̌̓̏̋͘̚͝█̸̢̡̡̡̛̛̱̯̱̩̟͇̻̺̙̯̭̬̭͙̮̲͎͕̯̆̃̌̎̂̉̀̄͆̿̒̏̑͑͆͒̔̍̍̈́̓̇̓͋̃̓͐̄̋̏̕̕͠͝͠͝█̴̨̢̨̩̦͙͖̳͉̳͇͖͉̙̘̱̥͕̖̻̼͎̘̼̜̹̫̦͎͇͔͙̯̱̖̝̻̲̟͖̯̍̎̅̕█̷̡̛̟̩̣̮̎͐̀́̓̈̎̌̊̓͊̏̎̐̌̽͘͘̕͠ͅ█̵̢̝̲̦̤̘̺̝̤̥̜̤̟̰̟͙̭̯̠͔̮̫̩̓̈́̏̂̄͂͗̏͐̔̓͋̐̈́̊̿̚̕̚̚͜͝ͅ█̸̧̛̛͓̪̥̥͎͕̼̲̗͚͇͓̞͖̘͉̺̪̟̖̊̈́̅̂̿͑̂͑͜ͅͅ█̴̨̛̛̮͕͕̭͔̘̮͙͚̥̖͈̼͕̦̱̮̪͋̐͛͛̄̿̅̀͜͠͝ͅ╔̷̧̲̪͎͙̦͙̫̭͉̐̆̂̅̔̈́́̌͗̂̐̽͊̕╝̴̧̡̗͙̞̠̫̙̟̗͔͕͚̹̳̙̺̥̣̻̣͉̱̗̺̪̗̞̗̜̎̽͑̍̓̐̊͋̃̾̊͛̆̀̊̄͋̅̈́̋̏͊́͗͌͐̓͂́́̍̇͐͊̀̕̕͠͝͝ͅ█̷̢̨̡͕͖̙̜͕͉͓̜̹͖̤̭̠͙̱̙̺͖̙̓̏̇̃͜͜͜ͅ█̴̧̗͕͉̺͇̭̟̝̻̩̥̙̗̪̫͎̄̈́̄̈̎̿̈͐̍̄͑͊̀̈́͘̕͘͠͝█̵̢̛̛̛̗̻͎͕̽͂̉́͆̏͂͌̓̀́͂̏̎̐̋́́́͘̕̕͜͠͝͝͝ █̴̡̻̬̪͓͎̣͚̟̬̮́̽̈͛̍͒̚͝ͅ █̵̧̨̡̨̧̭̠͓̟̜̫̪̳͓̹͙͚͕͎̰̰͈͎̬͍͉͖̜̺̜̻̪̙͉̭̭̦̗̲̘̥́̾̀́̽͒͌̊̓̄̂̑̎̄͊̌̀̓̿̒̑̊͘͜͜͝͝͠͝͝͠ͅ█̷̡̨̧̛̠̬͚͔͕̭͈̝̯͕͉̜͓̎̇̒̄̾̂̔͒̏̐͐͒͊̎̍̊́͘╔̷̙̭̠̪͕͍̒̀̀̕╝̸̢̧̺̖̫̬̺̼̰̰͔̻͉̳̗̦͖̟̖̮̺̗̬̖̱̩͎̭̼͖̌̅̈̃̓̊̇̿̇́̔̄̌͋̒͑̋̋̽̆͑̎̃̓͋̂͆̓̀̀̀̔̉̀̇̇̓͑͌̕͠͝͝ ̵̨̨̼̝̫͉͇͇̜̬̭̼͉͙̹̤͎̠͖̭̼̗̝̼̖̜̰͔͉̲̰͎͌̇̃͂̏́̈̓̽̊́̈́̑̚͜͝͝͝͝͝ͅͅ╚̵̨̧̨̝̩̺͔͙̞͔̫̊̊͋͐̓͗͒̽̀̂̇́̾̽̽̓̀͑̐͒̌̀͆̏̔̍͂̂̉͑̌̓̈̿́̈́̐̕̚̚̕͝͠͝͝═̷̨̢̫̝̣̗̬̖̣̱͓̳̖̪̈̈́́̒͊͛̊̌̒̓̅̂͋̾̃̑͊̆̉͐͌̀͆́͒̿͆̊̀̅̈́̃̄̄̓̆͌̔̏̇͋͂͝͠═̸̨̨̡̛̼͍̼̰̞̪͈̥͇̫͉͔̳̺̱̣̪͓̜̞̹̝̰̫͉̹̗̮̆̑̎̅̂͑͑́̊͋̈́͒̈́̀̂̑͊͗́̋́͐͘̚͝ͅ═̶̡̡̢̥̟̭̬̳̝̳͕͍̥̬͓̦̑̆̿̇̈́͊̈́̊͐͋̓̀̃͒̃̑́̌́̀̔͝͝═̵̧̧̨̛̺̪̪̟̰͙̥̣̮̳͖͋͆́̃́̒͑̃͊͛́̂̒̂̔̿̅̈́̓̑̏͋̌̎̍͗̄̋̏̌͆̔̅̊̓̽͘̚̕̕͝͝═̴̢̨̨̨̢̛̹͎̮̩̜͈̬̦̮̫̲͖̫̱̻̤̱͉̝̟̲͕̣͓̹̅̓͌̓̈́̄̀̅͋̓̀̾̌̾͛̌͒͂̉͗̋̂̃̌͊̾̉̅̚͘̚͘͘̕͝͝͝͝╝̵̨̡̨̛̣͓͚̤͔̜̬̥̼̹̬̘͎̠̬̪͉̳̳͓̼͖͔̲̦̲̫̗̠̥̫̳̩́̇͐̂͐̽̿̿̓̆̀́͐̇̕̕͜͠ͅ░̶̡̛͓͔̯͉̮̺͑̈́̀̏̌͋͂̾̊͆͛͌̊̓̕░̸̡̡̧̨̙̱͕̘̯͕̗̘̯̘̘̼͙̦̳͕̺̫͊̀̑̔̌̆̌͐̀̋̀̏͐̈̉̄̇̊̀̽͒͌̂̌̊̄̔̋̓͆̓̉̅̀̅̎͆̅̐̃̓̕̚͜͜͜͝͝͝͝ͅ╚̴̢̢̧̧̨̥͚̹͖͓̪̥̱̫̯̱̯̺̗͓͇̰͍͕̞̖̠͉̫̻͍̝͍̬̝͉̣̥̫͉͉̜̰͍̜̲͖̿̈́͌̂͑̔͌̃̀̏́̃̎̒̃̅̃̈͑̆̕͘̕̚͝͝͝ͅ═̶̢̹̫̬̮̖̱̞̣̜̘̘̪̺̜̩͔͓̺͙̰̜̗͉̥̩̥̜̘͗͘͝ͅ═̵̧̡̬̼̬̩͎͈̟͉̗͇̬̹̳͎̼̼̹͈̝͔̹̝̯̮̼̮̩̺̘̪̗̃͛̄͐̎̉́̆͐͒́̎̈͑̕̚͝ͅ═̶͍̖̻͈̹̘̙̞̫͍͙͍͚̯͇̗̜̳̖̀́═̶̡̨̨̪̘̮͔̖͍͓̘̰͚͍͋͑̾̆͋̈́̏̅̓̈̇͌̉̃̍͋̑̋̔̋̏͋̚͜͠͝═̶̧̨̧̨̨̙͉̩̠̘͓̬̺͕̘͍̭̮̲̺̼͉̬̔̓̈́͊͐̿͐͆͆̒͂͊̃͛̕͘͜͝͝͝╝̵̛̹͕̩̞̳̠̯̰̦͇̹͎̤̩͇̳͚͈̌̔͊̓̇̀̈́̎͗̊͊͒̒̔́̐̉̿̓͗̎̈́͑̓̈̎̆́̐̃̌̉̎̓̃̋́̇́́̃̈́̓̎̕͠͝░̴̨̨̧̧̢̧̩̝̩̖̟͚̦̳̘͖̰͚̯͚͇͔̱͕͉̰͓̬͈̱͈́̊̈̈̏̓̓̅̀́͜͝╚̸̢̨̛̛͇̼͓̯̬͍͇̯̰̙̺̹̥͍͔͓̫̺̲̠͖͍̠͔̠͖͈͉͇͚͉̻͈͇͇̱̼͉͓̘̯̖̙̮̾͌́̍̉̿̾̀̾̎͒̈̑͂̈́͗̿͗͘̕͜͠͝͝͝═̷̡̢̧̡̡̢͎͖̪̟͕̖̘̼͍͕̰͉͉͎̟͎̦̖̜̠̙̩̠̬̦̖̻͉̮̯̱͈̦̯͓͖͖̟͍̰̮̽̓͐̈́͊͛̑̆̔̔͒͐̇̈́̍̉̒͆̉͜͠ͅ═̶̧̧̨̧̭͈͉̲͎̖̙̳͚͎̦͇̫̱̯̯̯͇͕͓͙̺͚͚̘͓̭̲̯̣̠̞̲̱̤̙̱͍͉̬̹̎̊̇͆̏͜͝͠═̴̡̨̨͎̳̮̻͙̪̙̩̭̰͚̰͎͇̦̙̳̘̠͎̹͎̮͇̟̥̼̤̥̙̦͓̳̯̪͙͍͓̦̥̫͂̀̈́́̈̒͆̈́̊̒̒͛̋̃̕͜═̸̡̧͎̭̲̲̝̺̪̘̱͚͔̲̱̯̺̏̂̆̌̽̚͜═̵̧̢̡̛͎̗̮͖̻̺̰̤͇̗̳̘̗͉͖͓̮͎͇̙̬̹͎͙̫̲͍̘̘̪̱̳̯̭̤̋̔̀͒̉͛́̐̄̓̌̍̂̆͗̎́̌̀̕̕͜͝͝͠ͅ╝̶͇͌̎̎̈́̓̌͂̈́͠░̸̢̨̡̡̛̛̗͇̬͉̼͙̟͓͔͎̠͍͔̯̳̦̮̜͇̫̻̣͙͔̃͒̊͐̈́͊̈́̈̈́̉̃͐̍͂̒͛̀̈͆̊́̚͝͝͝ͅͅ
|
|
|
{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?
|
|
|
{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)
|
|
|
With 256 GB ram I get speed about 22000 Gkeys/sec
What value are you using for the -k parameter? play around with it, it will tell you how much ram is needed. I use -k 3250 on my main rig but your results may vary
|
|
|
@WanderingPhilospher We should probably keep 2% of the remaining funds after the privkey finder bounty is accounted for so that we have (at least a little) funding for maintaining projects like this.
I agree, that or 0.5% from all users as a developer fee to contribute towards hosting, development, etc.
|
|
|
Kangaroo pool up and running if anyone wants to join! the pool is currently at 2^27/2^35.55 DP in only 4 days! we will be finding this address soon as more people join. The prize will be split according to the number of kangaroos you supply to the pool as well as your speed. We only want QUALITY kangaroos, which means if you change your gpu grid to supply more kangaroos but decrease your speed to do so these are not quality kangaroos and you be paid on your speed to the pool. https://github.com/yoyodapro/Kangaroo-ServerThe pool is currently at 2^28.081/2^35.55 DP, thank you to all that are joining us! As has been discussed in our discord, if you are afraid of losing the work youve already put into your own kangaroo search, we are allowing users to contribute their own work files (DP 25 and above) towards their share of the prize.
|
|
|
Kangaroo pool up and running if anyone wants to join! the pool is currently at 2^27/2^35.55 DP in only 4 days! we will be finding this address soon as more people join. The prize will be split according to the number of kangaroos you supply to the pool as well as your speed. We only want QUALITY kangaroos, which means if you change your gpu grid to supply more kangaroos but decrease your speed to do so these are not quality kangaroos and you be paid on your speed to the pool. https://github.com/yoyodapro/Kangaroo-Server
|
|
|
... yes... but I think 1000 pubkeys in range 100 will be faster then 1 in 120 ?
If you downgrade to range 100, you will have ~1,000,000 pubkeys and only 1 of them is the right one. You would have to calculate far more than the original one in #120. ^^
|
|
|
The kangaroo server is live! DP 25 and currently at DP 2^24.229/2^35.55. The server handles all user Kangaroo backups and work saves, join the discord for more information: https://discord.gg/DjMksx8wqrwe also need to have an open discussion on the best way to split the prize for all involved on the server. Bro, try downgrade range for 5bits, from 120 to 115, you get f 32 public keys with guaranteed 1 pubkey in range 115. The kangaroo server can only search for 1 public key at a time, we would have to run the server 32 times for that to work which will take longer than just searching for 120 natively
|
|
|
The kangaroo server is live! DP 25 and currently at DP 2^24.229/2^35.55. The server handles all user Kangaroo backups and work saves, join the discord for more information: https://discord.gg/DjMksx8wqrwe also need to have an open discussion on the best way to split the prize for all involved on the server.
|
|
|
https://discord.gg/hhCgsFRnFeel free to join, I will be pinning relevant files to topics, as well as attempting to keep a list of scanned ranges on all puzzles. I will be opening up a few more channels as people request them. Dev channels, places for new ideas to be discussed.
|
|
|
Kangrand uses a faster multiplication thats still safe, ive tested it on all known addresses on the puzzle list and it finds them much faster than the original JLP Kangaroo.
|
|
|
|