Bitcoin puzzle transaction ~32 BTC prize to who solves it

[MrlostinBTC]

Assuming

The creator made a wallet with random keys

When wallets are created they are always randomly generated keys. This is what makes them secure.

The creator then added zeros to the front of all those keys. Increasing in complexity each key after the previous key. Making them solvable.

I agree there's a pattern. But even distance from keys seems to shift at times.

[1714295996]

1714295996

[1714295996]

1714295996

[1714295996]

1714295996

[1714295996]

1714295996

[digaran]

And then there's the fact that all of the hex values (as strings, minus the leading zeros) all appear to be grouped into groups of 4 by character length...? (e.g. the first 4 hexes are all 1 character long, the next 4 are all 2 characters long, etc...)

This is a hex key, 0x1000000 , tell me how can you add or drop one 0 from it? By dividing it by 16 or multiplying it by 16, so if you want to increase the bit range/ difficulty, you'd have to do it every 4 keys, 4*4 = 16. This way you can make sure every key is in the right bit range.

The whole point of this multi million dollar puzzle is to have zero pattern, being completely random. As he stated that he didn't think of it as a puzzle, people did.

[citb0in]

@VHS/DVD/vhh, what is your academic background? Which university did you graduated from?
What is the UID of your main account? If you want answer, first respond to above questions, but I can tell you are one of the butthurt trolls.  I can tell because I never talked about multiplying two points(I only once said it's possible but never posted a script claiming it can do that).

@all of you whining kids, go find something which you can actually contribute to, all I see from you whiners, is whining.
@citb0in, 😂 you are still whining but silently with merits.
Or if you can't do that or don't understand how it could help you, stop hunting for puzzles.

your big-headed posturing, together with your studies, seems to be having no effect. We are still waiting for an answer from you, which you owe.

Disclaimer, I take no responsibility for any damages caused by my published studies, I am an independent researcher and publish my findings on public domain.  For transparency.

Can you point us to your published studies? I'm really curious and looking forward reading them.

@digaran: the question unfortunately is still unanswered. Can you point us to your studies, please?

worked for more than 25 years on EC

To better understand the claim and specific experience with elliptic curves, we can ask you about your work, projects, and expertise in this area. This will provide more context and clarity about the 25 years you are referring to.

Can you point us to your published studies? I'm really curious and looking forward reading them.

We are still waiting for your reply from the other day. 

[digaran]

Wasn't there a claim that experts have been working on ECC for 25 years? Yet I couldn't find a few things which I discovered by experiment in any book/ article.

Did I claim that I have solved DLP? No, you want my "studies"? You can hire me, I will bring at least 1 person with me for help, I strongly believe 1 year could be enough to either partially or totally break ECC, if God helps us.

The answer is in N, the group order.😉

[citb0in]

you claimed:

Disclaimer, I take no responsibility for any damages caused by my published studies, I am an independent researcher and publish my findings on public domain.  For transparency.

worked for more than 25 years on EC

I asked kindly for your studies:

Can you point us to your published studies? I'm really curious and looking forward reading them.

... you never replied to those questions and completely ignored them ...

@digaran: the question unfortunately is still unanswered. Can you point us to your studies, please?

..and still ignoring them

We are still waiting for your reply from the other day. 

so you owe an explanation. Where are your studies? If there are none, you obviously and unmistakably admit that only hot air comes out of your keyboard mouth. Empty assertions and showing off without foundation.

[AlanJohnson]

Wasn't there a claim that experts have been working on ECC for 25 years? Yet I couldn't find a few things which I discovered by experiment in any book/ article.

Did I claim that I have solved DLP? No, you want my "studies"? You can hire me, I will bring at least 1 person with me for help, I strongly believe 1 year could be enough to either partially or totally break ECC, if God helps us.

The answer is in N, the group order.😉

What a mythomaniac ...

[nomachine]

I mean, first of all, what kind of wallet software can you use to "randomly" generate 256 keys that are all perfectly spaced apart, with Log2 values that just happen to be exactly incremental by one each...?

Excellent questions for further thinking.
I really don't know what a special wallet it is. Maybe NSA’s chief of mathematics research wallet.  

As the creator said, you need to trim the high bytes of the key with zeros!

I think it's obvious that he has his own custom deterministic wallet. Based on an existing one or completely new one from scratch.

That said, I'm not sure it can sign a message with that tool.

Maybe. And it’s not even necessary, just add your own salt, and that will be enough - going over SEED will be useless.

Code:

string seed = Timer::getSeed(32);

//seed = "bla bla bla";// Mnemonic code words

string salt = "Bitcoin seed";// = "VanitySearch";
		
unsigned char hseed[64];

pbkdf2_hmac_sha512(hseed, 64, (const uint8_t *)seed.c_str(), seed.length(), 
(const uint8_t *)salt.c_str(), salt.length(), 
//2048);// 2048 rounds of hashing required by the BIP 39 Standard ???
//2048);// Used 2048 rounds ???
//0);// Used 0 rounds !!!
1024);// Electrum ?

If you use Mnemonic code words, that's where the problem arises.
All WIFs fall into 256 bits

Code:

import re, random, os, sys, binascii, hashlib, time, platform
from mnemonic import Mnemonic
import secp256k1 as ice
import multiprocessing

def PrivateKeyFromMnemonic(mnemonic_phrase):
    mne = Mnemonic("english")
    seed = mne.to_seed(mnemonic_phrase, passphrase="")
    private_key_bytes = hashlib.sha256(seed).digest()
    private_key_hex = binascii.hexlify(private_key_bytes).decode()
    private_key_int = int(private_key_hex, 16)
    compressAddress = ice.privatekey_to_address(0, True, private_key_int)
    UncompressAddress = ice.privatekey_to_address(0, False, private_key_int)
    return compressAddress, UncompressAddress, private_key_int

def GetMnemonic():
    list_word = []
    wordlist = "AbandonAbilityAbleAboutAboveAbsentAbsorbAbstractAbsurdAbuseAccessAccidentAccountAccuseAchieveAcidAcousticAcquireAcrossActActionActorActressActualAdaptAddAddictAddressAdjustAdmitAdultAdvanceAdviceAerobicAffairAffordAfraidAgainAgeAgentAgreeAheadAimAirAirportAisleAlarmAlbumAlcoholAlertAlienAllAlleyAllowAlmostAloneAlphaAlreadyAlsoAlterAlwaysAmateurAmazingAmongAmountAmusedAnalystAnchorAncientAngerAngleAngryAnimalAnkleAnnounceAnnualAnotherAnswerAntennaAntiqueAnxietyAnyApartApologyAppearAppleApproveAprilArchArcticAreaArenaArgueArmArmedArmorArmyAroundArrangeArrestArriveArrowArtArtefactArtistArtworkAskAspectAssaultAssetAssistAssumeAsthmaAthleteAtomAttackAttendAttitudeAttractAuctionAuditAugustAuntAuthorAutoAutumnAverageAvocadoAvoidAwakeAwareAwayAwesomeAwfulAwkwardAxisBabyBachelorBaconBadgeBagBalanceBalconyBallBambooBananaBannerBarBarelyBargainBarrelBaseBasicBasketBattleBeachBeanBeautyBecauseBecomeBeefBeforeBeginBehaveBehindBelieveBelowBeltBenchBenefitBestBetrayBetterBetweenBeyondBicycleBidBikeBindBiologyBirdBirthBitterBlackBladeBlameBlanketBlastBleakBlessBlindBloodBlossomBlouseBlueBlurBlushBoardBoatBodyBoilBombBoneBonusBookBoostBorderBoringBorrowBossBottomBounceBoxBoyBracketBrainBrandBrassBraveBreadBreezeBrickBridgeBriefBrightBringBriskBroccoliBrokenBronzeBroomBrotherBrownBrushBubbleBuddyBudgetBuffaloBuildBulbBulkBulletBundleBunkerBurdenBurgerBurstBusBusinessBusyButterBuyerBuzzCabbageCabinCableCactusCageCakeCallCalmCameraCampCanCanalCancelCandyCannonCanoeCanvasCanyonCapableCapitalCaptainCarCarbonCardCargoCarpetCarryCartCaseCashCasinoCastleCasualCatCatalogCatchCategoryCattleCaughtCauseCautionCaveCeilingCeleryCementCensusCenturyCerealCertainChairChalkChampionChangeChaosChapterChargeChaseChatCheapCheckCheeseChefCherryChestChickenChiefChildChimneyChoiceChooseChronicChuckleChunkChurnCigarCinnamonCircleCitizenCityCivilClaimClapClarifyClawClayCleanClerkCleverClickClientCliffClimbClinicClipClockClogCloseClothCloudClownClubClumpClusterClutchCoachCoastCoconutCodeCoffeeCoilCoinCollectColorColumnCombineComeComfortComicCommonCompanyConcertConductConfirmCongressConnectConsiderControlConvinceCookCoolCopperCopyCoralCoreCornCorrectCostCottonCouchCountryCoupleCourseCousinCoverCoyoteCrackCradleCraftCramCraneCrashCraterCrawlCrazyCreamCreditCreekCrewCricketCrimeCrispCriticCropCrossCrouchCrowdCrucialCruelCruiseCrumbleCrunchCrushCryCrystalCubeCultureCupCupboardCuriousCurrentCurtainCurveCushionCustomCuteCycleDadDamageDampDanceDangerDaringDashDaughterDawnDayDealDebateDebrisDecadeDecemberDecideDeclineDecorateDecreaseDeerDefenseDefineDefyDegreeDelayDeliverDemandDemiseDenialDentistDenyDepartDependDepositDepthDeputyDeriveDescribeDesertDesignDeskDespairDestroyDetailDetectDevelopDeviceDevoteDiagramDialDiamondDiaryDiceDieselDietDifferDigitalDignityDilemmaDinnerDinosaurDirectDirtDisagreeDiscoverDiseaseDishDismissDisorderDisplayDistanceDivertDivideDivorceDizzyDoctorDocumentDogDollDolphinDomainDonateDonkeyDonorDoorDoseDoubleDoveDraftDragonDramaDrasticDrawDreamDressDriftDrillDrinkDripDriveDropDrumDryDuckDumbDuneDuringDustDutchDutyDwarfDynamicEagerEagleEarlyEarnEarthEasilyEastEasyEchoEcologyEconomyEdgeEditEducateEffortEggEightEitherElbowElderElectricElegantElementElephantElevatorEliteElseEmbarkEmbodyEmbraceEmergeEmotionEmployEmpowerEmptyEnableEnactEndEndlessEndorseEnemyEnergyEnforceEngageEngineEnhanceEnjoyEnlistEnoughEnrichEnrollEnsureEnterEntireEntryEnvelopeEpisodeEqualEquipEraEraseErodeErosionErrorEruptEscapeEssayEssenceEstateEternalEthicsEvidenceEvilEvokeEvolveExactExampleExcessExchangeExciteExcludeExcuseExecuteExerciseExhaustExhibitExileExistExitExoticExpandExpectExpireExplainExposeExpressExtendExtraEyeEyebrowFabricFaceFacultyFadeFaintFaithFallFalseFameFamilyFamousFanFancyFantasyFarmFashionFatFatalFatherFatigueFaultFavoriteFeatureFebruaryFederalFeeFeedFeelFemaleFenceFestivalFetchFeverFewFiberFictionFieldFigureFileFilmFilterFinalFindFineFingerFinishFireFirmFirstFiscalFishFitFitnessFixFlagFlameFlashFlatFlavorFleeFlightFlipFloatFlockFloorFlowerFluidFlushFlyFoamFocusFogFoilFoldFollowFoodFootForceForestForgetForkFortuneForumForwardFossilFosterFoundFoxFragileFrameFrequentFreshFriendFringeFrogFrontFrostFrownFrozenFruitFuelFunFunnyFurnaceFuryFutureGadgetGainGalaxyGalleryGameGapGarageGarbageGardenGarlicGarmentGasGaspGateGatherGaugeGazeGeneralGeniusGenreGentleGenuineGestureGhostGiantGiftGiggleGingerGiraffeGirlGiveGladGlanceGlareGlassGlideGlimpseGlobeGloomGloryGloveGlowGlueGoatGoddessGoldGoodGooseGorillaGospelGossipGovernGownGrabGraceGrainGrantGrapeGrassGravityGreatGreenGridGriefGritGroceryGroupGrowGruntGuardGuessGuideGuiltGuitarGunGymHabitHairHalfHammerHamsterHandHappyHarborHardHarshHarvestHatHaveHawkHazardHeadHealthHeartHeavyHedgehogHeightHelloHelmetHelpHenHeroHiddenHighHillHintHipHireHistoryHobbyHockeyHoldHoleHolidayHollowHomeHoneyHoodHopeHornHorrorHorseHospitalHostHotelHourHoverHubHugeHumanHumbleHumorHundredHungryHuntHurdleHurryHurtHusbandHybridIceIconIdeaIdentifyIdleIgnoreIllIllegalIllnessImageImitateImmenseImmuneImpactImposeImproveImpulseInchIncludeIncomeIncreaseIndexIndicateIndoorIndustryInfantInflictInformInhaleInheritInitialInjectInjuryInmateInnerInnocentInputInquiryInsaneInsectInsideInspireInstallIntactInterestIntoInvestInviteInvolveIronIslandIsolateIssueItemIvoryJacketJaguarJarJazzJealousJeansJellyJewelJobJoinJokeJourneyJoyJudgeJuiceJumpJungleJuniorJunkJustKangarooKeenKeepKetchupKeyKickKidKidneyKindKingdomKissKitKitchenKiteKittenKiwiKneeKnifeKnockKnowLabLabelLaborLadderLadyLakeLampLanguageLaptopLargeLaterLatinLaughLaundryLavaLawLawnLawsuitLayerLazyLeaderLeafLearnLeaveLectureLeftLegLegalLegendLeisureLemonLendLengthLensLeopardLessonLetterLevelLiarLibertyLibraryLicenseLifeLiftLightLikeLimbLimitLinkLionLiquidListLittleLiveLizardLoadLoanLobsterLocalLockLogicLonelyLongLoopLotteryLoudLoungeLoveLoyalLuckyLuggageLumberLunarLunchLuxuryLyricsMachineMadMagicMagnetMaidMailMainMajorMakeMammalManManageMandateMangoMansionManualMapleMarbleMarchMarginMarineMarketMarriageMaskMassMasterMatchMaterialMathMatrixMatterMaximumMazeMeadowMeanMeasureMeatMechanicMedalMediaMelodyMeltMemberMemoryMentionMenuMercyMergeMeritMerryMeshMessageMetalMethodMiddleMidnightMilkMillionMimicMindMinimumMinorMinuteMiracleMirrorMiseryMissMistakeMixMixedMixtureMobileModelModifyMomMomentMonitorMonkeyMonsterMonthMoonMoralMoreMorningMosquitoMotherMotionMotorMountainMouseMoveMovieMuchMuffinMuleMultiplyMuscleMuseumMushroomMusicMustMutualMyselfMysteryMythNaiveNameNapkinNarrowNastyNationNatureNearNeckNeedNegativeNeglectNeitherNephewNerveNestNetNetworkNeutralNeverNewsNextNiceNightNobleNoiseNomineeNoodleNormalNorthNoseNotableNoteNothingNoticeNovelNowNuclearNumberNurseNutOakObeyObjectObligeObscureObserveObtainObviousOccurOceanOctoberOdorOffOfferOfficeOftenOilOkayOldOliveOlympicOmitOnceOneOnionOnlineOnlyOpenOperaOpinionOpposeOptionOrangeOrbitOrchardOrderOrdinaryOrganOrientOriginalOrphanOstrichOtherOutdoorOuterOutputOutsideOvalOvenOverOwnOwnerOxygenOysterOzonePactPaddlePagePairPalacePalmPandaPanelPanicPantherPaperParadeParentParkParrotPartyPassPatchPathPatientPatrolPatternPausePavePaymentPeacePeanutPearPeasantPelicanPenPenaltyPencilPeoplePepperPerfectPermitPersonPetPhonePhotoPhrasePhysicalPianoPicnicPicturePiecePigPigeonPillPilotPinkPioneerPipePistolPitchPizzaPlacePlanetPlasticPlatePlayPleasePledgePluckPlugPlungePoemPoetPointPolarPolePolicePondPonyPoolPopularPortionPositionPossiblePostPotatoPotteryPovertyPowderPowerPracticePraisePredictPreferPreparePresentPrettyPreventPricePridePrimaryPrintPriorityPrisonPrivatePrizeProblemProcessProduceProfitProgramProjectPromoteProofPropertyProsperProtectProudProvidePublicPuddingPullPulpPulsePumpkinPunchPupilPuppyPurchasePurityPurposePursePushPutPuzzlePyramidQualityQuantumQuarterQuestionQuickQuitQuizQuoteRabbitRaccoonRaceRackRadarRadioRailRainRaiseRallyRampRanchRandomRangeRapidRareRateRatherRavenRawRazorReadyRealReasonRebelRebuildRecallReceiveRecipeRecordRecycleReduceReflectReformRefuseRegionRegretRegularRejectRelaxReleaseReliefRelyRemainRememberRemindRemoveRenderRenewRentReopenRepairRepeatReplaceReportRequireRescueResembleResistResourceResponseResultRetireRetreatReturnReunionRevealReviewRewardRhythmRibRibbonRiceRichRideRidgeRifleRightRigidRingRiotRippleRiskRitualRivalRiverRoadRoastRobotRobustRocketRomanceRoofRookieRoomRoseRotateRoughRoundRouteRoyalRubberRudeRugRuleRunRunwayRuralSadSaddleSadnessSafeSailSaladSalmonSalonSaltSaluteSameSampleSandSatisfySatoshiSauceSausageSaveSayScaleScanScareScatterSceneSchemeSchoolScienceScissorsScorpionScoutScrapScreenScriptScrubSeaSearchSeasonSeatSecondSecretSectionSecuritySeedSeekSegmentSelectSellSeminarSeniorSenseSentenceSeriesServiceSessionSettleSetupSevenShadowShaftShallowShareShedShellSheriffShieldShiftShineShipShiverShockShoeShootShopShortShoulderShoveShrimpShrugShuffleShySiblingSickSideSiegeSightSignSilentSilkSillySilverSimilarSimpleSinceSingSirenSisterSituateSixSizeSkateSketchSkiSkillSkinSkirtSkullSlabSlamSleepSlenderSliceSlideSlightSlimSloganSlotSlowSlushSmallSmartSmileSmokeSmoothSnackSnakeSnapSniffSnowSoapSoccerSocialSockSodaSoftSolarSoldierSolidSolutionSolveSomeoneSongSoonSorrySortSoulSoundSoupSourceSouthSpaceSpareSpatialSpawnSpeakSpecialSpeedSpellSpendSphereSpiceSpiderSpikeSpinSpiritSplitSpoilSponsorSpoonSportSpotSpraySpreadSpringSpySquareSqueezeSquirrelStableStadiumStaffStageStairsStampStandStartStateStaySteakSteelStemStepStereoStickStillStingStockStomachStoneStoolStoryStoveStrategyStreetStrikeStrongStruggleStudentStuffStumbleStyleSubjectSubmitSubwaySuccessSuchSuddenSufferSugarSuggestSuitSummerSunSunnySunsetSuperSupplySupremeSureSurfaceSurgeSurpriseSurroundSurveySuspectSustainSwallowSwampSwapSwarmSwearSweetSwiftSwimSwingSwitchSwordSymbolSymptomSyrupSystemTableTackleTagTailTalentTalkTankTapeTargetTaskTasteTattooTaxiTeachTeamTellTenTenantTennisTentTermTestTextThankThatThemeThenTheoryThereTheyThingThisThoughtThreeThriveThrowThumbThunderTicketTideTigerTiltTimberTimeTinyTipTiredTissueTitleToastTobaccoTodayToddlerToeTogetherToiletTokenTomatoTomorrowToneTongueTonightToolToothTopTopicToppleTorchTornadoTortoiseTossTotalTouristTowardTowerTownToyTrackTradeTrafficTragicTrainTransferTrapTrashTravelTrayTreatTreeTrendTrialTribeTrickTriggerTrimTripTrophyTroubleTruckTrueTrulyTrumpetTrustTruthTryTubeTuitionTumbleTunaTunnelTurkeyTurnTurtleTwelveTwentyTwiceTwinTwistTwoTypeTypicalUglyUmbrellaUnableUnawareUncleUncoverUnderUndoUnfairUnfoldUnhappyUniformUniqueUnitUniverseUnknownUnlockUntilUnusualUnveilUpdateUpgradeUpholdUponUpperUpsetUrbanUrgeUsageUseUsedUsefulUselessUsualUtilityVacantVacuumVagueValidValleyValveVanVanishVaporVariousVastVaultVehicleVelvetVendorVentureVenueVerbVerifyVersionVeryVesselVeteranViableVibrantViciousVictoryVideoViewVillageVintageViolinVirtualVirusVisaVisitVisualVitalVividVocalVoiceVoidVolcanoVolumeVoteVoyageWageWagonWaitWalkWallWalnutWantWarfareWarmWarriorWashWaspWasteWaterWaveWayWealthWeaponWearWeaselWeatherWebWeddingWeekendWeirdWelcomeWestWetWhaleWhatWheatWheelWhenWhereWhipWhisperWideWidthWifeWildWillWinWindowWineWingWinkWinnerWinterWireWisdomWiseWishWitnessWolfWomanWonderWoodWoolWordWorkWorldWorryWorthWrapWreckWrestleWristWriteWrongYardYearYellowYouYoungYouthZebraZeroZoneZoo"
    words = re.findall('[A-Z][a-z]+', wordlist)
    for i in range(2048):
        word_C = words[i]
        list_word.append(word_C)
    word1 = random.choice(list_word)
    word2 = random.choice(list_word)
    word3 = random.choice(list_word)
    word4 = random.choice(list_word)
    word5 = random.choice(list_word)
    word6 = random.choice(list_word)
    word7 = random.choice(list_word)
    word8 = random.choice(list_word)
    word9 = random.choice(list_word)
    word10 = random.choice(list_word)
    word11 = random.choice(list_word)
    word12 = random.choice(list_word)
    return f"{word1} {word2} {word3} {word4} {word5} {word6} {word7} {word8} {word9} {word10} {word11} {word12}"

rl = [line.strip() for line in open('go.txt').readlines()]
richList = set(rl)

def check_private_key(richList, STOP_EVENT):
    while not STOP_EVENT.is_set():
        wod = GetMnemonic()
        compressAddress, UncompressAddress, PrivateKey = PrivateKeyFromMnemonic(wod)
        message = "\r[+] {} ".format(compressAddress) 
        messages = []
        messages.append(message)
        output = "\033[01;33m" + ''.join(messages) + "\r"
        sys.stdout.write(output)
        sys.stdout.flush()
        if compressAddress in richList or UncompressAddress in richList:
            with open("KEYFOUNDKEYFOUND.txt", "a") as f:
                f.write(f'COMPRESSED: {compressAddress}\n')
                f.write(f'UNCOMPRESSED: {UncompressAddress}\n')
                f.write(f'PRIVATEKEY: {PrivateKey}\n')
                f.write(f'Mnemonic: {wod}\n')
                f.write('-----------------------------------------------------------------------------------------------------------\n')

            STOP_EVENT.set()
            sys.stdout.write("\033[?25h")
            sys.stdout.flush()
            return

if __name__ == '__main__':
    if 'win' in platform.platform() or 'Windows' in platform.platform():
        os.system('cls')
    elif 'linux' or 'Linux' in platform.platform():
        os.system('clear')
    t = time.ctime()
    sys.stdout.write(f"\033[01;33m[+] {t}\n")
    STOP_EVENT = multiprocessing.Event()
    num_processes = multiprocessing.cpu_count()  # Number of CPU cores

    processes = []
    for _ in range(num_processes):
        process = multiprocessing.Process(target=check_private_key, args=(richList, STOP_EVENT))
        processes.append(process)
        process.start()

    for process in processes:
        process.join()

The results are all of this length.

• 89754425042582330695652602694071763691823510269073462781416259935330261521348

[digaran]

Where are your studies?

[elvis13]

Such as  DIGARAN increases interest in hacking bitcoin. There is an illusion that anyone can solve the puzzle .
 DIGARAN  useful idiot, for the creator of the puzzle, because the interest in hacking began to fade.

[nomachine]

the interest in hacking began to fade

This is all a conspiracy from the beginning, isn't it?   

[digaran]

There is an illusion that anyone can solve the puzzle 32.

*There is no illusion, here puzzle 32 is already solved:
0xB862A62E
My man Elvis, I see you have grown a pair, good for you.
Remember nobody is going to solve them for you, and honestly, I am an idiot trying to help you here, from now on, you will see less posts of mine on this thread.
Keep up your good work, you can do this, you can solve any key as long as you have the private key. Lol
*= what did you expect? I'm an idiot, remember? 😅

[albert0bsd]

so you owe an explanation. Where are your studies? If there are none, you obviously and unmistakably admit that only hot air comes out of your keyboard mouth. Empty assertions and showing off without foundation.

@citb0in digaran didn't read Mastering Bitcoin he mistaken the book for Mastering Trolling, How to divert topics and get paid by bitcointalk campaings 

TBH it is kinda funny, in a few times he reply some good answer

[elvis13]

DIGARAN
Your messages don't bother me.

[alek76]

Keep up your good work, you can do this, you can solve any key as long as you have the private key. Lol

Some of your posts are interesting. Thank you.
And when the time comes, you begin to understand that you can spend it on learning C++ or on useless messages? I continue to develop my old program, which I started in 2020. I initially saved all DP data to a file. It takes a long time to open the file and write. Now I will add a Hash table for temporary aggregation of selected points and their subsequent recording to a file - this is faster. My saved data is 256 bits in size. I also save the working kangaroos to another file. For those interested, the function for loading and unloading a herd of kangaroos is in the backup.cpp file. https://github.com/alek76-2/vs-kangaroo-multi/blob/master/Backup.cpp
Can be used. I will not publish other functions, at least for now, for obvious reasons. But if you want to solve 130, you'll have to rewrite Jean-Luc program because it has limitations. And not only in the GPU code, but also in the size of the data in the table itself. It’s not just that, having computing resources, download the finished code and solve 130. It’s even pleasing. Those who have resources have no knowledge. And those who have knowledge do not have resources.
I don’t know, I achieved a speed of 520 Mkeys - this is with writing to a table, reading from a table and writing to files, and at the same time checking to find a solution. And added loading the herd from the file - when restarting. I’m still writing the code, even if I’m unlucky in solving the problem. And still. Everyone complains about the amount of energy wasted, but have you ever analyzed someone else's program code? To avoid wasting money...

./vs-kangaroo-multi -dp 16 -gpu -bits 64 03100611c54dfef604163b8358f7b7fac13ce478e02cb224ae16d45526b25d9d4d

Code:

The forked software created 29.10.2023 by Alek-76 fixed modify v0.16 ...
make: warning:  Clock skew detected.  Your build may be incomplete.
[###########################################################]
[#          Pollard-kangaroo PrivKey Recovery Tool         #]
[#          (based on engine of VanitySearch 1.19)         #]
[#                 bitcoin ecdsa secp256k1                 #]
[#          ver. 0.16                                      #]
[#          GPU implementation changes by Alek76           #]
[#          Tips: 1NULY7DhzuNvSDtPkFzNo6oRTZQWBqXNE9       #]
[###########################################################]
[DATE(utc)] 29 Oct 2023 12:34:37
[~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~]
[pow2bits]	64
[Wsqrt] (2^31) 100000000
[M] C000000000000000
[~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~]
[i] Used OpenSSL Random number generator 
[i] OpenSSL 3.0.2 15 Mar 2022 (Library: OpenSSL 3.0.2 15 Mar 2022)
[~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~]
[rangeW]	2^63..2^64 ; W = U - L = 2^63
[DPsize]	1048576 (hashtable size)
[~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~]
[pubkey#64] loaded
[Xcoordinate] 100611C54DFEF604163B8358F7B7FAC13CE478E02CB224AE16D45526B25D9D4D
[Ycoordinate] 5127C2D0B1C4A4D5B4996BBDF37633B86901D0303B61E2F6F0772282AE08FF95
[~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~]
[+] Sp-table of pow2 points - ready 
[~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~]
[UV] U*V=0*0=0 (0x00)
[i] Old DPmodule: 2^29 
[i] New DPmodule: 2^24 
[+] 0T+0W kangaroos - ready
[CPU] threads: 0 
[GPU] threads: 1 Hang on to your hats... ;-)
[i] Used Comparator in Python
===========================================================================
by Pollard (.. The best choice of m (mean jump size: 2^32) is w^(1/2)/2 ..) 
[i] Used Mixed 16 Jump Table: G,2G,4G,8G,16G,...,Rand(2^pow2Wsqrt+1)
Create Jump Table (size: 16) Max Jump: 2^33 
Jump Avg distance: 2^31.04 (+/- use option -p)
===========================================================================
GPUEngine: Fixed DPmodule = 2^16 
GPUEngine: Total kangaroos and their close relatives 1310720 ;-)
GPUEngine: Fixed DPmodule: 0x10000 2^16 Hop_modulo: 32 Power: 0 
GPUEngine: Stack Size: 1024
GPUEngine:  Heap Size: 8388608
GPU GPU #0 Tesla T4 (40x64 cores) Grid(80x128) (129.0 MB used; GRP size: 128; nbSpin: 256) 

[i] GPU TameStartingKey: C000000000000000
GPU thId: 128 GPU bnL: 64 
GPU Tame Points: [M] + Rand(pow2W)
GPU Wild Points: [Target] + Rand(pow2W)
GPU Wild Starting Key 0: 4243657DAD16D786 
GPU Tame Starting Key 1: 12318636040F76DBF 
GPU Wild Starting Key 2: 5D33C0C3E0BBEACD 
GPU Tame Starting Key 3: 12821E106B999205E 
GPU Wild Starting Key 4: B2905822AFDE251 
GPU Tame Starting Key 5: C14C17F1ADF64974 
GPU Wild Starting Key 6: 27ABF855C19AFB16 
GPU Tame Starting Key 7: 1148E716BA44257DB 
GPU Wild Starting Key 8: 375F3D5C55AFDF84 
GPU Tame Starting Key 9: DF8E0EA7009CA26F 
GPU Tame Starting Key 1300480: E191DA8F160EC93C Kangaroos: 1310720 
NB Thread: 10240 , GPU_GRP_SIZE: 128 
[+] Runing Comparator every: 30 sec

Python Comparator time: 1256.725 msec 
[\][  0: 0:34 ; 566.1M j/s; [GPU 566.12 Mj/s]  18.0Gj 437.5%; dp/kgr=0.0;  0: 0: 0 ]  
Python Comparator time: 3188.568 msec 
[-][  0: 1: 4 ; 524.2M j/s; [GPU 524.20 Mj/s]  34.0Gj 812.5%; dp/kgr=0.0;  0: 0: 0 ]  

SOLVED: 0xf7051f27b09112d4

  Tips: 1NULY7DhzuNvSDtPkFzNo6oRTZQWBqXNE9 

[\][  0: 1: 6 ; 524.2M j/s; [GPU 524.20 Mj/s]  35.0Gj 835.9%; dp/kgr=0.0;  0: 0: 0 ]  
[i] No Cleaning wild and tame files 

SOLVED: 0xf7051f27b09112d4

  Tips: 1NULY7DhzuNvSDtPkFzNo6oRTZQWBqXNE9 

[i] 550.9M j/s;  36.0Gj of   4.0Gj 859.4%; DP 0T+0W=0+0=0; dp/kgr=0.0;
[runtime]   0: 1: 7 
[~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~]
[DATE(utc)] 29 Oct 2023 12:36:07
[~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~]
[x] EXIT

I don't know why the Jean-Luc Pons program checks for collision distance. It is necessary to check the coincidence of X coordinates.

[digaran]

so you owe an explanation. Where are your studies? If there are none, you obviously and unmistakably admit that only hot air comes out of your keyboard mouth. Empty assertions and showing off without foundation.

@citb0in digaran didn't read Mastering Bitcoin he mistaken the book for Mastering Trolling, How to divert topics and get paid by bitcointalk campaings 

TBH it is kinda funny, in a few times he reply some good answer

I wonder, did you buy the laptop you promised to buy and work on GPU version of your tool? If yes can you link to it?
Since we all getting paid here by posting, is there any one who is also getting paid who can shed light on this key?

Code:

0000000000000000000000000000000ebaaedce6af48a03bbfd25e8cd0364141

Note, if you guys have difficulty reading my post where I mentioned 25 years, either use a translation tool or reread it, so you don't come here looking like an idiot just because you didn't read carefully.

In case you are wondering what that key does, figure it out yourself, if you don't know anything useful, keep your nonsense spam to yourself.
While my goal here is to make sure a long lasting and fully secure Bitcoin, some of you are only here to line your pockets, and you would empty any address you come across, so this ad hominem and ad nauseam tactics don't work on me.

Also can you show me a post where I claimed to be an expert in cryptography/mathematics? If you can't, it'd be better to report my posts as suggested earlier. Meaning, stop your bs.
On a side note, I take back what I said about not posting here, I will scratch that and continue posting here, if you have a problem, open your own topic to discuss your plans about emptying people's addresses.

[WanderingPhilospher]

On a side note, I take back what I said about not posting here, I will scratch that and continue posting here, if you have a problem, open your own topic to discuss your plans about emptying people's addresses.

This isn’t your topic; you did not start this topic so maybe keep all of your confusing, showing nothing, posts on a topic you did start. That sounds fair.

Hopefully no one takes what you say so seriously, I mostly laugh when you talk about expert, published studies, etc., as you joking, being facetious.

But to any newbie trying to learn or figure something out, your posts on div sub add, do you see it, are really not helping anyone. You give no concrete examples to what you’re doing and what you found out. Those are the posts that do not help this topic’s members.

[WanderingPhilospher]

I don’t know, I achieved a speed of 520 Mkeys - this is with writing to a table, reading from a table and writing to files, and at the same time checking to find a solution.

Alek, as someone who is extremely familiar with your program, and have modified it over the years, it is a lot slower than JLPs, but it has certain benefits that I like, such as saving points to a text file.

Possible ways to speed up your code; drop the modulo function to check for DPs and just use a mask like JLPs code. That may provide a speed up and also cause less erroneous points; these erroneous points happen a lot once the GPU has ran for hours.

I’ll have to look at your updated code sometime in the near future to see all of your changes.

But your Kangaroo GPU was the first & a trendsetter!

[albert0bsd]

I wonder, did you buy the laptop you promised to buy and work on GPU version of your tool? If yes can you link to it?

I am still learning to code for GPU, guys it is not so easy as you think.

Since we all getting paid here by posting, is there any one who is also getting paid who can shed light on this key?

Code:

0000000000000000000000000000000ebaaedce6af48a03bbfd25e8cd0364141

No big mistery of that:

FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141

[digaran]

No big mistery of that:

FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141

Ok, do you know how we can shift the place of bolded part? To make it look like this:


EBAAEDCE6AF48A03BBFD25E8CD0364141FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF

Or even better, imagine this is target :

0x0000000000000000000000000000000000000000000000000000000001234567

Now how can we make it look like this:

FFFFFFFFFFFFFFFFFFFFFFFF1234567EBAAEDCE6AF48A03BBFD25E8CD0364141
Edit: people will love you when you play dumb, you see how their tone changed after I asked a stupid question?

[alek76]

I don’t know, I achieved a speed of 520 Mkeys - this is with writing to a table, reading from a table and writing to files, and at the same time checking to find a solution.

Alek, as someone who is extremely familiar with your program, and have modified it over the years, it is a lot slower than JLPs, but it has certain benefits that I like, such as saving points to a text file.

Possible ways to speed up your code; drop the modulo function to check for DPs and just use a mask like JLPs code. That may provide a speed up and also cause less erroneous points; these erroneous points happen a lot once the GPU has ran for hours.

I’ll have to look at your updated code sometime in the near future to see all of your changes.

But your Kangaroo GPU was the first & a trendsetter!

if (px[g][0] % DPmod == 0) { //   If you mean this?

1. I think that this is precisely the correct meaning. Yes, I tried using a mask (bitwise & operation) - it doesn't provide much of a speed benefit. Another mask is inverted and the "&" operation can add unnecessary points to the table. DP must be selected modulo!!!
2. The only problem is the time it takes to open a large file to write one line. That's why everything was so slow. With a table, even just with an Int *var array, everything happens much faster. I accumulated 1024 points, opened the file and wrote it down, and so on in a circle. There you just need to add a counter and conditions, rewrite the File2save() function. But I have already rewritten it, which I advise you to do as well. I agree this will take some time. Github has not been updated.
After these changes, the speed increased.
3. The periods for preserving the working herd of kangaroos are set once every 10 minutes. Flags are set based on the timer, and based on the presence of flags, data from the GPU is uploaded to the array. Next, they are written from the array to the work file. Function SaveWorkKangaroosToFile(). And when the program is restarted, on the contrary, the start keys are not generated, but are unloaded from the file. Function LoadWorkKangaroosFromFile().
4. Text files provide an advantage, since you do not need to process a large table with data every time. The table is cleared - this is also time. And the array can simply be rewritten. There is a difference? I saved a small file and spat it out to the server via a socket.
That's all. And on the server there is a comparator that also runs on a timer.
It seems like I've already told you a lot. Write the code - add it.
I can tell you a secret that errors appear after several hours of work not because of the bit operation "%". They appear due to arbitrary data that initially hangs in the most significant bits. bits64[4] is more than 256 bits of data. Before putting data into the GPU, you need to check it. Declaring an Int while simultaneously assigning a value from another Int variable does not clear the high-order bits. This is the second time I’ve repeated myself and repeated myself. Int is first declared and then assigned a value. The .Set() operation does not clear the high-order bits.
The SetInt32() and Rand() function clears. I say analyze the code. Even I, 3 years ago, did not have such care in the code. Everything should be fine now 
This could be your errors in the GPU or due to data overflow. No need to overload the GPU. Set GRP SIZE 64. The physical memory may also be bad - the memory chip itself ( or 1 of 8 ) . And so everything should be clean.