As computer programs become ever more complex the volume of 1's and 0's within those programmes grows hugely. Where decades ago a simple programme may have used just a few thousand individual 1's and 0's (bits), we now have programmes that run into billions of them. So we move in an endless spiral of more 1's and 0's equalling more and more switches with faster and faster speeds for our CPU's. It seems only logical then to look at reducing the volume of bits thus leaving the chips less work to do!The problem then comes down to that within a single bit you can only code two pieces of information, that being a 1 or a 0, but you can, as we do, string more bits together to increase the information held. Such as in standard binary code format, we place eight bits together to make a single byte of 256 pieces of information. It is therefore accepted by most that we are restricted to a maximum of 256 individual pieces of information within a single byte. By applying an algorithm our team has found a way to increase the efficiency of today's binary code by a factor of at least four and we are currently looking at a factor six improvement. The answer for more computer efficiency isn't therefore in the hardware, it's actually in reducing the levels of 1's and 0's that slow silicon chip processing down and also limits the speed of data transfer across the motherboard architecture. This reduction in bits per programme also reduced file sizes and increased download speeds by a factor of three to four.