 Show Posts
|
|
Pages: [1]
|
There are certain words that have a low probability of being used. using possible hints from the puzzle, among other things.
"low probability" is probability, not help and you think it is "low probability" but OP doesnt think so. Yes after use "possible hints" i see billion billion billion of these sentences. What are "other things"? Other things are what I'm trying out. Can't give away all the hints  Also, a few billion is nothing and quite easy to test for brain wallets. |
|
|
|
there are many ways of brute forcing that limit the number of results, so don't count it out.
tell me just one way of brute forcing that limit the number of results for this puzzle? There are certain words that have a low probability of being used. using possible hints from the puzzle, among other things. |
|
|
|
Isn't an easy puzzle... WhyTheCombOfNatashaOtomoskiHas21Teeth?.txt NatashaOtomoski > Satoshi Nakamoto... 21 > Total bitcoin supply in millions .txt > Satoshi White paper? Teeth >  I think the answer of this puzzle is in the bitcoin white paper... i will try to brute force that. brute forcing is not good way for solving this puzzle. assume the white paper has 100 distinct words, total number of combinations is: 100! / (100-8)! = 7.50306389818e+15 . assume you have a good computer and it can compute 1000 combinations per second, total time of computing will be: 7.50306389818e+12 seconds= 237920 years. I had in mind another kind of brute force. What i did was: a1=(words count in wp.txt)
a=(a1 - 8)
for b in (sequence 1 to $a)
do
take words from $b to $b+8, if the sum is 32 char then save it on a file
done
And what i get was this: OfWorkFormingARecordThatCannotBe
ButProofThatItCameFromTheLargest
CameFromTheLargestPoolOfCPUPower
TheLargestPoolOfCPUPowerAslongAs
PowerAslongAsAMajorityOfCPUPower
OfWorkChainAsProofOfWhatHappened
OnTheInternetHasComeToRelyAlmost
DefineAnElectronicCoinAsAChainOf
AndThePublicKeyOfTheNextOwnerand
OwnerandAddingTheseToTheEndOfThe
OfCourseIsThePayeeCantVerifyThat
ReturnedToTheMintToissueANewCoin
SolutionIsThatTheFateOfTheEntire
GoThroughThemJustLikeABankWeNeed
ForThePayeeToKnowThatThePrevious
ToDoubleSpendTheOnlyWayToConfirm
TheMintBasedModelTheMintWasAware
ASystemForParticipantsToAgreeOnA
ServerWorksByTakingAhashOfABlock
ObviouslyInOrderToGetIntoTheHash
ValueThatWhenHashedSuchAsWithSHA
HashedSuchAsWithSHAThehashBegins
InTheblockUntilAValueIsFoundThat
IsFoundThatGivesTheBlocksHashThe
BlocksAreChainedAfterItTheWorkTo
AreChainedAfterItTheWorkToChange
ChainedAfterItTheWorkToChangeThe
OfWorkIsEssentiallyOneCPUOneVote
ProofOfWorkEffortInvestedinItIfA
IntoABlockEachNodeWorksOnFinding
FindsAProofOfWorkItBroadcastsThe
AProofOfWorkItBroadcastsTheBlock
IfAllTransactionsInItAreValidAnd
OfTheBlockByWorkingOnCreatingThe
BlockInThechainUsingTheHashOfThe
UsingTheHashOfTheAcceptedBlockAs
TheLongestChainToBeTheCorrectOne
LongestChainToBeTheCorrectOneAnd
OfWorkIsFoundAndOneBranchBecomes
NodesTheyWillGetIntoABlockBefore
WillGetIntoABlockBeforeLongBlock
ReceiveABlockItWillRequestItWhen
ItWillRequestItWhenItReceivesThe
OfTheBlockThisAddsAnIncentiveFor
AdditionOfAConstantOfAmountOfNew
OurCaseItIsCPUTimeAndElectricity
HelpEncourageNodesToStayHonestIf
ThanAllTheHonestNodesHeWouldHave
UsingItToGenerateNewCoinsHeOught
ItMoreProfitableToPlayByTheRules
ByTheRulesSuchRulesThatFavourHim
InACoinIsBuriedUnderEnoughBlocks
TreeWithOnlyTheRootIncludedInThe
NeedToBeStoredABlockHeaderWithNo
StorageShouldNotBeAProblemEvenIf
RunningAFullNetworkNodeAUserOnly
NetworkNodeAUserOnlyNeedsToKeepa
HeHasTheLongestChainAndObtainThe
BlockItsTimestampedInHeCantCheck
ForhimselfButByLinkingItToAPlace
ByAnAttackerWhileNetworkNodesCan
AsLongAsTheAttackerCanContinueTo
OneReturningTheChangeIfAnyBackTo
ReturningTheChangeIfAnyBackToThe
ProblemHereThereIsNeverTheNeedTo
HereThereIsNeverTheNeedToExtract
InputsWereOwnedByTheSameOwnerThe
WereOwnedByTheSameOwnerTheRiskis
OwnedByTheSameOwnerTheRiskisThat
SameOwnerTheRiskisThatIfTheOwner
ThemAnAttackerCanOnlyTryToChange
ByOneBlockIncreasingItsleadByAnd
AndTheFailureEventIsTheAttackers
OfAnAttackerCatchingUpFromAGiven
UpFromAGivenDeficitIsAnalogousTo
TrialsToTryToReachBreakevenWeCan
HasToCatchUpWithIncreasesWithThe
TheRecipientBelieveHePaidHimForA
OfBlocksAheadOfTimeByWorkingOnit
IsLuckyEnoughToGetFarEnoughAhead
AndBlocksHaveBeenlinkedAfterItHe
BeenlinkedAfterItHeDoesntKnowThe
ToSolveThisWeproposedAPeerToPeer
NetworkUsingProofOfWorkToRecordA
TheyDoNotNeedToBeIdentifiedSince
TheyWereGoneTheyVoteWithTheirCPU I test those phrases as brainwallets but itdoesn't work  there are billion billion billion of these sentences. This puzzle has no logic, just solve by guessing. So nobody can solve it. OP should solve it or should close this topic to save time of everybody there are many ways of brute forcing that limit the number of results, so don't count it out. |
|
|
|
Guys, I want to tell everyone at once, I add your TXs to the queue, and then everything depends on the network, as an option you can always use the free service from VIABTC (if it works) and a paid analog https://confirmtx.com/I use a different method, it can work right away, or it may not work, so I do not ask for any payment from anyone who wants to let him do the donat, if not, I will not take offense at my works thanks to those who did donate to me, I really appreciate it Thanks for the work you are doing spider703  --James |
|
|
|
Need this accelerated please..
505f149d1565ca53b073741e8887b4f3a57376e750e8e03283ac862eb37977f0
Would love to get trading.
Thanks
--James
I accelerated your transactions, please send your promised tip here: 1NMrexBR8maLFBeS5WtfrnvRCGs2t9d7AZ There is only so much the free service can do, Try the paid service for better results. - a flat .002 may be enough to deceive already, you do not speed anything, the network lies, how you can speed something up if free services do not work, once again you will write and I will be forced to contact the site administrators to block you Ya I figured he was a spammer... |
|
|
|
|
Need this accelerated please..
505f149d1565ca53b073741e8887b4f3a57376e750e8e03283ac862eb37977f0
Would love to get trading.
Thanks
--James
|
|
|
|
|
