Existing large scale binary computers typically must allow for the maximum full length carry time in each addition. It has been shown that average carry sequences are significantly shorter than this maximum, on the average only five stages for a 40 digit addition. A method is described to realize the implied 8 to 1 time saving by deriving an actual ``carry completion'' signal. Experimental results verify this saving.

In this study, an investigation was made to discover methods of storing more bits on a Williams tube than can be stored by conventional methods. Read-around was ignored because the object was to explore the Williams tube as a secondary memory for non-random access operations. Proceeding on this basis, it was found that a four-fold increase in packing is possible with established techniques, and an even greater increase with other methods described in this paper. Such a memory is more versatile than a magnetic drum, as shown by the example of machine organization presented in this paper.