Stdlib module crypto/hash.vitl

Overview

`crypto/hash.vitl` is a public stdlib surface inside the `crypto` family. It should be read as one focused slice of the broader family responsibility: Hashing, HMAC, randomness, key derivation, symmetric primitives, and asymmetric primitives.

Purpose

This file should be chosen because of responsibility, not because its name “sounds close enough”. Inside the crypto family, it carries one focused part of the contract and keeps that responsibility separate from neighboring concerns.

• Use this module when keyed lookup, de-duplication, or stable addressability is part of the program contract.
• A package manifest can be serialized first, then hashed, then optionally signed.
• A token flow can derive a key in one boundary and use it in another without mixing concerns.

Taxonomy

Think of this page as a generated encyclopedia entry rather than a hand-written tutorial. The goal is to show what kind of module this is, how dense it is, and what reading strategy makes sense before depending on it.

• Large algorithm surface: this file exposes many procedures and likely acts as a domain toolkit rather than a single thin wrapper.
• Owns domain vocabulary: the module declares data shapes in addition to executable helpers, so its types are part of the contract.
• Has tuning constants: part of the module behavior is controlled by named constants that document default precision, limits, or policy.
• Minimal top-level dependencies: the module reads as mostly self-contained from its opening declarations.
• Explicit export surface: the file ends with visible export declarations instead of relying only on implicit namespace discovery.

Implementation profile

This profile is inferred directly from the source text. It does not replace reading the file, but it tells you quickly whether the module is mostly declarative, loop-heavy, branch-heavy, or organized around many small exits.

Top-level API inventory

Imported surfaces

This file does not advertise a top-level `use` surface in its opening declarations. That often means it is either self-contained or an aggregation layer.

Position in family

This file is module 3 of 9 in the crypto family when ordered by path. By procedure count it ranks 2, and by line count it ranks 2. Those ranks are useful as rough signals of breadth, not as quality judgments.

Declaration map

The declaration map turns raw source into a scan-friendly catalog. It is useful when the file is large enough that a reader wants to orient by kinds of surfaces first.

The table is exhaustive for top-level declarations of the selected kinds. This file declares 43 matching surfaces.

Representative signatures

These signatures are shown in source order so the page keeps the feel of a reference manual, not just a keyword cloud.

• const HASH_MD5: i32 = 1 (line 8)
• const HASH_SHA1: i32 = 2 (line 9)
• const HASH_SHA256: i32 = 3 (line 10)
• const HASH_SHA512: i32 = 4 (line 11)
• const HASH_SHA3_256: i32 = 5 (line 12)
• const HASH_SHA3_512: i32 = 6 (line 13)
• const HASH_BLAKE2B: i32 = 7 (line 14)
• const MD5_DIGEST_SIZE: i32 = 16 (line 17)
• const SHA1_DIGEST_SIZE: i32 = 20 (line 18)
• const SHA256_DIGEST_SIZE: i32 = 32 (line 19)
• const SHA512_DIGEST_SIZE: i32 = 64 (line 20)
• const AES_ECB: i32 = 1 (line 23)
• const AES_CBC: i32 = 2 (line 24)
• const AES_CTR: i32 = 3 (line 25)
• const AES_GCM: i32 = 4 (line 26)
• const AES_128: i32 = 16 (line 29)
• const AES_192: i32 = 24 (line 30)
• const AES_256: i32 = 32 (line 31)

The list is intentionally capped here; the source file declares 42 matching signatures in total.

How to use this module

Start by reading the file as an ownership boundary. Ask three questions: what enters this module, what stable types or procedures it exports, and what adjacent module should stay outside of it.

1. Read space and top-level imports first so the ownership boundary of crypto/hash.vitl is explicit.
2. Scan constants before procedures; they often encode precision, limits, or policy assumptions that explain later behavior.
3. Read declared forms and picks before algorithms so the data vocabulary is stable in your head.
4. Traverse procedures in source order; the early helpers usually explain the naming and numeric conventions used later.
5. Use the source landmarks section below as a table of contents when the file is large.

User example

This example is generated from the actual stdlib module surface. Its job is not to be the smallest snippet possible; its job is to show a realistic consumer-shaped file that exercises the module and mirrors the language keywords the module itself relies on.

space demo/crypto_hash
const SAMPLE_LABEL: string = "demo"
form UserReport {
  label: string,
  ready: bool
}
proc run_example() -> UserReport {
  let result = md5("sample")
  let ready: bool = hash_ready()
  let stable: bool = ready and true
    give UserReport { label: "ok", ready: true }
}
export run_example

Keyword coverage

This table makes the “all keywords of the module” requirement auditable. It compares the detected Vitte keywords in the source file with the generated consumer example above.

The generated snippet exercises every detected Vitte keyword used by this module.

Source shape

space vitte/crypto/hash
// Hash algorithm constants
const HASH_MD5: i32 = 1
const HASH_SHA1: i32 = 2
const HASH_SHA256: i32 = 3
const HASH_SHA512: i32 = 4
const HASH_SHA3_256: i32 = 5
const HASH_SHA3_512: i32 = 6
const HASH_BLAKE2B: i32 = 7
// Output sizes

The excerpt is not meant to replace the file. It exists to make the module recognizable at first glance, the same way a Wikipedia infobox helps the reader orient before reading the whole article.

Source landmarks

Large files are easier to retain when they have visible landmarks. When the source contains explicit section banners, they are surfaced here; otherwise the first major declarations are used as anchors.

• Hash Functions Module

Source organization

When a file carries its own internal chaptering, those chapters usually reveal the intended reading order better than a flat symbol list. This section reconstructs that organization from the source itself.

Complete API catalog

This catalog is the exhaustive file-level index for the module. It is intentionally closer to a generated encyclopedia appendix than to a tutorial summary.

Constants

Data surfaces

Procedures

Exports

Integration boundaries

Within crypto, this file should remain focused. If a future helper changes the host boundary, scheduling boundary, or data-shape boundary, it probably belongs in a neighbor module instead of being added here by convenience.

• Family responsibility: Hashing, HMAC, randomness, key derivation, symmetric primitives, and asymmetric primitives.
• Family architecture role: Use `crypto` when integrity, secrecy, or key management is the feature. This family should never be presented as generic formatting or utility code.

Composition guidance

Choose this module when

• Choose crypto/hash.vitl when the main question is owned by this module rather than by transport, storage, orchestration, or user-interface code.
• Use this module when keyed lookup, de-duplication, or stable addressability is part of the program contract.
• A package manifest can be serialized first, then hashed, then optionally signed.
• A token flow can derive a key in one boundary and use it in another without mixing concerns.

Pause before extending it when

• Avoid extending this file when the new helper mostly changes the boundary to host I/O, runtime coordination, or foreign integration instead of staying inside crypto.
• Check nearby modules such as crypto/asymmetric.vitl, crypto/hashing.vitl, crypto/hmac.vitl before adding convenience wrappers here.

Relationship table

This table keeps the page closer to a real encyclopedia entry: a module is easier to understand when compared with its nearest alternatives in the same family.

Neighbor modules

• crypto/asymmetric.vitl
• crypto/hashing.vitl
• crypto/hmac.vitl
• crypto/keyderivation.vitl
• crypto/random.vitl
• crypto/symmetric.vitl
• crypto/utils.vitl
• crypto.vitl