I mean all combinations from a set of 24 bip39 words that i provide so not all possible combinations from the 2048 words.
I was going to make it, but then I saw reply from @PawGo.
Yes, actually with 24 words it is almost impossible. With 12, you may be able to achieve it. I had written the code below in javascript some months ago:
<script>
var seedArr = [],
usedChars = [];
function getAllDifferentCombinations(input) {
var i, ch;
for (i = 0; i < input.length; i++) {
ch = input.splice(i, 1)[0];
usedChars.push(ch);
if (input.length == 0) {
seedArr.push(usedChars.slice());
seedArr.push("</br>")
}
getAllDifferentCombinations(input);
input.splice(i, 0, ch);
usedChars.pop();
}
return seedArr
};
var comb = getAllDifferentCombinations(["word1", "word2", "word3", "word4", "word5", "word6", "word7", "word8", "word9", "word10", "word11", "word12"]).toString();
comb = comb.replaceAll(",", " ");
document.write(comb);
</script>
It doesn't check for checksum, but if you try it you'll see how abruptly the possibilities increase. You can just paste it on an html file and then open it with a browser. With a java script, like lostword, it'll be much faster because it uses more computational power than a javascript file, but you get the idea.
