jedisct1

Claude Code Environment Variables

Scope and methodology

This file documents environment variables visible in the checked-in source of this repository snapshot. It is not guaranteed to be exhaustive for the full product, because many imported files are not present here.

For each variable, this document gives:

• the visible purpose in code
• the rough subsystem it belongs to

jedisct1

{
  "version": 1,
  "timestamp": "2026-02-25T13:19:05.695339+00:00",
  "task": "Create xvcl code to compute the MD5 hash of the User-Agent header. Dont simulate, just lint",
  "model": "zai-org/GLM-5",
  "provider": "huggingface",
  "settings": {
    "temperature": 0.55,
    "top_p": 1.0,
    "seed": null,

jedisct1

{
  "version": 1,
  "timestamp": "2026-02-25T13:06:32.962539+00:00",
  "task": "Create xvcl code to compute the MD5 hash of the User-Agent header",
  "model": "zai-org/GLM-5",
  "provider": "huggingface",
  "settings": {
    "temperature": 0.55,
    "top_p": 1.0,
    "seed": null,

jedisct1

diff --git a/lib/std/base64.zig b/lib/std/base64.zig
index 8c08fd6786..5eb9a8d283 100644
--- a/lib/std/base64.zig
+++ b/lib/std/base64.zig
@@ -313,12 +313,22 @@ pub const Base64DecoderWithIgnore = struct {
         return result;
     }
 
-    /// Return the maximum possible decoded size for a given input length - The actual length may be less if the input includes padding.
-    /// `InvalidPadding` is returned if the input length is not valid.

jedisct1

#!/usr/bin/env python3
"""
Demonstrate a length extension attack against tokens computed as
SHA256(secret || signed_url || expiration || remote_ip || query_string).
"""

import base64
import hashlib
import struct
import urllib.parse

jedisct1

(**
   This Coq proof formally verifies that the EGCD algorithm implemented in egcd.zig
   correctly computes the GCD and Bezout coefficients for all inputs.

   PROVEN PROPERTIES:
   1. Termination: The algorithm terminates for all inputs
   2. Bezout Identity: a*x + b*y = gcd(a,b) for all inputs
   3. GCD Correctness: The result matches Coq's standard library Z.gcd
   4. Type Coverage: Works for ALL Zig integer types (u0 to u65534, i0 to i65534)
*)

jedisct1

const std = @import("std");

// Old implementation (current master)
fn gcd_old(a: anytype, b: anytype) @TypeOf(a, b) {
    const N = switch (@TypeOf(a, b)) {
        comptime_int => std.math.IntFittingRange(@min(a, b), @max(a, b)),
        else => |T| T,
    };
    if (@typeInfo(N) != .int or @typeInfo(N).int.signedness != .unsigned) {
        @compileError("`a` and `b` must be unsigned integers");

jedisct1

const std = @import("std");
const crypto = std.crypto;
const mem = std.mem;
const debug = std.debug;
const modes = crypto.core.modes;
const AuthenticationError = crypto.errors.AuthenticationError;
const cbc_mac = @import("cbc_mac.zig");

/// CCM (Counter with CBC-MAC) authenticated encryption mode
/// RFC 3610: https://www.rfc-editor.org/rfc/rfc3610

jedisct1

const std = @import("std");
const crypto = std.crypto;
const mem = std.mem;

/// CBC-MAC (Cipher Block Chaining Message Authentication Code)
///
/// CBC-MAC is a simple MAC construction: MAC = Encrypt(prev_mac XOR block)
/// Unlike CMAC (RFC 4493), CBC-MAC does not derive subkeys or perform special
/// final block processing. It is less secure than CMAC (vulnerable to length
/// extension attacks), but is required by certain standards like CCM (RFC 3610).

jedisct1

#! /bin/sh

IPV4_RANGES=(
  "23.235.32.0/20"
  "43.249.72.0/22"
  "103.244.50.0/24"
  "103.245.222.0/23"
  "103.245.224.0/24"
  "104.156.80.0/20"
  "140.248.64.0/18"