🚀 go-pugleaf

ne way to do this on a cray is the following.

partition the long integer into 63  (yes 63) bit partions. the higher
order bit is always set to 0. in th vector accumulator.

perform the add, etc.  compare the output with positive or negative.
(there is no compare vector on the cray) so use their test vm stuff.

then expand vm into a vector of integer 0 or 1.  this is the carry
out.  then add the carry vector and so on.

you want to check with some of the people as lawrence livermore.

their code is in the public domain.  call frank McMann in the compuer
science group.

steve wallach (convex computer .... convex!wallach)