Groups > comp.compression > #2063

Re: New Data storage method with severe compression capabilities.

From	Noob <root@127.0.0.1>
Newsgroups	comp.compression
Subject	Re: New Data storage method with severe compression capabilities.
Date	2013-11-05 10:03 +0100
Organization	A noiseless patient Spider
Message-ID	<l5ac72$26e$2@dont-email.me> (permalink)
References	<1ef1f645-9cb8-44d0-9a58-086cfa9e53ef@googlegroups.com>

Show all headers | View raw

Awesome post. It's always fun to meet articulate kooks.

Michael Harrington wrote:

> I am announcing my creation, a 3 part invention pertaining to a Solid
> Physical Drive. Physical as in it is made up of small parts, not
> electronic in manner, but in shapes, colors, and the absence of
> physical parts (Called Scaling, see below)
> 
> After much research I have concluded that a Physical Drive using
> Colors, Shapes, and a 2 function aspect I call Scaling will greatly
> increase how much data can be stored in a given inch². It not only
> represents a means of storage in a smaller space but has strong
> encryption qualities. Finally it represents a means to replace
> existing Long-Term storage with a far more stable format.
> 
> The theories behind what I do shall be obvious to experts, when they
> see it. But let me try to describe it for laymen. I take a set of
> data and make a 3d (or 1d excepting less storage) representation of
> it. Via Scaling I can change the X axis, the Y axis, or the Z axis to
> certain extents to change the total possible outcomes. I can also
> exclude some portions entirely, leaving “Empty spots”.
> 
> Adding Colors, which by the way the Human Eye can see 10,000,000 of,
> we can vastly increase our pool. Colors are very small in size,
> smaller than the “Pits” in current magnetic based hard-drives. Memory
> currently takes up a space of about 2.4 microns by 2.1 microns. The
> visible light spectrum is approximately 400 to 700 nanometers in
> size. This is .4 to .7 Microns. Light currently affords a far greater
> potential memory density than standard magnetic memory. However 3D
> printing is not quite to that point, but we can easily squeeze in
> about an extra 10% in storage with just light alone at our current
> tech.
> 
> However this Scaling method is not done. Scaling in my invention also
> allows “empty spots” as defined above. A standard Pascals Triangle
> will be useful for math here. You can take a given line of binary,
> and then do the following:
> 
> First is the whole of the normal values, if 10 bits, then we have
> 1024 outcomes. Then we move to 9 bits and take one from the 10 bits.
> This is 9 bits with 10 possible variations. This is (2^9)*10. Next we
> move to 8 bits with 45 possible variations. This is (2^8)*45. Next 7
> bits with 120 variations (2^7)*120 and then we go on for (2^6)*210,
> (2^5)*252, (2^4)*210, (2^3)*120, (2^2)*45 and (2^1)*10. We get 58,024
> total outcomes or 15.824 (rounded) bits.
> 
> We can also just see the empty spots as spacers. Spacing out a
> sequence of 1mb would mean seeing it increase in size, but the
> addition of spacers would mean more potential outcomes. This would
> mean we would have a much larger effective memory size.
> 
> More so, we can turn 3D structures into 2D structures by just
> partitioning the layers separately. This means we can utilize shapes,
> scaling, and color into standard binary without due issue.
> 
> In a physical format we also find that shapes are detectable at very
> small sizes. For some technical reasons (We need to keep our detector
> reasonably small) we should keep this near the size of color. Shapes
> is a way to encode higher amounts of data as well as provide some
> unusually robust encryption capabilities. In fact the combined whole
> (Shapes, Colors, Scaling) makes encoded Gigabytes so astronomically
> huge in complexity that a hacker would need more “known” pages to be
> printed with the exact same method than has been printed in the
> entirety of humanity. In short perfect and uncrackable encryption.
> 
> Now to return to scaling for a moment. The X, Y, and Z axis can be
> modified as I stated. This represents a huge modifier. For instance
> in 5 bits alone there is in excess of 132 possible layouts. (sorry I
> was very tired while writing this, I know it has to be more, but I
> cannot formulate all possible layouts with how tired I am (to damned
> excited!!)). Now there is some 'issues' with 5 bits  having “empty
> spots” if there is this scaling. We cannot possibly get all the
> different layouts of empty spots due to the inability to tell where
> they would be. This issue is greatly reduced at larger bit chain
> lengths. However it would be possible to just run all versions of 4
> bits, 3 bits, and 2 bits. In practice it is probably not likely that
> such small chain lengths will be used, but instead we will see
> something like a megabyte reduced to as low as half a megabyte for
> total 'spots' for making something near 2 megabytes in total
> outcomes.
> 
> I also have included in my invention a means to 'subdivide' sections
> which allows us a greater flexibility in total drive design. Since we
> can render this into a 2D format this is just a way to make a series
> of different drives work in line without any serious increases in
> costs.
> 
> Now this physical drive will result in some interesting outcomes. I
> believe that our human mind is based upon this sort of 'physical
> drive formation' except that it uses far more 'empty space' and the
> structures are far more unique. In this case however our drives could
> be long, wide, or tall compared to an average drive, but will see
> significant size reductions in general. Simply put we use far less
> space to store the data, and therefore also we will see weight
> savings in all probability.
> 
> While some unique shapes will happen this will not greatly affect
> storage as each drive will probably be enclosed in a structure which
> will allow it to be bar-coded or otherwise identified for use as
> needed. Not all set ups however will require dramatic size
> modifications, for instance if converted to a 2D or if it is arranged
> to have 'white space' via usage of a color (or colors) stretching it
> to conform to a standardized size.
> 
> Amazingly my system can be fully integrated with a number of storage
> mediums. Take the standard hard drive with the “magnetic pits” they
> have. On a terabyte drive remove 10 bits or less in specific order,
> and now you have a potential huge hard-coded drive in addition to
> your standard magnetic drive.  And the difference is fully detectable
> with everything standard to current drives.
> 
> Even theoretical drives such as the Race Track memory (IBM) or
> Memristor (HP) can be subjected to my system for improved memory
> capacity (hard-coded). Not only that but Scaling has implications in
> transmitted data where multiple transmission sources are used or
> simulated in use.
> 
> The upsides is dramatically increased memory capacity, reduced total
> weight and space requirement's, and ultimately I think GREATLY
> reduced costs. Add to this long-term storage capabilities, incredible
> encryption levels, and the ability to add hard-coded data to existing
> storage mediums.
> 
> The downsides include long read times, non-existent write times (up
> until the ability to recycle the drives is perfected, a 3D recycler?)
> after the first printing, and possibly large storage requirements if
> converted to electronic binary.
> 
> Potential customers however abound. Banks store financial records for
> a very long time, as do law firms, security companies, securities
> companies, financial institutions in general, Governments, Hospitals,
> and more. Data storage is an expensive field, with typically high
> power requirements. My method only requires power when the drive is
> being read.
> 
> Patent Pending!

Thread

New Data storage method with severe compression capabilities. Michael Harrington <michaelharrington4rep@gmail.com> - 2013-11-04 16:02 -0800
Re: New Data storage method with severe compression capabilities. Noob <root@127.0.0.1> - 2013-11-05 10:03 +0100
Re: New Data storage method with severe compression capabilities. Michael Harrington <michaelharrington4rep@gmail.com> - 2013-11-05 04:44 -0800
Re: New Data storage method with severe compression capabilities. Sebastian Garth <sebastiangarth@gmail.com> - 2013-11-07 23:28 -0800
Re: New Data storage method with severe compression capabilities. Michael Harrington <michaelharrington4rep@gmail.com> - 2013-11-08 01:00 -0800
Re: New Data storage method with severe compression capabilities. Michael Harrington <michaelharrington4rep@gmail.com> - 2013-11-08 04:56 -0800
Re: New Data storage method with severe compression capabilities. Sebastian Garth <sebastiangarth@gmail.com> - 2013-11-08 09:50 -0800
Re: New Data storage method with severe compression capabilities. Michael Harrington <michaelharrington4rep@gmail.com> - 2013-11-08 10:41 -0800
Re: New Data storage method with severe compression capabilities. Sebastian Garth <sebastiangarth@gmail.com> - 2013-11-08 10:57 -0800
Re: New Data storage method with severe compression capabilities. Michael Harrington <michaelharrington4rep@gmail.com> - 2013-11-08 13:25 -0800
Re: New Data storage method with severe compression capabilities. pfraser <pete_fraser@comcast.net> - 2013-11-08 18:05 -0800
Re: New Data storage method with severe compression capabilities. Sebastian Garth <sebastiangarth@gmail.com> - 2013-11-08 18:59 -0800
Re: New Data storage method with severe compression capabilities. Michael Harrington <michaelharrington4rep@gmail.com> - 2013-11-08 19:06 -0800
Re: New Data storage method with severe compression capabilities. Thomas Richter <thor@math.tu-berlin.de> - 2013-11-08 22:28 +0100
Re: New Data storage method with severe compression capabilities. Michael Harrington <michaelharrington4rep@gmail.com> - 2013-11-08 16:40 -0800
Re: New Data storage method with severe compression capabilities. Thomas Richter <thor@math.tu-berlin.de> - 2013-11-09 17:31 +0100
Re: New Data storage method with severe compression capabilities. glen herrmannsfeldt <gah@ugcs.caltech.edu> - 2013-11-09 19:02 +0000
Re: New Data storage method with severe compression capabilities. Fibonacci Code <anglikai@gmail.com> - 2013-11-11 05:48 -0800
Re: New Data storage method with severe compression capabilities. Fibonacci Code <anglikai@gmail.com> - 2013-11-11 06:03 -0800
Re: New Data storage method with severe compression capabilities. Michael Harrington <michaelharrington4rep@gmail.com> - 2013-11-11 06:13 -0800
Re: New Data storage method with severe compression capabilities. Fibonacci Code <anglikai@gmail.com> - 2013-11-12 06:57 -0800
Re: New Data storage method with severe compression capabilities. Michael Harrington <michaelharrington4rep@gmail.com> - 2013-11-12 09:40 -0800

csiph-web