为什么订阅链接能导入clash，导入v2rany全是-1

直接获取认证然后就可以直接2api用了，不用登陆，嘿嘿嘿

你知道，你来到了

我目前使用Claude Code + GLM6 帮我编写代码。由于是我自己的业余项目，我基本上不写代码，全给它提需求。我发现一开始还好。能快速出效果，但是随着系统代码越来越多，我发现大部分代码都是屎山，并且当我表达我的需求后，它挡着我的面继续，我很难受。然后当出现问题时，它也会把自己绕晕。只能我来看屎山代码，自己解决

密文：$argon2id$v=19$m=1024,t=1,p=1$CgsMDQ4PEBESExQVFhcYGQ$A0rCBJLPqpOxsJ5DVyuuDURAivoI-vZBsIosqaW-VQo

加密代码：
#include "argon2id.h"
#include <QString>
#include <QStringList>
#include <QRandomGenerator>
#include <QCryptographicHash>
#include <cstring>
#include <algorithm>

namespace argon2id {

// ==================== Blake2b实现 ====================

// Blake2b初始化向量
const uint64_t Argon2id::Blake2b::IV[8] = {
    0x6a09e667f3bcc908ULL, 0xbb67ae8584caa73bULL,
    0x3c6ef372fe94f82bULL, 0xa54ff53a5f1d36f1ULL,
    0x510e527fade682d1ULL, 0x9b05688c2b3e6c1fULL,
    0x1f83d9abfb41bd6bULL, 0x5be0cd19137e2179ULL
};

// Blake2b置换表
const uint8_t Argon2id::Blake2b::SIGMA[12][16] = {
    {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15},
    {14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3},
    {11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4},
    {7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8},
    {9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13},
    {2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9},
    {12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11},
    {13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10},
    {6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5},
    {10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13, 0},
    {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15},
    {14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3}
};

uint64_t Argon2id::Blake2b::rotr64(uint64_t w, unsigned c) {
    return (w >> c) | (w << (64 - c));
}

void Argon2id::Blake2b::G(uint64_t& a, uint64_t& b, uint64_t& c, uint64_t& d, 
                          uint64_t x, uint64_t y) {
    a = a + b + x;
    d = rotr64(d ^ a, 32);
    c = c + d;
    b = rotr64(b ^ c, 24);
    a = a + b + y;
    d = rotr64(d ^ a, 16);
    c = c + d;
    b = rotr64(b ^ c, 63);
}

void Argon2id::Blake2b::compress(Context& ctx, const uint8_t* block) {
    uint64_t m[16];
    uint64_t v[16];

    // 加载消息块
    for (size_t i = 0; i < 16; i++) {
        m[i] = load64(block + i * 8);
    }

    // 初始化工作向量
    for (size_t i = 0; i < 8; i++) {
        v[i] = ctx.h[i];
    }
    for (size_t i = 0; i < 8; i++) {
        v[i + 8] = IV[i];
    }

    v[12] ^= ctx.t[0];
    v[13] ^= ctx.t[1];
    v[14] ^= ctx.f[0];
    v[15] ^= ctx.f[1];

    // 12轮混合
    for (size_t i = 0; i < 12; i++) {
        G(v[0], v[4], v[8],  v[12], m[SIGMA[i][0]],  m[SIGMA[i][1]]);
        G(v[1], v[5], v[9],  v[13], m[SIGMA[i][2]],  m[SIGMA[i][3]]);
        G(v[2], v[6], v[10], v[14], m[SIGMA[i][4]],  m[SIGMA[i][5]]);
        G(v[3], v[7], v[11], v[15], m[SIGMA[i][6]],  m[SIGMA[i][7]]);
        G(v[0], v[5], v[10], v[15], m[SIGMA[i][8]],  m[SIGMA[i][9]]);
        G(v[1], v[6], v[11], v[12], m[SIGMA[i][10]], m[SIGMA[i][11]]);
        G(v[2], v[7], v[8],  v[13], m[SIGMA[i][12]], m[SIGMA[i][13]]);
        G(v[3], v[4], v[9],  v[14], m[SIGMA[i][14]], m[SIGMA[i][15]]);
    }

    // 更新状态
    for (size_t i = 0; i < 8; i++) {
        ctx.h[i] ^= v[i] ^ v[i + 8];
    }
}

void Argon2id::Blake2b::init(Context& ctx, uint32_t outlen, 
                            const uint8_t* key, size_t keylen) {
    memset(&ctx, 0, sizeof(Context));
    ctx.outlen = outlen;

    // 初始化状态
    for (size_t i = 0; i < 8; i++) {
        ctx.h[i] = IV[i];
    }

    // 参数块
    ctx.h[0] ^= 0x01010000 ^ (keylen << 8) ^ outlen;

    // 如果有密钥，处理密钥块
    if (keylen > 0) {
        uint8_t block[BLAKE2B_BLOCKBYTES];
        memset(block, 0, BLAKE2B_BLOCKBYTES);
        memcpy(block, key, keylen);
        update(ctx, block, BLAKE2B_BLOCKBYTES);
        memset(block, 0, BLAKE2B_BLOCKBYTES);
    }
}

void Argon2id::Blake2b::update(Context& ctx, const uint8_t* in, size_t inlen) {
    if (inlen == 0) return;

    size_t left = ctx.buflen;
    size_t fill = BLAKE2B_BLOCKBYTES - left;

    if (inlen > fill) {
        ctx.buflen = 0;
        // 填充缓冲区并压缩
        memcpy(ctx.buf + left, in, fill);