diff --git a/COPYING b/COPYING
index 48bf2ac..f75f65d 100644
--- a/COPYING
+++ b/COPYING
@@ -1,6 +1,7 @@
 Copyright (c) 2003 Anthony Carrico, Martin Gasbichler
 Copyright (c) 2003 Eric Knauel, Matthias Neubauer
 Copyright (c) 2003 RT Happe
+Copyright (c) 2003 Taylor Campbell
 
 All rights reserved.
 
diff --git a/NEWS b/NEWS
index c4f647c..23196e7 100644
--- a/NEWS
+++ b/NEWS
@@ -1,6 +1,7 @@
 version 0.3
 * Added DETAILS (autogenerated)
 * Fixed installation
+* New s48 library: banana
 
 version 0.2 - 2003-02-25
 * Added INSTALL, README.admin, README.contrib.
diff --git a/s48/banana/banana.scm b/s48/banana/banana.scm
index ffe329b..170786f 100644
--- a/s48/banana/banana.scm
+++ b/s48/banana/banana.scm
@@ -97,6 +97,10 @@
 ;; NONNEGINT->BYTE-VECTOR or something) to byte vectors as
 ;; specified by the Banana protocol.
 ;;
+;; *FIXME* - Shouldn't this be able to be implemented better than
+;; by consing up a list...and then reversing that list...and then
+;; converting that list into a byte vector?
+;;
 ;; Tail-recursive, iterative version.
 (define (posint->byte-vector int)
   (do ((int int (arithmetic-shift int -7))
@@ -119,8 +123,8 @@
 ;          (cons (bitwise-and int #x7f)
 ;                (loop (arithmetic-shift int -7)))))))
 
-;; BYTE-VECTOR->POSINT is just like above but the other way
-;; around.
+;; BYTE-VECTOR->POSINT is just like POSINT->BYTE-VECTOR but the
+;; other way around.
 (define (byte-vector->posint bv)
   (let ((len (byte-vector-length bv)))
     (do ((i 0 (+ i 1))