import hashlib

# Simplified wordlist for demonstration
# In a real auditor, this would contain all 2048 words
WORDLIST = [
    "abandon", "ability", "able", "about", "above", "absent", "absorb", "abstract", 
    "absurd", "abuse", "access", "accident", "account", "accuse", "achieve", "acid",
    # ... (skipping to index 2047)
] + ["word"] * 2031 + ["zoo"]

def audit_mnemonic_generation(entropy_hex):
    print(f"--- BIP39 Mnemonic Audit ---")
    print(f"[*] Entropy Hex: {entropy_hex}")

    # 1. Convert hex to bits
    entropy_bytes = bytes.fromhex(entropy_hex)
    entropy_bits = bin(int.from_bytes(entropy_bytes, 'big'))[2:].zfill(len(entropy_bytes) * 8)

    # 2. Calculate Checksum (SHA256)
    hash_result = hashlib.sha256(entropy_bytes).digest()
    hash_bits = bin(int.from_bytes(hash_result, 'big'))[2:].zfill(256)

    # 128 bits entropy -> 4 bits checksum
    checksum_len = len(entropy_bytes) * 8 // 32
    checksum = hash_bits[:checksum_len]

    # 3. Combine
    total_bits = entropy_bits + checksum
    print(f"[*] Total Bits:  {len(total_bits)} (Entropy + {checksum_len} Checksum)")

    # 4. Split into 11-bit chunks and map to words
    words = []
    for i in range(0, len(total_bits), 11):
        index = int(total_bits[i:i+11], 2)
        # Using a fallback for the simplified wordlist
        word = WORDLIST[index] if index \u003c len(WORDLIST) else f"WORD_{index}"
        words.append(word)

    print(f"[SUCCESS] Mnemonic: {' '.join(words)}")

# --- Simulation ---

# Case 1: 128 bits of entropy (32 hex chars)
# This will result in 12 words
test_entropy = "00000000000000000000000000000000"
audit_mnemonic_generation(test_entropy)