<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[Hashcat Rule Ranker – GPU-accelerated ranking of Hashcat rules]]></title><description><![CDATA[<p dir="auto">A tool that evaluates and ranks Hashcat rules against a wordlist + a list of known cracked passwords.</p>
<p dir="auto">• GPU (OpenCL – NVIDIA/AMD/Intel)</p>
<p dir="auto">• Multi-Armed Bandit (Thompson Sampling) with early elimination of weak rules → much faster on large rulesets or legacy exhaustive run</p>
<p dir="auto">• Optional CELF post-processing (max-coverage) – selects the smallest, most efficient set of rules instead of a plain top-K</p>
<p dir="auto">• Three strategy's: bitmap, recompute-gpu, sparse</p>
<p dir="auto">• Handler for quick analysis and merging results from multiple runs<br />
Output: ranked CSV + ready-to-use optimized .rule file.</p>
<p dir="auto">GitHub: <a href="https://github.com/A113L/ranker" target="_blank" rel="noopener noreferrer nofollow ugc">https://github.com/A113L/ranker</a></p>
<p dir="auto">Credits:<br />
<a class="plugin-mentions-user plugin-mentions-a" href="/user/vavaldi" aria-label="Profile: Vavaldi">@<bdi>Vavaldi</bdi></a> for coverage optimization inspiration</p>
]]></description><link>https://forum.hashpwn.net/topic/204/hashcat-rule-ranker-gpu-accelerated-ranking-of-hashcat-rules</link><generator>RSS for Node</generator><lastBuildDate>Thu, 01 Oct 2026 22:55:05 GMT</lastBuildDate><atom:link href="https://forum.hashpwn.net/topic/204.rss" rel="self" type="application/rss+xml"/><pubDate>Wed, 30 Sep 2026 23:01:05 GMT</pubDate><ttl>60</ttl><item><title><![CDATA[Reply to Hashcat Rule Ranker – GPU-accelerated ranking of Hashcat rules on Thu, 01 Oct 2026 08:44:19 GMT]]></title><description><![CDATA[<p dir="auto">On the results of ranker x1.greedy vs a1131.greedy rulesets</p>
<pre><code># head x1.greedy_top50000.rule
: 
T0 T2 T4 T6 T8 TA TC $1 $2
l
x12
c'1$s18
“A$p t
T0 T6 TA $3
T0 T5 TA 1 $2 $3
R2
-9x35 ^f

# head a1131.greedy.25000.rule
: 
l
T0
$1
K
]
$1 $2 $3
$4
$2
+2

# head a1131.greedy_top50000.r1.rule
: 
] $a
[$1
[$9
[$8
[$7
[$4
[$3
[ [ $6
[ [ $5
</code></pre>
<p dir="auto">As can be seen above, the rules obtained using the ranker (with CELF) are not only diverse, but also deliver very similar results at the identical cut-offs of 10k / 25k / 50k.</p>
<table class="table table-bordered table-striped">
<thead>
<tr>
<th>Rule</th>
<th>Hit rate</th>
<th>Size</th>
<th>AVG Time</th>
<th>Eff.</th>
</tr>
</thead>
<tbody>
<tr>
<td>a1131.greedy.10000.rule</td>
<td>22.75%</td>
<td>10 000</td>
<td>25 352</td>
<td>2.275</td>
</tr>
<tr>
<td>x1.greedy_top10000.rule</td>
<td>22.56%</td>
<td>10 001</td>
<td>501.44</td>
<td>2.2558</td>
</tr>
<tr>
<td>a1131.greedy.25000.rule</td>
<td>28.60%</td>
<td>25 000</td>
<td>31 879</td>
<td>1.144</td>
</tr>
<tr>
<td>x1.greedy_top25000.rule</td>
<td>28.46%</td>
<td>25 001</td>
<td>25 832.06</td>
<td>1.1384</td>
</tr>
<tr>
<td>a1131.greedy_top50000.r1.rule</td>
<td>33.60%</td>
<td>50 001</td>
<td>16 987.14</td>
<td>0.672</td>
</tr>
<tr>
<td>x1.greedy_top50000.rule</td>
<td>33.05%</td>
<td>50 001</td>
<td>21 051.92</td>
<td>0.661</td>
</tr>
</tbody>
</table>
<p dir="auto">Ranker + CELF generates rulesets with very similar effectiveness (differences of only 0.14–0.55 pp), while being more diverse and less redundant. At the 10k/25k/50k cut-offs the results are practically equivalent.</p>
<p dir="auto"><a href="https://docs.google.com/spreadsheets/d/1ctT9o-hdMaJMe9ZM7e6t9x0uDmGphvOixe0FHnHGCEI/edit?gid=1513384572#gid=1513384572" target="_blank" rel="noopener noreferrer nofollow ugc">Full Benchmark</a></p>
]]></description><link>https://forum.hashpwn.net/post/17230</link><guid isPermaLink="true">https://forum.hashpwn.net/post/17230</guid><dc:creator><![CDATA[A1131]]></dc:creator><pubDate>Thu, 01 Oct 2026 08:44:19 GMT</pubDate></item></channel></rss>