Comments on: New storage break through: paper http://tech.blorge.com/Structure:/2006/11/27/new-storage-break-through-paper/ Top Technology news Mon, 13 Feb 2012 11:40:13 +0000 hourly 1 http://wordpress.org/?v=3.2.1 By: kevin http://tech.blorge.com/Structure:/2006/11/27/new-storage-break-through-paper/comment-page-1/#comment-1696 kevin Thu, 30 Nov 2006 17:45:04 +0000 http://tech.blorge.com/Structure:/2006/11/27/new-storage-break-through-paper/#comment-1696 ok i have thought long and hard about this. And i think i have com up with a way to get more information into a 300 dpi than would fit if you could fit one of 256 colors into 90,000 bits per square inch, giving you 90K per square inch. if you use large geometric shapes (circles, squares triangles and so one) the shapes would be large maybe a quarter inch and tightly packed. then much like a hologram the squares would be printed on top of the cirecls and the triangles on top of that. if you know the exactl lay out of each layer you can read the appropriate layers off one at a time use some high level math and arrive at the color of each geometric figure. so if i can pack 10,000 of each over 20 different geometric figures, each of of a distinct color out of 256, then i can pack 200k into 90k worth of space. the problem as you scale this up the amount of time it takes to unpacked the esentially hashed data would almost not make this worth the time to decode it. though I guess if you are in india with out access to the internet this is a great and cheap way to pass large amounts of data. as well with large shapes, error correction can be applied and a high level of accuracy is not needed to read it as the shapes inherent in the data would help orient the program as to how to decode the data. my best example of how all this works is sudoku. you have to fill in 81 squares, but if you are given 4 diffrent puzzles and none of the puzzles have the same initial squares filled in, then you could fill a sudoku board with all four puzzles, as long as the end usere knew which patterns to pull back out of the board to re assemble the 4 original puzzles. the same would hold true of this method on a massive scale. BUT id don't think gig's per square inch is possible, I think even being very generous 100M would be pushing it. maybe 2.7meg per square inch instead of gig. ok i have thought long and hard about this. And i think i have com up with a way to get more information into a 300 dpi than would fit if you could fit one of 256 colors into 90,000 bits per square inch, giving you 90K per square inch. if you use large geometric shapes (circles, squares triangles and so one) the shapes would be large maybe a quarter inch and tightly packed. then much like a hologram the squares would be printed on top of the cirecls and the triangles on top of that. if you know the exactl lay out of each layer you can read the appropriate layers off one at a time use some high level math and arrive at the color of each geometric figure. so if i can pack 10,000 of each over 20 different geometric figures, each of of a distinct color out of 256, then i can pack 200k into 90k worth of space. the problem as you scale this up the amount of time it takes to unpacked the esentially hashed data would almost not make this worth the time to decode it. though I guess if you are in india with out access to the internet this is a great and cheap way to pass large amounts of data.

as well with large shapes, error correction can be applied and a high level of accuracy is not needed to read it as the shapes inherent in the data would help orient the program as to how to decode the data.

my best example of how all this works is sudoku. you have to fill in 81 squares, but if you are given 4 diffrent puzzles and none of the puzzles have the same initial squares filled in, then you could fill a sudoku board with all four puzzles, as long as the end usere knew which patterns to pull back out of the board to re assemble the 4 original puzzles. the same would hold true of this method on a massive scale.

BUT id don’t think gig’s per square inch is possible, I think even being very generous 100M would be pushing it. maybe 2.7meg per square inch instead of gig.

]]> By: me http://tech.blorge.com/Structure:/2006/11/27/new-storage-break-through-paper/comment-page-1/#comment-1692 me Wed, 29 Nov 2006 18:43:16 +0000 http://tech.blorge.com/Structure:/2006/11/27/new-storage-break-through-paper/#comment-1692 any one got any ideas how this works, i just do not see, even with color were a 10 fold jump in data density comes from any one got any ideas how this works, i just do not see, even with color were a 10 fold jump in data density comes from

]]> By: Ash http://tech.blorge.com/Structure:/2006/11/27/new-storage-break-through-paper/comment-page-1/#comment-1684 Ash Tue, 28 Nov 2006 23:43:36 +0000 http://tech.blorge.com/Structure:/2006/11/27/new-storage-break-through-paper/#comment-1684 Wait! What day is it? Damn. I thought it was April 1st already. Wait! What day is it?

Damn. I thought it was April 1st already.

]]>