Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.compression > #1209

Re: Compressing data using Goldbach's conjecture?

From Ernst <Ernst_Berg@sbcglobal.net>
Newsgroups comp.compression
Subject Re: Compressing data using Goldbach's conjecture?
Date 2012-04-06 20:16 -0700
Organization http://groups.google.com
Message-ID <26724329.873.1333768560328.JavaMail.geo-discussion-forums@pbcsc9> (permalink)
References <6f3960da-3058-41fc-8770-0db735674034@z31g2000vbt.googlegroups.com> <31216091.382.1332065962247.JavaMail.geo-discussion-forums@ynnk21>

Show all headers | View raw


On Sunday, March 18, 2012 3:19:22 AM UTC-7, Waseihou Watashi wrote:
> On Sunday, March 18, 2012 9:17:11 AM UTC+1, Waseihou Watashi wrote:
> > Suppose that Bob wants to send a message of data to Alice through a
> > computer network, the message can be represented as a number. Both Bob
> > and Alice have a list of prime numbers in a table and for each such a
> > number they know an index in the table.
> > 
> > According to Goldbach's conjecture, any even number can be represented
> > as a sum of two primes.
> > 
> > http://en.wikipedia.org/wiki/Goldbach%27s_conjecture
> > 
> > Then the message m can be encoded in this way:
> > 
> > m = p + q + f
> > 
> > where p, q are primes and f is a flag which is 1 if m is odd,
> > otherwise it is 0
> > 
> > So it would work like this:
> > 
> > find such p and q that p + q = m - f
> > and their position in the table of primes
> > 
> > send their positions through the network
> > 
> > The aim is actually not to compress all data, but knowing that Bob and
> > Alice have both a set of same data find an usefuk information that can
> > be send with less cost.
> 
> Would it be possible to find p,q,s such that:
> 
> M = P1^2 + S1
> S1 = P2^2 + S2
> S2 = P3^2 + S3
> ...
> Si = Pi+1^2 + Si+1
> ...
> Sn is a prime number
> Pi is a prime number
> 
> and the algorithm would be fast enough?
> 
> Maybe I actually want a method how to construct an effective algorithm for a given block of data that compress it or at least represent it and it uses only primers or other numbers from well known sequences so that those numbers cannot be subjected to any patent or copyright.
Um, If there is a dataset such that one can simply index that to obtain some data it woudl require the size of the data plus at least one bit


On Sunday, March 18, 2012 3:19:22 AM UTC-7, Waseihou Watashi wrote:
> On Sunday, March 18, 2012 9:17:11 AM UTC+1, Waseihou Watashi wrote:
> > Suppose that Bob wants to send a message of data to Alice through a
> > computer network, the message can be represented as a number. Both Bob
> > and Alice have a list of prime numbers in a table and for each such a
> > number they know an index in the table.
> > 
> > According to Goldbach's conjecture, any even number can be represented
> > as a sum of two primes.
> > 
> > http://en.wikipedia.org/wiki/Goldbach%27s_conjecture
> > 
> > Then the message m can be encoded in this way:
> > 
> > m = p + q + f
> > 
> > where p, q are primes and f is a flag which is 1 if m is odd,
> > otherwise it is 0
> > 
> > So it would work like this:
> > 
> > find such p and q that p + q = m - f
> > and their position in the table of primes
> > 
> > send their positions through the network
> > 
> > The aim is actually not to compress all data, but knowing that Bob and
> > Alice have both a set of same data find an usefuk information that can
> > be send with less cost.
> 
> Would it be possible to find p,q,s such that:
> 
> M = P1^2 + S1
> S1 = P2^2 + S2
> S2 = P3^2 + S3
> ...
> Si = Pi+1^2 + Si+1
> ...
> Sn is a prime number
> Pi is a prime number
> 
> and the algorithm would be fast enough?
> 
> Maybe I actually want a method how to construct an effective algorithm for a given block of data that compress it or at least represent it and it uses only primers or other numbers from well known sequences so that those numbers cannot be subjected to any patent or copyright.

Um, this is a simple conversation with no qualifiers and no proof.  I do not want to fight. I have nothing to defend.

 As far as I can tell it is possible to do something similar to what you suggest.
 I think you are describing an Indirect Transfer Protocol.  Such that Alice gets a data and from that she constructs the message. But the actual message isn't the data she gets.

 I just asked if anyone on BitTorrent was interested in an Indirect Transfer Protocol.  

 No one was interested so I am moving on to other projects.


You have to admit that if we can download the instructions to construct a file and not traffic in the actual data there are legal aspects.  Perhaps more for China and such than the USA.  I admit I'd like to see more freedom for many of this world.

 Anyway.. This is a strictly opinion-based reply; I do see it.  I do know how I would construct such a thing. 

 Good luck!  I think I get your drift.

Back to comp.compression | Previous | NextPrevious in thread | Next in thread | Find similar | Unroll thread


Thread

Compressing data using Goldbach's conjecture? Waseihou Watashi <waseihou@gmail.com> - 2012-03-18 01:17 -0700
  Re: Compressing data using Goldbach's conjecture? Robert Wessel <robertwessel2@yahoo.com> - 2012-03-18 04:56 -0500
    Re: Compressing data using Goldbach's conjecture? James Dow Allen <jdallen2000@yahoo.com> - 2012-03-18 07:09 -0700
  Re: Compressing data using Goldbach's conjecture? Waseihou Watashi <waseihou@gmail.com> - 2012-03-18 03:19 -0700
    Re: Compressing data using Goldbach's conjecture? James Dow Allen <jdallen2000@yahoo.com> - 2012-03-18 06:59 -0700
      Re: Compressing data using Goldbach's conjecture? Waseihou Watashi <waseihou@gmail.com> - 2012-03-18 07:38 -0700
        Re: Compressing data using Goldbach's conjecture? "George Johnson" <matrix29@charter.net> - 2012-03-19 09:14 -0400
      Re: Compressing data using Goldbach's conjecture? glen herrmannsfeldt <gah@ugcs.caltech.edu> - 2012-03-18 19:30 +0000
    Re: Compressing data using Goldbach's conjecture? Ernst <Ernst_Berg@sbcglobal.net> - 2012-04-06 20:16 -0700
  Re: Compressing data using Goldbach's conjecture? "George Johnson" <matrix29@charter.net> - 2012-03-19 09:03 -0400
    Re: Compressing data using Goldbach's conjecture? Willem <willem@toad.stack.nl> - 2012-03-19 16:25 +0000
      Re: Compressing data using Goldbach's conjecture? "George Johnson" <matrix29@charter.net> - 2012-03-19 23:15 -0400
        Re: Compressing data using Goldbach's conjecture? michael.pohoreski@gmail.com - 2012-09-28 13:20 -0700
          Re: Compressing data using Goldbach's conjecture? "George Johnson" <matrix29@charter.net> - 2012-09-30 07:02 -0400
      Re: Compressing data using Goldbach's conjecture? "George Johnson" <matrix29@charter.net> - 2012-03-19 23:36 -0400
        Re: Compressing data using Goldbach's conjecture? Michael Pohoreski <michael.pohoreski@gmail.com> - 2012-09-29 02:19 -0700
          Re: Compressing data using Goldbach's conjecture? Thomas Richter <thor@math.tu-berlin.de> - 2012-09-29 23:43 +0200
            Re: Compressing data using Goldbach's conjecture? "George Johnson" <matrix29@charter.net> - 2012-09-30 08:47 -0400
              Re: Compressing data using Goldbach's conjecture? Thomas Richter <thor@math.tu-berlin.de> - 2012-09-30 18:25 +0200
          Re: Compressing data using Goldbach's conjecture? "George Johnson" <matrix29@charter.net> - 2012-09-30 07:14 -0400
      Re: Compressing data using Goldbach's conjecture? "George Johnson" <matrix29@charter.net> - 2012-03-21 00:34 -0400
      Re: Compressing data using Goldbach's conjecture? "George Johnson" <matrix29@charter.net> - 2012-03-22 11:46 -0400
  Re: Compressing data using Goldbach's conjecture? "George Johnson" <matrix29@charter.net> - 2012-03-19 09:27 -0400

csiph-web