Author

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

copper member
Activity: 1330
Merit: 899
🖤😏
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  Roll Eyes Roll Eyes

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.
member
Activity: 93
Merit: 16
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.
newbie
Activity: 26
Merit: 2
DIGARAN
Your messages don't bother me.
hero member
Activity: 862
Merit: 662
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  Roll Eyes Roll Eyes

TBH it is kinda funny, in a few times he reply some good answer
copper member
Activity: 1330
Merit: 899
🖤😏
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? 😅
member
Activity: 462
Merit: 24
the interest in hacking began to fade

This is all a conspiracy from the beginning, isn't it?    Grin
newbie
Activity: 26
Merit: 2
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.

copper member
Activity: 1330
Merit: 899
🖤😏
member
Activity: 462
Merit: 24
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.  Grin

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
member
Activity: 122
Merit: 11
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 ...
hero member
Activity: 630
Merit: 731
Bitcoin g33k
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.  Grin

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.

copper member
Activity: 1330
Merit: 899
🖤😏
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.😉
hero member
Activity: 630
Merit: 731
Bitcoin g33k
@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.  Grin

copper member
Activity: 1330
Merit: 899
🖤😏

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.
jr. member
Activity: 50
Merit: 30
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.
newbie
Activity: 7
Merit: 0
This puzzle is very strange. If it's for measuring the world's brute forcing capacity, 161-256 are just a waste (RIPEMD160 entropy is filled by 160, and by all of P2PKH Bitcoin). The puzzle creator could improve the puzzle's utility without bringing in any extra funds from outside - just spend 161-256 across to the unsolved portion 51-160, and roughly treble the puzzle's content density.

If on the other hand there's a pattern to find... well... that's awfully open-ended... can we have a hint or two? Cheesy

I am the creator.

You are quite right, 161-256 are silly.  I honestly just did not think of this.  What is especially embarrassing, is this did not occur to me once, in two years.  By way of excuse, I was not really thinking much about the puzzle at all.

I will make up for two years of stupidity.  I will spend from 161-256 to the unsolved parts, as you suggest.  In addition, I intend to add further funds.  My aim is to boost the density by a factor of 10, from 0.001*length(key) to 0.01*length(key).  Probably in the next few weeks.  At any rate, when I next have an extended period of quiet and calm, to construct the new transaction carefully.

A few words about the puzzle.  There is no pattern.  It is just consecutive keys from a deterministic wallet (masked with leading 000...0001 to set difficulty).  It is simply a crude measuring instrument, of the cracking strength of the community.

Finally, I wish to express appreciation of the efforts of all developers of new cracking tools and technology.  The "large bitcoin collider" is especially innovative and interesting!

Ok, so, I'm really hoping someone can help me out here...

I just learned about this puzzle a few weeks ago, and have since been writing scripts to try and find as much of the "pattern" used to generate these keys as possible, because I was convinced (mainly by this post at first) that there must've been a pattern, given the seemingly perfect incremental nature of the Log2 of each known private key (if you look at the whole number part, ignoring the decimal place)... And also, I think I was influenced by the fact that this is called a puzzle, and a puzzle is supposed to have, you know, clues and things that help you solve it, or at least a logic to it that is "figure-out-able"... But I digress...

Fast forward to yesterday, when I stumbled across the above post... If we assume this person is telling the truth, that they are "the creator" of this puzzle[1], and that "there is no pattern", and that they simply used "a deterministic wallet" to generate "consecutive keys"... Well, then, I'm stumped...

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...? Unless it's a total coincidence that, so far, all the solved keys just happen to have incremental Log2 values, and we'll eventually solve a key that doesn't...? (one which is either a duplicate of the previous one, or skips one whole number entirely, etc)

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...)

I mean, am I wrong that it doesn't seem to me like math with no pattern whatsoever would just happen to work-out that way? Are these "patterns" that I think I'm seeing really more coincidental (and not purposeful) as I imagine them to be? Or is this actually all an artifact of the cryptographic process and the math that powers Bitcoin...? That for Bitcoin to work properly, there is, in fact, some amount of pattern in the chaos?

I'm much more likely to believe that these keys were actually generated by a script (or some process of some sort) written/designed by the person who created this, and that even if they didn't intend for there to be a pattern, there is one[2], and so maybe there's more to it that can still be discovered, to help lower the search space of each key even more that we already have... But maybe I only think that because I want there to be a way to solve a puzzle that doesn't actually contain any clues, or have any internal logic, and must simply be brute-forced, a feat that even the LBC has struggled to make very much progress towards...

So, help me out here, what do you think? Are these "patterns" that seem to be "clues" really either just coincidence, or artifacts of the formula and algorithms powering the system...? Or are they real patterns injected by the human who created this puzzle (intentionally or not), and could there be something else in the data that we just haven't noticed yet?

And maybe more importantly, what does a process for generating a puzzle like this even look like? Can you really ask a wallet software for 256 random but evenly spaced private keys, or would you have to script some amount of the process? I feel like if I can reverse engineer the creation process from the currently known data/results, it could help me figure-out if there's more to the pattern, or no pattern at all...

Huh

[1] A claim seemingly verified by the fact that the funds did actually move from the higher wallets to the lower unsolved wallets a few months later... Though of course that doesn't prove that they're the person who actually moved them, but then why would the real creator give this person credibility by doing for them what they promised us they'd do...?

[2] If only because people are known to be inherently bad at creating real randomness, and often inject patterns into things they make...
copper member
Activity: 1330
Merit: 899
🖤😏


You want a quite  place to think and work?
You think you have seen off topic, spam?
You think someone is trolling, harassing forum members?
The third option is not a presidential order, is my suggestion, visit trust page and tag in red color.

@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.

I don't know how else I put it, WHATEVER definitive results you can get when working with scalars, applies to points as  well. WHEN, you work with scalars, change the last digit from 1 to 9, see what changes in the results of division, divide by e.g, 256 and see what changes in the result, divide your target by 256, divide x2 of target by 256, divide half of target by 256, divide 1/16 of target by 256.

When you are done, go back to step 1, and this time change the last digit, do all the previous steps, rinse and repeat.

Or if you can't do that or don't understand how it could help you, stop hunting for puzzles.
member
Activity: 122
Merit: 11

YES YOU ALWAYS HAVE AN IDEA THATS A BIG PROBLEME MEN we understand nothing from your maths and non sense codes you are doing nothing,
you want to substract ? https://github.com/WanderingPhilosopher/Windows-KeySubtractor
yes use keysubstractor this program is have all you can sub anypub key to whatever range you want, you cant substract pk to a know point because you already dont know the pk, there is no way here to do something to the puzzle you have tools just search please and never post anything here you are talking nothing here except this thread become big with your replys and non sense maths.


im asking the MODERATOR to mute The user DIGARAN.


Maybe we should take it as a warning sign.  If you think too much about puzzles you can go mental Smiley

He is the first victim of bitcoin puzzle.
member
Activity: 239
Merit: 53
New ideas will be criticized and then admired.
The times of brute force are ending for some and already dead for others.
Mathematics is the only way, we have to be open to ideas even if they result in nothing, you don't need to get involved in ECC, you just need to solve the unknown,
target=?Huh
and from that unknown by subtracting, adding, dividing or multiplying, there is a number that makes you know the real value of the target with the same formula in reverse.

Why do I think this has not been resolved yet?

It is not because the mathematics does not exist to do it, it is simply because of the computing power that limits us, but it would not be unreasonable to think that there is some shortcut in mathematics in which we do not depend on brute force, perhaps divisions with periodic results could be an interesting shortcut
jr. member
Activity: 50
Merit: 1
I think your comments/scripts confuse people more than helps them, IMO.
I thought everyone is a cryptography expert around here, or worked for more than 25 years on EC, if my methods confuses you is because you don't try working only with scalars to penetrate N the group order. If I explain everything step by step, where would be the fun in that? Have you shared anything you could discover by operating over scalars?
Whatever method, equation you can use to get definitive results over scalars, applies to points as well. I have explained how to get meaningful results based on that before. To Alek on a few previous pages, regarding how to get target /1024 for sure.

Digaran, you're like a toddler when it comes to ECC. Without the proper knowledge about ECC, group fields, etc , you will always be mesmerized by every result you're getting when you perform some arithmetical operations on the curve.

Quote
..if my methods confuses you is because you don't try working only with scalars to penetrate N the group order

That is so stupid in so many ways. The order is a prime number and you are trying to find a divisor that is different from 1 and the number itself....I'm speechless!

Quote
Whatever method, equation you can use to get definitive results over scalars, applies to points as well.

Another stupidity. For example you can multiply 2 scalars over the group field but you cannot do that with 2 points.


It seems that posting whatever crosses your mind, it's your full time job! This wouldn't be a problem if you will present concrete examples from A to Z or if you will have a solid understanding about ECC. The problem is that you're lacking both. There are tons of materials about ECC and how it works - you just have to google it. The more you'll learn, the more you'll realize what a masterpiece the secp256k1 is. "Penetrate N the group order" by using a combination of subtractions and divisions is at least pointless!


I already told him, alert him, this user digran is talking nothing in this thread, he talk whatever came in his mind, with chatgpt, give us codes that he dsnt know how it work or whats the algorithm, he do actually create codes but with ai, just small chat, hi ai give me multiply 2 of 2 points, then he give us the codes,  60 pages in this thread with this user have nothing related to the subject of this thread, 60 pages with zero result only big talks and nothing,

Men . we are a lot of users who work in silent, if you have something that work please upload it in github, you dont have nothing keep your random search in vanity search or keyhunt please men let us think quite and understand other users, you are 24hours talking with maths you never understand ald algo, programing, even python if i came to you in real world and tell you to create anything stupid in python you will be lost, please STOP

DIGRAN STOP POSTING ON THIS POSTE,

Quote
Well that BBC is your answer, but it seems nobody has figured it out yet. Good news for our dragon.

The answer to what? See, you throw out numbers and math but none of it makes sense, is new, or doesn't help in knowingly how to reduce a range.

Elaborate what is shows/tells you? If you can.


YES Wandering, thats what i mean i just saw your reply now and im editing my reply, yes he never help with something everything is false non use have no sense you are not a programmer DIGRAN so please dont enter here to have the talk of the professional by the way i know you are talking a lot, you have a probleme im real life bro  you just have 4 stars in this forum that didint mean you are a pro or old in  btc community, stop this madness bro





I just got this idea, where is our code genius  @mcdouglasx, 😉 how about a script which subtracts G as many times as we want from target and divides


YES YOU ALWAYS HAVE AN IDEA THATS A BIG PROBLEME MEN we understand nothing from your maths and non sense codes you are doing nothing,
you want to substract ? https://github.com/WanderingPhilosopher/Windows-KeySubtractor
yes use keysubstractor this program is have all you can sub anypub key to whatever range you want, you cant substract pk to a know point because you already dont know the pk, there is no way here to do something to the puzzle you have tools just search please and never post anything here you are talking nothing here except this thread become big with your replys and non sense maths.


im asking the MODERATOR to mute The user DIGARAN.
Jump to: