• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
    • Software-verification
      • Kestrel-books
        • Crypto-hdwallet
        • Apt
        • Error-checking
        • Fty-extensions
        • Isar
        • Kestrel-utilities
          • Omaps
          • Directed-untranslate
          • Include-book-paths
          • Ubi
          • Numbered-names
          • Digits-any-base
          • Context-message-pair
          • With-auto-termination
          • Make-termination-theorem
          • Theorems-about-true-list-lists
          • Checkpoint-list
          • Sublis-expr+
          • Integers-from-to
          • Prove$
          • Defthm<w
          • System-utilities-non-built-in
          • Integer-range-fix
          • Minimize-ruler-extenders
          • Add-const-to-untranslate-preprocess
          • Unsigned-byte-fix
          • Signed-byte-fix
          • Defthmr
          • Paired-names
          • Unsigned-byte-list-fix
          • Signed-byte-list-fix
          • Show-books
          • Skip-in-book
          • Typed-tuplep
          • List-utilities
          • Checkpoint-list-pretty
          • Defunt
          • Keyword-value-list-to-alist
          • Magic-macroexpand
          • Top-command-number-fn
          • Bits-as-digits-in-base-2
          • Show-checkpoint-list
          • Ubyte11s-as-digits-in-base-2048
          • Named-formulas
          • Bytes-as-digits-in-base-256
          • String-utilities
            • Code-char-injectivity-theorem
            • 8bitbytes-hexchars-conversions
              • Ubyte8s=>hexchars
              • Hexchars=>ubyte8s
                • Ubyte8s<=>hexchars-inverses-theorems
              • Ubyte8=>hexchars
              • Hexchars=>ubyte8
            • Code-char-inverses-theorems
            • String-kinds
            • String-codelist-conversions
            • Charlist-codelist-conversions
            • 8bitbytes-hexstrings-conversions
          • Make-keyword-value-list-from-keys-and-value
          • Defmacroq
          • Integer-range-listp
          • Apply-fn-if-known
          • Trans-eval-error-triple
          • Checkpoint-info-list
          • Previous-subsumer-hints
          • Fms!-lst
          • Zp-listp
          • Trans-eval-state
          • Injections
          • Doublets-to-alist
          • Theorems-about-osets
          • Typed-list-utilities
          • Book-runes-alist
          • User-interface
          • Bits/ubyte11s-digit-grouping
          • Bits/bytes-digit-grouping
          • Message-utilities
          • Subsetp-eq-linear
          • Oset-utilities
          • Strict-merge-sort-<
          • Miscellaneous-enumerations
          • Maybe-unquote
          • Thm<w
          • Defthmd<w
          • Io-utilities
        • Set
        • Soft
        • C
        • Bv
        • Imp-language
        • Event-macros
        • Java
        • Bitcoin
        • Ethereum
        • Yul
        • Zcash
        • ACL2-programming-language
        • Prime-fields
        • Json
        • Syntheto
        • File-io-light
        • Cryptography
        • Number-theory
        • Lists-light
        • Axe
        • Builtins
        • Solidity
        • Helpers
        • Htclient
        • Typed-lists-light
        • Arithmetic-light
      • X86isa
      • Axe
      • Execloader
    • Math
    • Testing-utilities
  • 8bitbytes-hexchars-conversions

Hexchars=>ubyte8s

Convert an even-length sequence of hexadecimal digit characters to a list of unsigned 8-bit bytes.

Signature
(hexchars=>ubyte8s chars) → bytes
Arguments
chars — Guard (and (str::hex-digit-char-list*p chars) (true-listp chars) (evenp (len chars))) .
Returns
bytes — Type (unsigned-byte-listp 8 bytes).

Each pair of hexadecimal digit characters is turned into a number. Each such two-digit hexadecimal notation is treated as big endian, i.e. the most significant digit appears first.

Definitions and Theorems

Function: hexchars=>ubyte8s-aux

(defun hexchars=>ubyte8s-aux (chars rev-bytes)
 (declare (xargs :guard (and (and (str::hex-digit-char-list*p chars)
                                  (true-listp chars)
                                  (evenp (len chars)))
                             (unsigned-byte-listp 8 rev-bytes))))
 (let ((__function__ 'hexchars=>ubyte8s-aux))
   (declare (ignorable __function__))
   (cond ((endp chars) (rev rev-bytes))
         (t (b* ((byte (hexchars=>ubyte8 (car chars)
                                         (cadr chars))))
              (hexchars=>ubyte8s-aux (cddr chars)
                                     (cons byte rev-bytes)))))))

Function: hexchars=>ubyte8s

(defun hexchars=>ubyte8s (chars)
 (declare (xargs :guard (and (str::hex-digit-char-list*p chars)
                             (true-listp chars)
                             (evenp (len chars)))))
 (let ((__function__ 'hexchars=>ubyte8s))
  (declare (ignorable __function__))
  (mbe
      :logic (cond ((endp chars) nil)
                   (t (b* ((byte (hexchars=>ubyte8 (car chars)
                                                   (cadr chars)))
                           (bytes (hexchars=>ubyte8s (cddr chars))))
                        (cons byte bytes))))
      :exec (hexchars=>ubyte8s-aux chars nil))))

Theorem: return-type-of-hexchars=>ubyte8s

(defthm return-type-of-hexchars=>ubyte8s
  (b* ((bytes (hexchars=>ubyte8s chars)))
    (unsigned-byte-listp 8 bytes))
  :rule-classes :rewrite)

Theorem: hexchars=>ubyte8s-of-append

(defthm hexchars=>ubyte8s-of-append
  (implies (evenp (len chars1))
           (equal (hexchars=>ubyte8s (append chars1 chars2))
                  (append (hexchars=>ubyte8s chars1)
                          (hexchars=>ubyte8s chars2)))))

Subtopics

Ubyte8s<=>hexchars-inverses-theorems
ubyte8s=>hexchars and hexchars=>ubyte8s are mutual inverses.