Block #318,714

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/18/2013, 1:31:06 PM · Difficulty 10.1600 · 6,490,436 confirmations

1CC
Cunningham Chain of the First Kind

A sequence where each prime is double the previous prime plus one.

Block Header
Block Hash
be53995a5bfd66e8d3d28a661890363895d4ae67562dce2836f2a6d4811b9e7c

Height

#318,714

Difficulty

10.159958

Transactions

2

Size

1.28 KB

Version

2

Bits

0a28f300

Nonce

266,947

Timestamp

12/18/2013, 1:31:06 PM

Confirmations

6,490,436

Merkle Root

f737b44a5cd8fee3fb9106d036cb868a5170141aa4a3ca4c03c221b836e23ff1
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

1.455 × 10⁹⁸(99-digit number)
14559456528246962859…92570378016684740799
Discovered Prime Numbers
p_k = 2^k × origin − 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin − 1
1.455 × 10⁹⁸(99-digit number)
14559456528246962859…92570378016684740799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.911 × 10⁹⁸(99-digit number)
29118913056493925719…85140756033369481599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.823 × 10⁹⁸(99-digit number)
58237826112987851438…70281512066738963199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.164 × 10⁹⁹(100-digit number)
11647565222597570287…40563024133477926399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.329 × 10⁹⁹(100-digit number)
23295130445195140575…81126048266955852799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.659 × 10⁹⁹(100-digit number)
46590260890390281150…62252096533911705599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.318 × 10⁹⁹(100-digit number)
93180521780780562301…24504193067823411199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.863 × 10¹⁰⁰(101-digit number)
18636104356156112460…49008386135646822399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.727 × 10¹⁰⁰(101-digit number)
37272208712312224920…98016772271293644799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.454 × 10¹⁰⁰(101-digit number)
74544417424624449840…96033544542587289599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.490 × 10¹⁰¹(102-digit number)
14908883484924889968…92067089085174579199
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 consecutive prime numbers forming a Cunningham Chain of the First Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★★☆☆
Rarity
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,717,263 XPM·at block #6,809,149 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy