htpasswd $apr1$ Marker Recognizer
Recognize Apache APR1-MD5 marker and bounded textual shape only; no hash cracking, password verification or algorithm approval.
Description
Recognize an apr1 verifier prefix and its supported salt-and-digest text shape.
An Apache-style apr1 password verifier has a recognizable textual envelope. This tool checks that envelope and distinguishes a prefix match from the complete supported record shape.
When to use this tool
Recognize an apr1 verifier prefix and its supported salt-and-digest text shape. Use it when the input measurements and conventions below match the operation you need.
- Prepare storedHash, respecting the measurement basis and boundaries below.
- Compare the worked example with your intended operation before reusing its result.
How to use the tool and how it works
- Enter every field in the input table using the stated units and exact supported selector spelling where applicable.
- Run the tool. Correct input errors before interpreting an output.
- Read the result fields below; use accompanying flags and the stated sign, boundary or model convention when interpreting a number.
The prefix flag checks startsWith($apr1$). The full shape requires that prefix, a salt of 1 to 8 characters from dot, slash, digits and ASCII letters, another dollar sign and a 22-character digest from the same alphabet. passwordVerified is always false.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| storedHash | Stored hash. | Text |
| Output field | Interpretation |
|---|---|
| result | Object containing the following named result fields. |
| result.apr1PrefixPresent | Apr1 prefix present flag under the exact conditions described above. |
| result.apr1SyntaxShape | Apr1 syntax shape flag under the exact conditions described above. |
| result.passwordVerified | Always false; no candidate password is checked. |
{
"input": {
"storedHash": "$apr1$salt$aaaaaaaaaaaaaaaaaaaaaa"
},
"output": {
"result": {
"apr1PrefixPresent": true,
"apr1SyntaxShape": true,
"passwordVerified": false
}
}
}Limitations and assumptions
- The checker does not calculate apr1, authenticate a user or endorse this legacy verifier for new deployments. Prefix recognition alone does not establish a well-formed record.
- Every declared field is required and unexpected fields are rejected. Numeric inputs must be finite; input errors are distinct from a valid false result or an explicitly qualified output.
- Extremely large inputs and nonfinite or excessively large outputs are rejected. List positions reported by the tool use zero-based indices unless stated otherwise.
Alternative or Complementary methods
Use the applicable protocol specification and a reviewed implementation for real verification, hashing or key management. A format label, probability model or tentative text mapping does not replace that operation. Compare the scope of the nearby tools below before substituting one.
References
Similar or alternative tools
- acrostic first letter extractor
An acrostic forms a sequence from the first character of successive words.
- adfgvx cipher
ADFGVX uses a six-by-six symbol square before keyed column transposition.