极验验证码破解详细教程（二）：参数分析与生成<\/h1>

一、极验验证码参数分析<\/h2>
极验验证码的核心参数主要包括`userresponse<\/code>和a<\/code>，这两个参数是通过分析geetest.js<\/code>文件得出的关键参数。<\/p>`

1. userresponse参数分析<\/h3>
在geetest.js<\/code>中搜索userresponse<\/code>，可以找到其赋值代码：<\/p>
userresponse<\/span>:<\/span> ca<\/span>.ra<\/span>(l<\/span>, this<\/span>.challenge<\/span>)
<\/span><\/span><\/code><\/pre>其中：<\/p>

l<\/code>：滑块移动的距离（最终位置）<\/li>
this.challenge<\/code>：已知的挑战值<\/li>
<\/ul>
1.1 计算userresponse的Python实现<\/h4>
def<\/span> cal_userresponse<\/span>(a, b):
<\/span><\/span>    d =<\/span> []
<\/span><\/span>    c =<\/span> b[32<\/span>:]
<\/span><\/span>    for<\/span> e in<\/span> range(len(c)):
<\/span><\/span>        f =<\/span> ord(str(c[e]))
<\/span><\/span>        tmp =<\/span> f -<\/span> 87<\/span> if<\/span> f ><\/span> 57<\/span> else<\/span> f -<\/span> 48<\/span>
<\/span><\/span>        d.<\/span>append(tmp)
<\/span><\/span>    c =<\/span> 36<\/span> *<\/span> d[0<\/span>] +<\/span> d[1<\/span>]
<\/span><\/span>    g =<\/span> int(round(a)) +<\/span> c
<\/span><\/span>    b =<\/span> b[:32<\/span>]
<\/span><\/span>    i =<\/span> j =<\/span> {}
<\/span><\/span>    k =<\/span> 0<\/span>
<\/span><\/span>    e =<\/span> 0<\/span>
<\/span><\/span>    for<\/span> e in<\/span> range(len(b)):
<\/span><\/span>        h =<\/span> b[e]
<\/span><\/span>        if<\/span> h in<\/span> j:
<\/span><\/span>            pass<\/span>
<\/span><\/span>        else<\/span>:
<\/span><\/span>            j[h] =<\/span> 1<\/span>
<\/span><\/span>            i[k].<\/span>append(h)
<\/span><\/span>            k +=<\/span> 1<\/span>
<\/span><\/span>    k =<\/span> 0<\/span> if<\/span> (k ==<\/span> 5<\/span>) else<\/span> k
<\/span><\/span>    n =<\/span> g
<\/span><\/span>    o =<\/span> 4<\/span>
<\/span><\/span>    p =<\/span> ""<\/span>
<\/span><\/span>    q =<\/span> [1<\/span>, 2<\/span>, 5<\/span>, 10<\/span>, 50<\/span>]
<\/span><\/span>    while<\/span> n ><\/span> 0<\/span>:
<\/span><\/span>        if<\/span> n -<\/span> q[o] >=<\/span> 0<\/span>:
<\/span><\/span>            m =<\/span> int(random.<\/span>random() *<\/span> len(i[o]))
<\/span><\/span>            p +=<\/span> str(i[o][m])
<\/span><\/span>            n -=<\/span> q[o]
<\/span><\/span>        else<\/span>:
<\/span><\/span>            del<\/span>(i[o])
<\/span><\/span>            del<\/span>(q[o])
<\/span><\/span>            o -=<\/span> 1<\/span>
<\/span><\/span>    return<\/span> p
<\/span><\/span><\/code><\/pre>参数说明：<\/p>

a<\/code>：滑块移动距离（l）<\/li>
b<\/code>：challenge值<\/li>
<\/ul>
1.2 l参数与Track的关系<\/h3>
l<\/code>参数实际上是滑动轨迹Track<\/code>的最后一个x坐标值：<\/p>
Track[-1][0] == l
<\/code><\/pre>
二、参数a的生成分析<\/h2>
参数a由oa.qa<\/code>函数生成，其返回值是f<\/code>：<\/p>
a<\/span>:<\/span> oa<\/span>.qa<\/span>(n<\/span>)
<\/span><\/span><\/code><\/pre>2.1 参数a的生成依赖<\/h3>
参数a的生成依赖于三个核心函数：<\/p>

c<\/code>函数：处理轨迹数据<\/li>
e<\/code>函数：处理特定模式<\/li>
d<\/code>函数：编码数值<\/li>
<\/ol>
2.1.1 c函数（轨迹处理函数）<\/h4>
def<\/span> fun_c<\/span>(a):
<\/span><\/span>    g =<\/span> []
<\/span><\/span>    e =<\/span> []
<\/span><\/span>    f =<\/span> 0<\/span>
<\/span><\/span>    for<\/span> h in<\/span> range(len(a) -<\/span> 1<\/span>):
<\/span><\/span>        b =<\/span> int(round(a[h +<\/span> 1<\/span>][0<\/span>] -<\/span> a[h][0<\/span>]))
<\/span><\/span>        c =<\/span> int(round(a[h +<\/span> 1<\/span>][1<\/span>] -<\/span> a[h][1<\/span>]))
<\/span><\/span>        d =<\/span> int(round(a[h +<\/span> 1<\/span>][2<\/span>] -<\/span> a[h][2<\/span>]))
<\/span><\/span>        g.<\/span>append([b, c, d])
<\/span><\/span>        if<\/span> b ==<\/span> c ==<\/span> d ==<\/span> 0<\/span>:
<\/span><\/span>            pass<\/span>
<\/span><\/span>        else<\/span>:
<\/span><\/span>            if<\/span> b ==<\/span> c ==<\/span> 0<\/span>:
<\/span><\/span>                f +=<\/span> d
<\/span><\/span>            else<\/span>:
<\/span><\/span>                e.<\/span>append([b, c, d +<\/span> f])
<\/span><\/span>                f =<\/span> 0<\/span>
<\/span><\/span>    if<\/span> f !=<\/span> 0<\/span>:
<\/span><\/span>        e.<\/span>append([b, c, f])
<\/span><\/span>    return<\/span> e
<\/span><\/span><\/code><\/pre>功能：计算相邻轨迹点之间的差值，并处理特殊情况。<\/p>
2.1.2 e函数（模式匹配函数）<\/h4>
def<\/span> fun_e<\/span>(item):
<\/span><\/span>    b =<\/span> [[1<\/span>, 0<\/span>], [2<\/span>, 0<\/span>], [1<\/span>, -<\/span>1<\/span>], [1<\/span>, 1<\/span>], [0<\/span>, 1<\/span>], [0<\/span>, -<\/span>1<\/span>], [3<\/span>, 0<\/span>], [2<\/span>, -<\/span>1<\/span>], [2<\/span>, 1<\/span>]]
<\/span><\/span>    c =<\/span> 'stuvwxyz~'<\/span>
<\/span><\/span>    for<\/span> i, t in<\/span> enumerate(b):
<\/span><\/span>        if<\/span> t ==<\/span> item[:2<\/span>]:
<\/span><\/span>            return<\/span> c[i]
<\/span><\/span>    return<\/span> 0<\/span>
<\/span><\/span><\/code><\/pre>功能：匹配特定的移动模式并返回对应字符。<\/p>
2.1.3 d函数（数值编码函数）<\/h4>
def<\/span> fun_d<\/span>(a):
<\/span><\/span>    b =<\/span> '0123456789:?@ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqr'<\/span>
<\/span><\/span>    c =<\/span> len(b)
<\/span><\/span>    d =<\/span> ''<\/span>
<\/span><\/span>    e =<\/span> abs(a)
<\/span><\/span>    f =<\/span> int(e \/<\/span> c)
<\/span><\/span>    if<\/span> f >=<\/span> c:
<\/span><\/span>        f =<\/span> c -<\/span> 1<\/span>
<\/span><\/span>    if<\/span> f ><\/span> 0<\/span>:
<\/span><\/span>        d =<\/span> b[f]
<\/span><\/span>        e %=<\/span> c
<\/span><\/span>    g =<\/span> ''<\/span>
<\/span><\/span>    if<\/span> a <<\/span> 0<\/span>:
<\/span><\/span>        g +=<\/span> '!'<\/span>
<\/span><\/span>    if<\/span> d:
<\/span><\/span>        g +=<\/span> '$'<\/span>
<\/span><\/span>    return<\/span> g +<\/span> d +<\/span> b[e]
<\/span><\/span><\/code><\/pre>功能：将数值编码为特定字符。<\/p>
2.2 完整的f函数实现<\/h3>
def<\/span> fun_f<\/span>(track_list):
<\/span><\/span>    skip_list =<\/span> fun_c(track_list)
<\/span><\/span>    g, h, i =<\/span> [], [], []
<\/span><\/span>    for<\/span> j in<\/span> range(len(skip_list)):
<\/span><\/span>        b =<\/span> fun_e(skip_list[j])
<\/span><\/span>        if<\/span> b:
<\/span><\/span>            h.<\/span>append(b)
<\/span><\/span>        else<\/span>:
<\/span><\/span>            g.<\/span>append(fun_d(skip_list[j][0<\/span>]))
<\/span><\/span>            h.<\/span>append(fun_d(skip_list[j][1<\/span>]))
<\/span><\/span>            i.<\/span>append(fun_d(skip_list[j][2<\/span>]))
<\/span><\/span>    return<\/span> ''<\/span>.<\/span>join(g) +<\/span> ''<\/span>.<\/span>join(h) +<\/span> ''<\/span>.<\/span>join(i)
<\/span><\/span><\/code><\/pre>参数说明：<\/p>

track_list<\/code>：滑块移动轨迹（Track）<\/li>
<\/ul>
三、滑动轨迹Track分析<\/h2>
3.1 Track的数据结构<\/h3>
Track是一个二维数组，格式如下：<\/p>
[
<\/span><\/span>    [x1, y1, t1],
<\/span><\/span>    [x2, y2, t2],
<\/span><\/span>    ...<\/span>
<\/span><\/span>    [xn, yn, tn]
<\/span><\/span>]
<\/span><\/span><\/code><\/pre>其中：<\/p>

x：水平坐标<\/li>
y：垂直坐标<\/li>
t：时间戳（毫秒）<\/li>
<\/ul>
3.2 Track的生成特点<\/h3>

轨迹是随机采样生成的离散坐标序列<\/li>
最后一个x坐标值等于滑块移动距离l<\/li>
轨迹需要模拟人类滑动行为，包括：

加速和减速过程<\/li>
微小抖动<\/li>
可能的回退<\/li>
<\/ul>
<\/li>
<\/ol>
3.3 Track生成的关键点<\/h3>

缺口位置识别<\/strong>：需要通过图像识别确定滑块需要移动的距离<\/li>
轨迹模拟<\/strong>：需要根据缺口距离生成符合人类行为的轨迹<\/li>
时间控制<\/strong>：总滑动时间应在合理范围内（通常1-3秒）<\/li>
<\/ol>
四、破解流程总结<\/h2>

获取challenge值<\/strong>：从服务器响应中获取<\/li>
识别缺口位置<\/strong>：通过图像处理确定滑块需要移动的距离<\/li>
生成Track轨迹<\/strong>：根据缺口距离模拟人类滑动行为<\/li>
计算userresponse<\/strong>：使用cal_userresponse<\/code>函数<\/li>
计算参数a<\/strong>：使用fun_f<\/code>函数处理Track轨迹<\/li>
提交验证<\/strong>：将生成的参数提交给验证接口<\/li>
<\/ol>
五、待解决问题<\/h2>
目前教程中尚未完全解决的是Track轨迹的生成算法<\/strong>，这是破解极验验证码的最后一步。Track轨迹需要：<\/p>

根据缺口距离动态生成<\/li>
模拟人类滑动行为模式<\/li>
包含合理的加速、减速和抖动<\/li>
时间控制要符合正常人类操作<\/li>
<\/ol>
这部分内容将在后续教程中详细讲解。<\/p>
极验验证码破解详细教程（二）：参数分析与生成<\/h1>

一、极验验证码参数分析<\/h2> 极验验证码的核心参数主要包括userresponse<\/code>和a<\/code>，这两个参数是通过分析geetest.js<\/code>文件得出的关键参数。<\/p>

三、滑动轨迹Track分析<\/h2>

一、极验验证码参数分析<\/h2>
极验验证码的核心参数主要包括`userresponse<\/code>和a<\/code>，这两个参数是通过分析geetest.js<\/code>文件得出的关键参数。<\/p>`
