<?php

include("eff_setup2.php");

$smarty = new EFFSmarty;

$smarty->assign('title','Cooperative Computing Awards');


// if breadcrumb == true, then it fill in the right trail in the issue
// Array
$smarty->assign('breadcrumb','true');

// example:
$issue = array("Awards" => "/awards/");

//Creative Commons - If you need to turn OFF the CC license, set cc = false
//$smarty->assign('cc',"false");

$smarty->assign('issue',$issue);

$content  = <<<EOT

<div id="featuretext">

<DIV ALIGN="CENTER">
<IMG SRC="images/coop-map.png" ALIGN=ABSMIDDLE WIDTH="356" HEIGHT="80"
ALT="EFF Cooperative Computing Awards" usemap="#coop-map" border="0">
<MAP NAME="coop-map">
<AREA SHAPE="RECT" ALT="Intro" COORDS="9,9,350,54" HREF="coop.php">
<AREA SHAPE="rect" alt="Rules" COORDS="16,58,56,77" HREF="coop-prime-rules.php">
<AREA SHAPE="rect" ALT="Frequently Asked Questions" COORDS="63,58,216,77" HREF="coop-faq.php">
<AREA SHAPE="rect" ALT="News/Status" COORDS="225,58,270,77" HREF="coop-news.php">
<AREA SHAPE="rect" ALT="Resources" COORDS="277,58,344,77" HREF="coop-prime-info.php">
</MAP>
<BR>
</DIV>

<BR>

<div style="border: 1px dotted #cccccc; padding: 10px;">
<h2>Please Read This First!</h2>
<p>
EFF has already received and rejected dozens of incorrect or deficient 
claims.  Please read and follow all of the rules before submitting a 
claim.  Please note especially:</p>
<p>
<strong>There is no award available for the discovery of a
mathematical
technique, algorithm, or theorem.</strong>  We will not offer a
payment or
reward for the discovery of a mathematical technique, unless that
technique
is used to determine a specific prime number in compliance with all
the other
rules below.  New discoveries in number theory or other branches of
mathematics should be directed to an appropriate forum, but we are
unable
to provide any reward for them or any evaluation of their merits.</p>

<p>
<strong>There is no award available for merely knowing how to find or
test for large prime numbers.</strong>  Methods for finding large
prime
numbers have been known for many years; however, all known methods
require substantial amounts of computer time (years of computation
on current hardware).  Our awards require that you find a particular
prime
number, not simply know a way to find prime numbers.  We already have
well-proven and well-understood computer programs capable of finding
prime
numbers -- they just take too long to work. Thus, a computer program
that would eventually find or verify prime numbers is not, by itself,
sufficient to qualify for an award.</p>

<p>
<strong>There is no award available for a secret proof or
discovery.</strong>
The rules require open publication of a discovery, and this
publication must
be made <em>prior to</em> the submission of a claim.  EFF does not
derive any
commercial benefit from improvements in number theory and is
specifically
interested in promoting open publication of research.</p>

<p>
<strong>This set of awards is intended to spur collaborative
computing.</strong>  In the past, large computations (including
factoring and
primality testing) have been successfully
carried out by teams working together over the Internet to pool their
computational resources.  These awards are intended to promote the
development
of this method of performing computations.  We consider it unlikely
that
these awards can be won by an isolated individual without access to
specialized equipment or signifiant computing resources;
<a href="http://primes.utm.edu/notes/by_year.html">for decades, the
discovery
of world-record primes has required the use of supercomputers or
Internet
collaboration</a>.  We consider it unlikely and implausible that these
awards can be won
by mathematical reasoning alone without electronic computation.</p>

<p>
<strong>The rules below will not be waived or varied.</strong>  In
particular, submissions that have not yet been validated by peer
review
will be rejected.  EFF does not offer assistance in determining the
correctness or incorrectness of a submission.  EFF appreciates the
creativity of researchers in trying to make progress in number theory
and computer science, but asks that researchers respect the fact that
our awards have a limited scope and purpose and will not be awarded
for other kinds of work, however novel or useful.  We are not a
mathematics research organization and are not in a position to help
validate, evaluate, confirm, publicize, or reward new mathematical
research.</p>

<p>
<strong>For an example of a previous valid, successful claim</strong>,
see <a href="primeclaim-43112609.txt">Mersenne Research, Inc.'s
2009 claim for 2<sup>43112609</sup>-1</a>.  Note that this claim includes
each of the elements required below.</p>
</div>

<h2>Official EFF Cooperative Computing Award Rules</h2>

<div style="padding-left:30px">
<ol start="0">
<li> <b>EFF establishes four computation awards</b>

<br><br>

<ol type="A">
<li> EFF will award <b>$50,000</b> to the first individual or group
who discovers a<br>
<b>prime number with at least 1,000,000 decimal digits</b>.<br>
[[<i>NOTE: The $50,000 award was given out on
<a href="http://www.eff.org/awards/20000406_coopaward_pr.html">Apr. 6,
2000</a></i>]]
<br><br>

</li><li> EFF will award <b>$100,000</b> to the first individual or
group
who discovers a<br>
<b>prime number with at least 10,000,000 decimal digits</b>.<br>
[[<i>NOTE: The $100,000 award was given out on
Oct. 22, 2009</i>]]
<br><br>

</li><li> EFF will award <b>$150,000</b> to the first individual or
group
who discovers a<br>

<b>prime number with at least 100,000,000 decimal digits</b>.
<br><br>

</li><li> EFF will award <b>$250,000</b> to the first individual or
group
who discovers a<br>
<b>prime number with at least 1,000,000,000 decimal digits</b>.
</li></ol>

<div style="padding-left:30px">
<b>NOTE:</b> Leading zeroes don't count!

</div>

</li><br />

<li> <b>Only one award will be given per discovery</b>

<p>
Only one computation award will be granted per prime discovery.  In a
case
where multiple awards apply, the larger award will be granted.
</p>

<p>
For example, if you happen to discover a prime with 1,000,000,000 or
more
decimal digits before the $150,000 award is claimed, you will be
eligible for the $250,000 award only.
Once an award is paid out, all other current and future claims become
ineligible for that particular award.
</p>

<p>
All awards will be disbursed.
If someone receives the $250,000 award for discovering a prime with a
1,000,000,000 or more digits and the $150,000 award has not yet been
given out,
whoever next discovers a prime with a 100,000,000 or more decimal
digits will be eligible for the $150,000 award.
</p>

<p>
In the case where two or more valid claims for the same award are
submitted, the valid claim with the earliest verifiable discovery date
will
be honored.
</p>

</li><li> <b>The primality proof must be a deterministic proof for a
distinct
integer</b>

<p>
The claim must be for the primality for a distinct integer.
The proof of primality of that distinct integer must be
constructive, definitive, reproductable, verifiable and deterministic.
</p>

<p>
<a href="http://primes.utm.edu/prove/prove2_2.html">Probable-primality
proofs</a> are not acceptable.
Claims involving
<a href="http://primes.utm.edu/glossary/page.php?sort=PRP">probable
primes</a> will not be accepted.
</p>

<p>
Your claim must explicitly identify a distinct prime number.
For example, claims involving
<a href="http://primes.utm.edu/notes/proofs/A3n.html">Mills'
Theorem real number</a> or
<a
href="http://primes.utm.edu/glossary/page.php?sort=MatijasevicPoly">Matijasevic
polynomial</a> without providing a specific solution
will not be accepted.
</p>

</li><li> <b>Full disclosure is required</b>

<p>
In the interest of promoting the state of the art of computation,
those
receiving EFF Computation Awards must allow EFF to freely publish
their
methods, algorithms, source code, scripts and detailed descriptions of
hardware without undue restrictions or costs.  EFF's publication of
this
information is intended give others the opportunity to replicate the
discovery, as well as to provide a foundation for improving on the
results.
</p>

<p>
Proofs that are "for sale" are not acceptable.  EFF will not consider
proofs that are proprietary or that are encumbered with restrictions
that get in the way of their unrestricted re-distribution.
</p>

</li><li> <b>What to include in your submission</b>

<p>
Your claim must have each the following 7 items.
Please reference each of these 7 items in your claim:
</p>

<ol type="A">
<li> Your claim must
indicate the value of the prime number
by concise formula or decimal expansion.

<p>
The EFF reserves the right to require you to provide URL
of the decimal expansion of the prime number.
</p>

</li><li> Your claim must
include a description of the primality testing method used
by those who are claiming the award.  This must include the complete
primality certificate, which includes all of the necessary information
to evaluate and reconstruct the proof.

<p>
In other words, tell us:
</p>
<ul type="square">
<li> How did you prove primality?
</li><li> Did you use the

<a
href="http://primes.utm.edu/notes/proofs/LucasLehmer.html">Lucas-Lehmer
test</a>, the
<a href="http://primes.utm.edu/programs/gallot/index.html">Proth's
Theorem</a> 
or <a href="http://www.isthe.com/chongo/src/calc/lucas-calc">some other method</a>.
</li><li> Did you pre-screen potential candidates by eliminating
values
with small factors?
</li></ul>
<br>

</li><li> Your claim must
include a description of any hardware and software used in
the primality test.

<p>
EFF reserves the right to require a more detailed
disclosure.  For example, EFF may require evidence that the hardware
was
used legally, with the owner's permission and support.
References to well known hardware and software may be given.

</p>

</li><li> Your claim must
indicate the amount of computation time, along with
a breakdown by hardware type, that was used in the primality test.
<br><br>

</li><li> Your claim must
provide the date and time in UTC (Coordinated Universal Time)
of the discovery.

<p>
Tell us when you first proved the primality of the number that you are
claiming.
</p>

</li><li id="4F"> Your claim must
include a citation and abstract of a
published paper that announces the discovery and outlines the proof
of primality.  The cited paper must be published in a refereed
academic journal with a peer review process that is approved by EFF.

<p>
We strongly recommend that you submit your paper to an appropriate
refereed academic journal of one of the following societies:
<ul>

<li> <a href="http://www.ams.org">American Mathematical Society</a>
<li> <a href="http://www.austms.org.au">Australian Mathematical
Society</a>
<li> <a href="http://camel.math.ca">Canadian Mathematical Society</a>
<li> <a href="http://www.lms.ac.uk">London Mathematical Society</a>
<li> <a href="http://www.maa.org">Mathematical Association of
America</a>
</ul>

<p>
Note that not all publications of the above societies are
appropriate refereed academic journals.
Questions about the appropriateness of a journal should be
directed to the EFF computation award question address (see rule
#9 below).
</p>

<p><b>IMPORTANT: The EFF will reject any claim that fails to provide a
citation
and abstract of a published paper that announces the discovery and
outlines the proof of primality.</b>  We do not have the resources
to evaluate the correctness of claims on our own, and we are not a
mathematical research organization and are not soliciting ideas or
discoveries about mathematics.  We are not in a position to
evaluate or help publicize mathematical ideas or discoveries.</p>

</li><li> Your claim must
provide a single point of contact, including an E-mail
address, postal address and phone number where EFF can contact you
regarding the claim.  In the case of a group effort, you must select
an
individual with whom EFF will correspond.  Providing a URL of a home
page
is encouraged but not required.

<p>
EFF reserves the right to require more information should it determine
that
the information supplied (either in the cited paper or directly as
part of
the claim) is unsubstantiated.  EFF also reserves the right to require
independent verification of any information supplied (see below).
</p>
</li></ol>

</li><li> <b>Verification of a claim</b>

<p>
The EFF reserves the right to require a claim to be verified by
independent experts of its choosing.
Failure to fully cooperate the EFF selected experts
will result in your claim being rejected.
</p>

</li><li> <b>Lump sum payment will be made to a single point of
contact</b>

<p>
Should EFF grant an award, the award funds will be paid in a lump sum
to an
individual or organization as directed by the point of contact.  It is
the
responsibility of the receiving individual or organization to pay any
and
all applicable taxes.  In the case of a group discovery, it is the
responsibility of the receiving individual or organization to
distribute
the award.
</p>

</li><li> <b>EFF board is the final authority</b>

<p>
The decisions of the EFF board of directors in granting or refusing
a claim are final.  EFF reserves the right to reject all claims by
any individual or group which has previously submitted false
or insufficient claims.
</p>

</li><li> <b>Where to send claims</b>

<p>
To make a claim, send an E-mail message containing the required
information to:

</p><div style="padding-left:30px">
<a href="mailto:coop-award-claim@eff.org">coop-award-claim@eff.org</a>
</div>

<p>
The E-mail message must have a subject containing the following words
in the following order:

</p>

<div style="padding-left:30px"><b>cooperative prime number award claim</b></div>

<p>
<b>IMPORTANT: Failure to use a proper subject in your claim related
E-mail
may result in your E-mail being ignored!</b>
</p>

<p>
It is the responsibility of those claiming the award to ensure that
the
E-mail is sent in a timely way.  EFF is not responsible for lost or
delayed
E-mail.  The EFF is not responsible for claims that were ignored
because
the proper E-mail subject was not used.
</p>

</li><li> <a name="question"><b>For more information about the
awards</b></a>

<p>
Questions about the EFF computation awards may be mailed to:
</p>

<div style="padding-left:30px">
<a
href="mailto:coop-award-question@eff.org">coop-award-question@eff.org</a>
</div>

<p>
The E-mail message must have a subject containing the following words
in the following order:
</p>

<div style="padding-left:30px"><b>cooperative prime number award
question</b></div>

<p>
Please be sure to use the proper E-mail subject or your question(s)
may
be ignored!
</p>

<p>
Please <b>do not use the above E-mail to ask questions about
mathematics</b>.
Please <b>do not use the above E-mail to ask us for help in finding or
proving the primality of a number</b>.
For questions about mathematics, discovering prime numbers and
computation, see:
</p>

<ul>
<li> <a href="http://www.eff.org/awards/">EFF Cooperative
Computing Awards
Home page</a>
</li><li> <a
href="http://w2.eff.org/awards/coop-faq.php">Frequently Asked
Questions
about the awards</a>

</li><li> <a href="http://w2.eff.org/awards/coop-prime-info.php">Prime
Number Resources and Information</a>
</li></ul>
<p>
In addition see any of the many Frequently Asked Questions (FAQs)
available on
the Web.
Ideas and remarks on prime numbers and number theory should
be posted to the appropriate newsgroup or sent to the appropriate
refereed academic journal.
</p>

</li><li> <b>Updates to the rules</b>

<p>
The EFF reserves the right to make modifications to these rules in
order
to correct errors, remove ambiguity, and for clarification.
</p>

</li></ol>

<div class="clear"> <div>

EOT;

global $REQUEST_URI;
$smarty->assign('content',$content);
$smarty->display('generic.tpl',$REQUEST_URI);

?>

