Slashdot Mirror
Illegal Prime Number Unzips to DeCSS
Bob9113 writes: "A person named Phil Carmody has found a very interesting prime number. When converted to hexadecimal, the result is a gzip that contains a DeCSS implementation. I've posted a short bit of Java
here that takes the prime as a command line parameter and dumps the result to standard out if you want to test it." Very clever, I just wish the background on that page wasn't headache inducing.
Will this number now be a prime suspect?
---
ticks = jiffies;
while (ticks == jiffies);
ticks = jiffies;
Have you read my journal today?
RIAA Petitions Congress To Ban Number Theory
Mathematicians Declared "Enemy of Intellectual Property (and the American Way)"
Rambus Patents Prime Numbers
Any guesses about which one you'll see first? :)
Dewey, what part of this looks like authorities should be involved?
This is very easy.
If you want to find something in a prime number, you figure out what you're looking for--in this case, the gziped code. You then search for prime numbers that start with those digits. Since there are an infinite number of prime numbers, you will always be able to find one (given enough time).
You could also find DeCSS gzipped in a section of Pi or e, based on similar ideas.
Inspired by Phil's effort, a prime number encoding of the source of efdtt.c has been contributed by Charles M. Hannum.
A person named Phil Carmody has found a very interesting prime number. When converted to hexadecimal, the result is a gzip that contains a DeCSS implementation.
The odds of this happening in this order are slim to none. If you believe in this chain of the evenets I have some stock to sell you. What really happened was most certainly the reverse. He took gzip that contained DeCSS, converted it to hex and analyzed the number. The good geek karma dictated that this number should be a prime and the rest is now the history =)
This can be persuaive because it shows a way to use a computer program (gzip) to circumvent CSS when that program was clearly never intended as a circumvention method in the first place. This is an attack on DMCA in the broad, rather than on CSS and MPAA in particular.
as i recall, numbers alone can never be considered intellectual property. that's what bit intel in the ass with the 486. all the companies that made knockoffs were calling them 486's, diluting the namespace. so intel came out with "pentium" to solve that problem.
the question now is whether the courts would consider this just a number, or an encoding of the decss data into a number.
#define F(x) int main(){printf(#x,10,#x);}
F(#define F(x) int main(){printf(#x,10,#x);}%cF(%s))
-- these are only opinions and they might not be mine.
The fact of the matter is that every piece of digital information is nothing but a sting of digits.
This one is interesting in that the number happens to be prime.
(Is this a mathematical trick? If not how on earth did the author make this discovery?)
My question for a lawyer is this; does Microsoft have legal copyright on some numbers?
If so, do they also own every number that can be derived mathematically from them?
If not, can we legally store any copyrighted files with say 1 subtracted from the number?
(Think of it as insecure encryption with a trivial key and algorithm.)
And finally if this act would be illegal, then surely as a copyright holder I own rights to all digital data as you can mathematically transform between any two numbers without much difficulty.
Prime numbers are countable. You in theory can be able to reduce this from 1400+ digits by saying it's the 12345...42153th prime (perhaps about 100 digits).
However determining this number would be (ludicrously) computionally expensive. Another quest for distributed.net?
Why work on the CSS code, why not the keys themselves? That would be more interesting.
If DECSS is legal in Canada/Mexico, why not bring the lawsuit up as an illegal trade practice under NAFTA?
There was a short science fiction story that went something like this.
Alien asks to view all Earth encyclopedias.
Alien encodes all the content as a single very massive integer.
Alien treats number as a fraction between 0 and 1.
Alien takes out a crystal rod, measures, and makes a single mark on it.
Alien goes home with the rod to decode later.
Of course, a few terabytes of digits would exceed the resolution of any atomic matter, but the idea was there.
[
The formula he used to "find" this prime number can be found here:a l.html
http://www.utm.edu/research/primes/glossary/Illeg
Basically it says this:
Dlugar
Computer Go: Writing Software to Play the Ancient Game of Go
Open Source Transcendental Constant
In a revelation that could rock the foundations of science, a researcher in Pennsylvania has discovered that the digits of the transcendental constant PI encode a version of the Linux kernel. "I can't believe it," the researcher, Neil Hoffman, exclaimed. "And yet, here I am staring at what appears to be the source code for Linux kernel 5.0.0. Needless to say, my whole world-view has changed..."
Hoffman made the discovery accidentally. "I was trying to write a more efficient algorithm in C to calculate individual digits of PI. However, my relative lack of programming experience, combined with C's highly obfuscated syntax, led me to the discovery. Instead of calculating each digit and returning it as an int, my program was (for some reason I still haven't been able to figure out) converting it to its ASCII equivalent and returning it as a char."
"Then it hit me. What if some kind of secret messages, encoded in ASCII, was stored in the digits of PI? I set to work on the problem, and after several months of toil, have discovered the awesome truth. My algorithm, which applies several dozen conversions and manipulations of each digit of PI, spits out plain vanilla ASCII characters that happen to form the source code for the Linux kernel."
"I tried to compile the source code, but gcc choked on it. Apparently a later version of gcc is needed to compile the Linux 5.0.0 source code. It's too bad the code for gcc isn't encoded in another transcendental constant. Or is it? I wonder what would happen if I fed e through my algorithm..."
Many scientists are skeptical about Hoffman's discovery. One mathematician who has memorized the digits of PI to 10,000 places said, "This is the kind of nonsense one would expect to find in a tabloid such as the National Mathematics Enquirer. Or a nerd humor site. Hoffman's discovery' is obviously a hoax designed to secure government research grants."
Another scientist Segfault contacted said, "Hoffman's claim is filled with holes large enough to push Windows 95 through. Apply a little critical thinking and look at all the inconsistencies and problems with Hoffman's discovery'. ASCII is an arbitrary code. Why not EBCDIC? Also, the base 10 number system, which his PI-to-ASCII scheme is based on, is arbitrary. Why not binary numbers? Oh, and then there's the biggie: PI is infinitely long. The Linux source code is not (Windows NT, on the other hand...). Explain that, PI Boy!"
Hoffman will formally present his findings to the scientific community on March 14th at the Annual PI Day Conference and Exposition in Chicago. One conference attendee said, "Usually the PI Day expo is pretty boring, with some asinine workshops about 'The History of PI' and Teaching Techniques to Make Learning About PI More Fun for Remedial High School Students'. However, with the unfolding brouhaha surrounding the Linux-PI connection, this could be a very interesting convention. Then again, there's going to be several hundred mathematicians from around the world in attendance. It might not be that exciting after all."
In a related matter, Segfault has received an unconfirmed report that a region of the standard Mandelbrot fractal contains what appear to be the words "LINUS TORVALDS WAS HERE". In addition, the words "TRANSMETA: THIS SECRET MESSAGE IS NOT HERE YET" supposedly appear within the depths of the Julia Set.
Linus Torvalds and Benoit Mandelbrot were unavailable for comment at press time.
--
Dyolf Knip
There is an intricate mathematical reason why I did it without the tables. In short - the number is too damn big to prove _formally_ (I am a mathematician) using Elliptic Curve Primality Proving (ECPP), due to the O(n^6) runtime.
In my favour is the precedent set by the Think Geek T-shirt which has no tables either. Unless you're talking about the one with only tables, and that has no code. If ThinkGeek have an illegal T-shirt, then my prime number is just as illegal.
FatPhil
--
Also FatPhil on SoylentNews, id 863
You seem to have an odd definition of "unrelated". "Extract a sequence of pi starting at position X and continuing to position Y." is a fairly simple function, that can be defined as a decryption scheme. The numbers you find into that scheme are your encoded message and the result is your message. Just because your formula uses pi doesn't make your input unrelated to your output.
On the other hand, XOR does allow for some confusion. Imagine I take a purely random file (based off of measuring radioactive decay or some such) and then XOR it with DeCSS. Now I've got my random file and my encrypted DeCSS -- the catch is that there's no way to tell which is which. If I've got both files, I can XOR them and get DeCSS, but otherwise both files look like random noise and both files are treated "equally" by the decryption process.
To make things even more interesting, imagine two people, named Bob and Ted, who have online collections of files with random numbers in them. Now let's say Ted's a bit of a free speech advocate. So he takes a copy of DeCSS, XORs it with one of Bob's random number files, and posts it to his site as a collection of random numbers. How do you prove that it's Ted who's hosting the copy of DeCSS and not Bob? What if you force Bob to remove his set of random numbers, when someone else had used that set as an XOR decryption key for something else? What if that person had both the encrypted and unencrypted versions available (say, as a demonstration of using XOR to encrypt a file)? Using the encrypted and unencrypted versions for the third party, you could recreate Bob's (removed) key. Then you could use that key to decrypt Ted's encrypted DeCSS.
A good approximation to pi(x), the number of all primes below x, which was first given by Gauss is obtained by taking as starting point the empirical fact that the frequency of prime numbers near a very large number x is almost exactly 1/log x. From this, the number of prime numbers up to x is approximately given by the logarithmic sum Ls(x) = 1/log 2 + 1/log 3 + ... + 1/log x
which can be bounded from below by x/log x.
So, if x has 1400 digits, the number of primes below x will have 1397 digits, give or take one.
So you could save three bytes. Surely a contender for the prize for the most gratuitous use of all cpu time until the end of time.