Class: Baseh::Baseh
- Inherits:
-
Object
- Object
- Baseh::Baseh
- Defined in:
- lib/baseh/baseh.rb
Overview
Codec engine, spec sections 8 through 12 and 18. Instances wrap one validated profile and are stateless and safe to share across threads.
Defined Under Namespace
Classes: DecodeResult, InspectResult, ValidateResult
Constant Summary collapse
- CONFUSION_MAPS =
Built-in spoken-confusion candidate maps, spec section 3.3. Pairs apply to body symbols only, never to checksum characters.
{ light: { "B" => %w[D], "D" => %w[B], "P" => %w[T], "T" => %w[P] }.freeze, medium: { "B" => %w[D], "D" => %w[B], "P" => %w[T], "T" => %w[P], "M" => %w[N], "N" => %w[M], "V" => %w[W], "W" => %w[V] }.freeze, heavy: { "B" => %w[D], "D" => %w[B], "P" => %w[T], "T" => %w[P], "M" => %w[N], "N" => %w[M], "V" => %w[W], "W" => %w[V], "F" => %w[S], "S" => %w[F], "C" => %w[G], "G" => %w[C] }.freeze }.freeze
- MAX_CANDIDATES =
64- ASCII_WS =
/\A[\t\n\v\f\r ]+|[\t\n\v\f\r ]+\z/.freeze
Instance Attribute Summary collapse
-
#profile ⇒ Object
readonly
Returns the value of attribute profile.
Class Method Summary collapse
-
.expandable_grouping(length) ⇒ Object
Spec 19.5.
Instance Method Summary collapse
-
#capacity ⇒ Object
Spec section 4.
-
#decode(input, accept_spaces: false, try_correction: false, confusion_profile: :none, max_corrections: 1) ⇒ DecodeResult
Spec section 9.
-
#encode(id:) ⇒ String
Spec section 8 (fixed mode) / 19.6 (expandable mode), with the spec 18.2 blocklist scan over the raw code.
-
#generate_candidates(body, confusion_map, max_edits = 1) ⇒ Object
Spec section 10.
-
#generation_base(length) ⇒ Object
Spec 19.1/22.3.
-
#generation_capacity(length) ⇒ Object
Spec 19.1/22.3.
-
#generation_for_id(id) ⇒ Object
Smallest generation whose range holds id, per spec 19.6.
-
#initialize(profile) ⇒ Baseh
constructor
A new instance of Baseh.
-
#inspect(input) ⇒ Object
Spec 12.5.
-
#normalize(input, accept_spaces) ⇒ Object
Spec 3.1 normalization, steps 1-9, with the spec 3.4 re-pad in fixed mode only.
-
#validate(input, **options) ⇒ Object
Spec section 12.4.
Constructor Details
#initialize(profile) ⇒ Baseh
Returns a new instance of Baseh.
45 46 47 48 |
# File 'lib/baseh/baseh.rb', line 45 def initialize(profile) @profile = Profile.prepare(profile) @body_index = BaseN.alphabet_index(@profile.body_alphabet) end |
Instance Attribute Details
#profile ⇒ Object (readonly)
Returns the value of attribute profile.
41 42 43 |
# File 'lib/baseh/baseh.rb', line 41 def profile @profile end |
Class Method Details
.expandable_grouping(length) ⇒ Object
Spec 19.5. Balanced grouping: the split is a pure function of the total length — g = max(2, ceil(L / 5)) groups differing in size by at most one, larger groups to the left. There is no configurable pattern in expandable mode (grouping must be empty, section 2.2).
108 109 110 111 112 113 114 115 |
# File 'lib/baseh/baseh.rb', line 108 def self.(length) g = [2, (length + 4) / 5].max base = length / g return [length] if base < 1 rem = length % g [base + 1] * rem + [base] * (g - rem) end |
Instance Method Details
#capacity ⇒ Object
Spec section 4. Capacity is an arbitrary-precision Integer. Spec 12.3: fixed mode only; expandable profiles have no single capacity (use the per-generation formulas of spec 19.1).
53 54 55 56 57 58 59 60 61 62 |
# File 'lib/baseh/baseh.rb', line 53 def capacity if @profile.mode != "fixed" raise BasehError.new( "INVALID_PROFILE", "capacity is only defined for fixed-mode profiles", safe_for_customer: false ) end @profile.capacity end |
#decode(input, accept_spaces: false, try_correction: false, confusion_profile: :none, max_corrections: 1) ⇒ DecodeResult
Spec section 9.
162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 |
# File 'lib/baseh/baseh.rb', line 162 def decode(input, accept_spaces: false, try_correction: false, confusion_profile: :none, max_corrections: 1) unless input.is_a?(String) raise BasehError.new("INVALID_CHARACTER", "Input must be a string") end raw = normalize(input, accept_spaces) # Spec 22: the generation is selected by the presented total length, # so the effective checksum length is a deterministic function of it. effective_k = if @profile.mode == "expandable" @profile.effective_checksum_length(raw.length) else @profile.checksum_length end body_length = if @profile.mode == "expandable" raw.length - effective_k else @profile.body_length end body = raw.slice(0, body_length) supplied_checksum = raw.slice(body_length..) || "" # normalize validates every symbol against the union of the body and # checksum alphabets (spec 3.1 step 6). A checksum-only symbol in a # body slot is INVALID_CHARACTER before any checksum work. A body-only # symbol in the checksum slot survives to the checksum comparison and # fails as INVALID_CHECKSUM; the frozen error vectors require that # exact outcome. body.each_char do |ch| next if @body_index.key?(ch) raise BasehError.new( "INVALID_CHARACTER", "Symbol #{ch.inspect} cannot appear in the body" ) end if Checksum.calculate_checksum(@profile, body, @body_index, effective_k) != supplied_checksum unless try_correction && max_corrections != 0 raise BasehError.new( "INVALID_CHECKSUM", "The reference code did not pass validation" ) end # Spec 10: replacements that are not body alphabet symbols are # dropped before candidate generation. A suggested symbol the alphabet # cannot contain (say a spoken drop on a stripped-alphabet profile) # could never validate; generating it anyway would throw # INVALID_CHARACTER from the checksum step instead of reporting an # honest INVALID_CHECKSUM. map = confusion_map(confusion_profile) filtered = {} map.each do |source, replacements| kept = replacements.select { |r| @body_index.key?(r) } filtered[source] = kept unless kept.empty? end valid = {} generate_candidates(body, filtered, max_corrections).each do |candidate| if Checksum.calculate_checksum(@profile, candidate, @body_index, effective_k) == supplied_checksum valid[candidate] = true end end case valid.size when 0 raise BasehError.new( "INVALID_CHECKSUM", "The reference code did not pass validation" ) when 1 body = valid.keys.first else raise BasehError.new( "AMBIGUOUS_INPUT", "The reference code matches more than one record", safe_for_customer: false ) end end value = BaseN.decode_base_n(body, @profile.body_alphabet, @body_index) perm = @profile.permutation if @profile.mode == "expandable" # Spec 19.7: the offset is de-permuted within the generation's own # domain (length mixed into the key derivation), then the generation # base is added back. l = raw.length if perm[:enabled] value = Feistel.inverse_permute( value, generation_capacity(l), profile_id: @profile.profile_id, key_bytes: perm[:key_bytes], rounds: perm[:rounds], length: l ) end value = generation_base(l) + value elsif perm[:enabled] value = Feistel.inverse_permute( value, @profile.capacity, profile_id: @profile.profile_id, key_bytes: perm[:key_bytes], rounds: perm[:rounds] ) end # encode re-scans the blocklist, so decode raises BLOCKED_CODE when # reconstructing a canonical form that could never have been issued # (spec 18.2). canonical_code = encode(id: value) corrected = raw != canonical_raw(canonical_code) DecodeResult.new(id: value, canonical_code: canonical_code, corrected: corrected) end |
#encode(id:) ⇒ String
Spec section 8 (fixed mode) / 19.6 (expandable mode), with the spec 18.2 blocklist scan over the raw code.
124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 |
# File 'lib/baseh/baseh.rb', line 124 def encode(id:) unless id.is_a?(Integer) raise TypeError, "id must be an Integer" end return (id) if @profile.mode == "expandable" if id.negative? || id >= @profile.capacity raise BasehError.new("OUT_OF_RANGE", "ID #{id} is outside the profile capacity") end value = id perm = @profile.permutation if perm[:enabled] value = Feistel.permute( value, @profile.capacity, profile_id: @profile.profile_id, key_bytes: perm[:key_bytes], rounds: perm[:rounds] ) end body = BaseN.encode_base_n(value, @profile.body_alphabet, @profile.body_length) checksum = Checksum.calculate_checksum(@profile, body, @body_index) raw = body + checksum check_blocklist!(raw) format_raw(raw) end |
#generate_candidates(body, confusion_map, max_edits = 1) ⇒ Object
Spec section 10. Substitution-only generation, capped and deduplicated.
414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 |
# File 'lib/baseh/baseh.rb', line 414 def generate_candidates(body, confusion_map, max_edits = 1) return [] if max_edits.zero? results = {} chars = body.chars chars.each_index do |pos| Array(confusion_map[chars[pos]]).each do |replacement| candidate = chars.dup candidate[pos] = replacement results[candidate.join] = true next unless results.size > MAX_CANDIDATES raise BasehError.new( "TOO_MANY_CANDIDATES", "Candidate generation exceeded 64 entries", safe_for_customer: false ) end end results.keys end |
#generation_base(length) ⇒ Object
Spec 19.1/22.3. First id of generation length: the sum of each generation's capacity A^(k - effectiveK(k)) for k from minLength through length-1. The effective checksum length is per-generation (spec 22), so the sum is not a single geometric series when the short checksum is on.
69 70 71 72 73 74 75 |
# File 'lib/baseh/baseh.rb', line 69 def generation_base(length) base = 0 @profile.min_length.upto(length - 1) do |l| base += generation_capacity(l) end base end |
#generation_capacity(length) ⇒ Object
Spec 19.1/22.3. Ids held by generation length: A^(length - effectiveK).
78 79 80 |
# File 'lib/baseh/baseh.rb', line 78 def generation_capacity(length) @profile.body_alphabet.length**(length - @profile.effective_checksum_length(length)) end |
#generation_for_id(id) ⇒ Object
Smallest generation whose range holds id, per spec 19.6. The loop is capped at the 32-symbol code limit (33 - minLength iterations) so an adversarial id fails fast with OUT_OF_RANGE instead of running big-integer multiplication on exponentially growing values.
86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 |
# File 'lib/baseh/baseh.rb', line 86 def generation_for_id(id) l = @profile.min_length base = 0 cap = generation_capacity(l) while id >= base + cap if l >= 32 raise BasehError.new( "OUT_OF_RANGE", "ID requires a code longer than 32 symbols" ) end base += cap l += 1 cap = generation_capacity(l) end l end |
#inspect(input) ⇒ Object
Spec 12.5. Live as-you-type inspection. Gates on the typed length before validating, so the spec 3.4 re-pad can never paint an incomplete fixed-mode code "valid" (or "invalid"): a short fixed input is "typing", never checked. Never raises on user input and never reports "valid" for an incomplete code.
291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 |
# File 'lib/baseh/baseh.rb', line 291 def inspect(input) p = @profile # Step 1: remove every occurrence of the separator string, then drop # ASCII whitespace anywhere (a paste can carry either inside the code). s = p.separator.empty? ? input.dup : input.gsub(p.separator, "") s = s.delete("\t\n\v\f\r ") typed = s.length # Step 2. return InspectResult.new(state: "empty") if typed.zero? # Step 3. Fixed: complete exactly at bodyLength + checksumLength. # Expandable: complete at every length from minLength through 32 (the # length selects the generation), 32 is the over-length bound. fixed = p.mode == "fixed" expected = fixed ? p.body_length + p.checksum_length : 32 return InspectResult.new(state: "too-long") if typed > expected # Step 4: spec 3.1 steps 4-6 without the length checks — case # normalization, aliases, then union membership. A symbol outside both # alphabets is "bad-char"; a symbol valid only in the other region (say # a checksum-only symbol typed into the body) passes here and fails # later under validate as INVALID_CHARACTER. s = s.upcase unless p.case_sensitive raw = s.each_char.map do |ch| inspect_union?(ch) ? ch : p.aliases.fetch(ch, ch) end.join return InspectResult.new(state: "bad-char") if raw.each_char.any? { |ch| !inspect_union?(ch) } # Step 5. complete = fixed ? typed == expected : typed >= p.min_length unless complete return InspectResult.new( state: "typing", typed: format_partial(raw), progress: typed.to_f / (fixed ? expected : p.min_length) ) end # Step 6: judge the normalized string (no separator, no whitespace, # case- and alias-normalized). result = validate(raw) return InspectResult.new(state: "invalid", reason: result.reason) unless result.valid decoded = decode(raw) InspectResult.new(state: "valid", id: decoded.id, canonical_code: decoded.canonical_code) end |
#normalize(input, accept_spaces) ⇒ Object
Spec 3.1 normalization, steps 1-9, with the spec 3.4 re-pad in fixed mode only. Returns the raw unformatted string.
340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 |
# File 'lib/baseh/baseh.rb', line 340 def normalize(input, accept_spaces) s = input.gsub(ASCII_WS, "") had_separator = !@profile.separator.empty? && s.include?(@profile.separator) # Literal-substring removal (gsub with a string pattern), matching the # JS split-join reference: String#delete would treat the separator as a # character class and corrupt multi-character separators like "..". s = s.gsub(@profile.separator, "") unless @profile.separator.empty? s = s.delete(" ") if accept_spaces s = s.upcase unless @profile.case_sensitive # Spec 3.2: an alias never maps two distinct canonical symbols into one # value, so a symbol that is already canonical stays as-is and only # non-canonical symbols are aliased. (In fixed tiers alias sources are # never canonical, so this changes nothing there.) s = s.each_char.map do |ch| if @body_index.key?(ch) || @profile.checksum_alphabet.include?(ch) ch else @profile.aliases.fetch(ch, ch) end end.join s.each_char do |ch| next if @body_index.key?(ch) || @profile.checksum_alphabet.include?(ch) raise BasehError.new( "INVALID_CHARACTER", "Symbol #{ch.inspect} is not accepted" ) end if @profile.mode == "expandable" # Spec 19.2/19.7: no left-padding and no stripped-zero leniency. Input # shorter than minLength or longer than 32 fails INVALID_LENGTH, and a # separator below separatorMinLength is rejected (spec 19.5: the # decoder expects no separators there). if s.length < @profile.min_length raise BasehError.new( "INVALID_LENGTH", "Expected at least #{@profile.min_length} symbols, got #{s.length}" ) end if s.length > 32 raise BasehError.new( "INVALID_LENGTH", "Expected at most 32 symbols, got #{s.length}" ) end if had_separator && s.length < @profile.separator_min_length raise BasehError.new( "INVALID_CHARACTER", "Separators do not appear below #{@profile.separator_min_length} symbols" ) end return s end expected = @profile.body_length + @profile.checksum_length # Spec 3.4: a code that lost leading zero body symbols is re-padded # with the body zero symbol. The checksum symbols always remain, so # the split point is unambiguous. A fully stripped no-checksum code # would be empty and stays a length error. if s.length < expected && s.length >= [@profile.checksum_length, 1].max s = @profile.body_alphabet[0] * (expected - s.length) + s end if s.length != expected raise BasehError.new( "INVALID_LENGTH", "Expected #{expected} symbols, got #{s.length}" ) end s end |
#validate(input, **options) ⇒ Object
Spec section 12.4. Never raises on user input; returns a ValidateResult with the failing error code in #reason instead.
279 280 281 282 283 284 |
# File 'lib/baseh/baseh.rb', line 279 def validate(input, **) result = decode(input, **) ValidateResult.new(valid: true, canonical_code: result.canonical_code) rescue BasehError => e ValidateResult.new(valid: false, reason: e.code) end |