A software development company since 1986

Octal (3 Bit) Word Size
I was looking at Morse Code, which is basically a 2 bit encoding system 00 = dot, 01 = dash, 10 = end of character (3 pauses), 11 = end of word (7 pauses) Also looking at Flag Semaphore which is a two sparse 4 bit encoding system (every 45 degrees) Right hand (0000) Left hand(0001) = A or 1 (depending on the mode, a "number" begin with a # signal) So I am thinking of using an Octal (base 8) 3 bit encoding system for all information. This would make the math and logical part of the computer very fast and much simpler (only math operations on number, logical operations on boolean, ...). This should make the hardware simpler (first 3 bits determines which set of opcodes to use  if any). First 3 bits indicates what follows:
Intermediate Octal values are 0 thru 6 110 = end of value (;) 000 000 111 = Clif (read as 007) Word number 1 9 bit for an octal computer, currently stored as 24 bits. In an Octal Computer there are no size limitation on any value, this includes numbers. This format allows Jane to use one format for memorystoredvalues and for diskstoredvalues. This means there is no translation of information when sent from one computer to another, or from memory to / from disk. Octal is much easier to read than Hex. The base of the system could be selectable, it's just software, so for running simulations on a project, timings based on number base systems could be run. Jane is just software so setting the word size is possible to any value at any time. 10 gigabit network speed is achieved using 4 pairs of wires and one ground for a total of 9 wires. A base 16 word (4 bits) might be a better choice. I will try them both.
Common Cast Values, and defined bit structures (TBD, each cast value defines it's own structure)
Number Base defines the a Bit Group (BG) (3 is as trip, 4 is a nibble, 8 is a byte, ...): base 1 = 1 bit , base 2 = 1 bits, base 3 = 2 bits,
base 4 = 3 bits, base 5 = 3 bits, A base of not 2^{N} frees up bits for other purposes (i.e. control characters Base = 5, 3 bits)  (04 used), (101, 110, 111 are not used). Maybe have a Number of Bits per group difference from the Number Base. Bits = 4, Base = 7 xxxf (8 numbers used, 8 numbers not used) Base 8 numbers 001 111 001 111 000 101 111 111 = 1.5 We need to represent exact real numbers of infinite size. Each number can have a unique base, a unique assigned digits of precision, a unique tolerance value (+.005, .004), and specific units. Numbers have some of these fields:
Types of Numbers (Simple and Complex, each is a unique cast value with unique characteristics and logic):
It is possible to use a non integer Base Number (2^{4.5}) or a negative Base number (2^{4}) or a Base as a function of N (2^{f(n)}).
