Group bits into bytes, big-endian.
(bits=>bebytes digits) → new-digits
Function:
(defun bits=>bebytes (digits) (declare (xargs :guard (bit-listp digits))) (declare (xargs :guard (integerp (/ (len digits) 8)))) (let ((__function__ 'bits=>bebytes)) (declare (ignorable __function__)) (group-bendian 2 8 digits)))
Theorem:
(defthm byte-listp-of-bits=>bebytes (b* ((new-digits (bits=>bebytes digits))) (byte-listp new-digits)) :rule-classes :rewrite)
Theorem:
(defthm bits=>bebytes-of-bit-list-fix-digits (equal (bits=>bebytes (bit-list-fix digits)) (bits=>bebytes digits)))
Theorem:
(defthm bits=>bebytes-bit-list-equiv-congruence-on-digits (implies (bit-list-equiv digits digits-equiv) (equal (bits=>bebytes digits) (bits=>bebytes digits-equiv))) :rule-classes :congruence)