On Wed, 18 May 2011 13:07:32 -0700
Landon Stewart lstew...@superb.net wrote:
Lets say you had a file that was 1,000,000,000 characters consisting
of 8,000,000,000bits. What if instead of transferring that file
through the interwebs you transmitted a mathematical equation to tell
a computer
On May 20, 2011, at 5:16 PM, Sudeep Khuraijam wrote:
I could not help but admire nanog in its full form ;) and I cannot resist
anymore. Allow me to suggest the EPR paradox machine.
The cost of regenerating unpredictable information is inefficient by orders
of magnitude, but wait...
To do this, you only need 2 numbers: the nth digit of pi and the number of
digits.
Simply convert your message into a single extremely long integer. Somewhere,
in the digits of pi, you will find a matching series of digits the same as
your integer!
Decompressing the number is relatively easy
On Fri, May 20, 2011 at 06:46:45PM +, Eu-Ming Lee wrote:
To do this, you only need 2 numbers: the nth digit of pi and the number of
digits.
Simply convert your message into a single extremely long integer. Somewhere,
in the digits of pi, you will find a matching series of digits the
On 05/20/2011 08:53 AM, Brett Frankenberger wrote:
On Fri, May 20, 2011 at 06:46:45PM +, Eu-Ming Lee wrote:
To do this, you only need 2 numbers: the nth digit of pi and the number of
digits.
Simply convert your message into a single extremely long integer. Somewhere,
in the digits of pi,
On Fri, May 20, 2011 at 09:34:59AM -1000, Paul Graydon said:
Not quite sure I follow that. Start at position xyz, carry on for 1
bits shouldn't be as long as telling it all 1 bits?
what position # do you think your exact 1 bits will appear at?
(infact, mathies, whats the
On Fri, May 20, 2011 at 09:34:59AM -1000, Paul Graydon wrote:
On 05/20/2011 08:53 AM, Brett Frankenberger wrote:
On Fri, May 20, 2011 at 06:46:45PM +, Eu-Ming Lee wrote:
To do this, you only need 2 numbers: the nth digit of pi and the number of
digits.
Simply convert your message into a
On Fri, 20 May 2011 09:34:59 -1000, Paul Graydon said:
Not quite sure I follow that. Start at position xyz, carry on for 1
bits shouldn't be as long as telling it all 1 bits?
The problem is that the length of 'xyz' will probably be on the same order of
magnitude as the length of your
On 05/20/2011 03:34 PM, Paul Graydon wrote:
On 05/20/2011 08:53 AM, Brett Frankenberger wrote:
Even if those problems were solved, you'd need (on average) just as
many bits to represent which digit of pi to start with as you'd need to
represent the original message.
-- Brett
Not quite
I could not help but admire nanog in its full form ;) and I cannot resist
anymore. Allow me to suggest the EPR paradox machine.
The cost of regenerating unpredictable information is inefficient by orders
of magnitude, but wait... isn't it what we are trying to solve?
On May 20, 2011, at
On 5/20/2011 12:44 PM, Ken Chase wrote:
On Fri, May 20, 2011 at 09:34:59AM -1000, Paul Graydon said:
Not quite sure I follow that. Start at position xyz, carry on for 1
bits shouldn't be as long as telling it all 1 bits?
what position # do you think your exact 1 bits will appear
In a message written on Wed, May 18, 2011 at 09:52:22PM -0500, Brett
Frankenberger wrote:
That will work. Of course, the CPU usage will be overwhelming --
longer than the age of the universe to do a large file -- but,
theoretically, with enough CPU power, it will work.
You have a different
-Original Message-
From: Leo Bicknell [mailto:bickn...@ufp.org]
Sent: 19 May 2011 14:10
To: nanog
Subject: Re: Had an idea - looking for a math buff to tell me if it's
possible with today's technology.
In a message written on Wed, May 18, 2011 at 09:52:22PM -0500, Brett
On Wed, May 18, 2011 at 9:33 PM, Christopher Morrow
morrowc.li...@gmail.com wrote:
no no no.. it's simply, since the OP posited a math solution, md5.
ship the size of file + hash, compute file on the other side. All
files can be moved anywhere regardless of the size of the file in a
single
On Thu, May 19, 2011 at 5:05 AM, Vitkovsky, Adam avitkov...@emea.att.comwrote:
inverse problem
This is what I believe Landon meant in his original post
Everybody started talking about compression -but that is I believe sending
the result of the function -where both nodes know the function
On May 19, 2011, at 11:42 AM, Landon Stewart wrote:
On Thu, May 19, 2011 at 5:05 AM, Vitkovsky, Adam
avitkov...@emea.att.comwrote:
inverse problem
This is what I believe Landon meant in his original post
Everybody started talking about compression -but that is I believe sending
the
On Thu, May 19, 2011 at 4:34 PM, Warren Kumari war...@kumari.net wrote:
Just wanted to say yes, this is entirely what I meant. Of course the
smaller the file the more pointless it gets but still... If the file was
1GB instead of just 7 bytes I'm wondering if a regular old workstation could
On Thu, May 19, 2011, Warren Kumari wrote:
Just wanted to say yes, this is entirely what I meant. Of course the
smaller the file the more pointless it gets but still... If the file was
1GB instead of just 7 bytes I'm wondering if a regular old workstation could
put it back together in
Lets say you had a file that was 1,000,000,000 characters consisting of
8,000,000,000bits. What if instead of transferring that file through the
interwebs you transmitted a mathematical equation to tell a computer on the
other end how to *construct* that file. First you'd feed the file into a
We call that Compression.
-j
On Wed, May 18, 2011 at 1:07 PM, Landon Stewart lstew...@superb.net wrote:
Lets say you had a file that was 1,000,000,000 characters consisting of
8,000,000,000bits. What if instead of transferring that file through the
interwebs you transmitted a mathematical
That's basically what compression is. Except rarely (read: never) does your
Real Data (tm) fit just one equation, hence the various compression
algorithms that look for patterns etc etc.
-J
On Wed, May 18, 2011 at 4:07 PM, Landon Stewart lstew...@superb.net wrote:
Lets say you had a file that
Just a weird idea I had. If it's a good idea then please consider this
intellectual property.
It's easy .. the zeros are fatter than the ones.
http://dilbert.com/strips/comic/2004-12-09/
~Mike.
On Wed, May 18, 2011 at 4:07 PM, Landon Stewart lstew...@superb.net wrote:
Lets say you had a file that was 1,000,000,000 characters consisting of
8,000,000,000bits. What if instead of transferring that file through the
interwebs you transmitted a mathematical equation to tell a computer on
-Original Message-
From: Landon Stewart [mailto:lstew...@superb.net]
Sent: Wednesday, May 18, 2011 4:08 PM
To: nanog
Subject: Had an idea - looking for a math buff to tell me if it's
possible with today's technology.
Lets say you had a file that was 1,000,000,000 characters
Wildly off-topic for the NANOG mailing-list, as it has -zero- relevance to
'network operations'
Date: Wed, 18 May 2011 13:07:32 -0700
Subject: Had an idea - looking for a math buff to tell me if it's possible
with today's technology.
From: Landon Stewart lstew...@superb.net
To: nanog
On May 18, 2011, at 4:07 32PM, Landon Stewart wrote:
Lets say you had a file that was 1,000,000,000 characters consisting of
8,000,000,000bits. What if instead of transferring that file through the
interwebs you transmitted a mathematical equation to tell a computer on the
other end how to
On Wed, May 18, 2011 at 4:18 PM, Michael Holstein
michael.holst...@csuohio.edu wrote:
Just a weird idea I had. If it's a good idea then please consider this
intellectual property.
It's easy .. the zeros are fatter than the ones.
no no no.. it's simply, since the OP posited a math solution,
On Wednesday, May 18, 2011 at 2:18 PM, Dorn Hetzel wrote:
On Wed, May 18, 2011 at 4:07 PM, Landon Stewart lstew...@superb.net wrote:
Lets say you had a file that was 1,000,000,000 characters consisting of
8,000,000,000bits. What if instead of transferring that file through the
interwebs
The concept is called fractals where you can compress the image and send the
values and recreate the image. There was a body of work on the subject, I
would say in the mid to late eighties where two Georgia Tech professors
started a company doing it.
John (ISDN) Lee
On Wed, May 18, 2011 at 4:07
Stefan Fouant sfou...@shortestpathfirst.net wrote on 05/18/2011
04:19:26 PM:
Lets say you had a file that was 1,000,000,000 characters consisting
of
http://www.riverbed.com/us/
http://www.juniper.net/us/en/products-services/application-acceleration/wxc-
series/
In a message written on Wed, May 18, 2011 at 04:33:34PM -0400, Christopher
Morrow wrote:
no no no.. it's simply, since the OP posited a math solution, md5.
ship the size of file + hash, compute file on the other side. All
files can be moved anywhere regardless of the size of the file in a
On Wed, May 18, 2011 at 3:33 PM, Christopher Morrow
morrowc.li...@gmail.com wrote:
On Wed, May 18, 2011 at 4:18 PM, Michael Holstein
michael.holst...@csuohio.edu wrote:
Just a weird idea I had. If it's a good idea then please consider this
intellectual property.
It's easy .. the zeros are
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On May 18, 2011, at 4:03 PM, Leo Bicknell wrote:
Bah, you should include the solution, it's so trivial.
Generate all possible files and then do an index lookup on the MD5.
It's a little CPU heavy, but darn simple to code.
Isn't this essentially
On Wed, May 18, 2011 at 4:47 PM, Joe Loiacono jloia...@csc.com wrote:
You also need to include Silver Peak.
only if you like random failures.
I wonder if this is possible:
- Take a hash of the original file. Keep a counter.
- Generate data in some sequential method on sender side (for example simply
starting at 0 and iterating until you generate the same as the original
data)
- Each time you iterate, take the hash of the generated
On Thu, 19 May 2011 00:26:26 BST, Heath Jones said:
I wonder if this is possible:
- Take a hash of the original file. Keep a counter.
- Generate data in some sequential method on sender side (for example simply
starting at 0 and iterating until you generate the same as the original
data)
-
My point here is it IS possible to transfer just a hash and counter value
and effectively generate identical data at the remote end.
The limit that will be hit is the difficulty of generating and comparing
hash values with current processing power.
I'm proposing iterating through generated data
try itu v.42bis
Iridescent iPhone
+1 972 757 8894
On May 18, 2011, at 15:07, Landon Stewart lstew...@superb.net wrote:
Lets say you had a file that was 1,000,000,000 characters consisting of
8,000,000,000bits. What if instead of transferring that file through the
interwebs you
On Wed, May 18, 2011 at 8:03 PM, Heath Jones hj1...@gmail.com wrote:
My point here is it IS possible to transfer just a hash and counter value
and effectively generate identical data at the remote end.
The limit that will be hit is the difficulty of generating and comparing
hash values with
Compression is one result.
But this is sometimes referred to as the inverse problem: Given a
set of data tell me a function which fits it (or fits it to some
tolerance.) It's important in statistics and all kinds of data
analyses.
Another area is fourier transforms which basically sums sine
On Thu, May 19, 2011 at 12:26:26AM +0100, Heath Jones wrote:
I wonder if this is possible:
- Take a hash of the original file. Keep a counter.
- Generate data in some sequential method on sender side (for example simply
starting at 0 and iterating until you generate the same as the original
Ha! I was wondering this the whole time - if the size of the counter would
make it a zero sum game. That sux! :)
On 19 May 2011 03:52, Brett Frankenberger rbf+na...@panix.com wrote:
On Thu, May 19, 2011 at 12:26:26AM +0100, Heath Jones wrote:
I wonder if this is possible:
- Take a hash of
42 matches
Mail list logo
