Javascript 考虑到单词的长度和要研究的字符集，我们能预测暴力破解一个单词所需的时间吗？

有没有一种方法可以预测（大约）在一个p字符池中使用蛮力需要多长时间来寻找一个N字符串

如果我们知道在p字符库中，X字符的数量实际上在单词中使用，而其余的字符则不相关，这是否也有助于计算

let pool = 'abcdefghijklmnopqrst'
let word = 'polkadpark'
let result = await bruteForce({ inside: pool, for: word }) 
// `result` should now be equal to `word`

---

一次交互的指令数*（池的长度）^（字的长度）
\uuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuu

除了目标字符串和字符池之外，此计算中还有更多的变量。处理器速度、处理器数量、每个处理器上的线程数。。。我相信我会漏掉很多。用数学来计算一个单词库中可能会产生多少个不同的单词。然后，如果你知道测试每种可能性需要多长时间，你可以用每个单词的时间乘以可能单词的数量。然后除以一半得到平均测试次数。