Block #309,215

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/13/2013, 12:03:27 PM · Difficulty 9.9948 · 6,501,622 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4dd08f28dcb71ad1f37e171c06238e4be7a86525e7068bf5586daca14fce81d1

Height

#309,215

Difficulty

9.994755

Transactions

16

Size

18.05 KB

Version

2

Bits

09fea83e

Nonce

33,848

Timestamp

12/13/2013, 12:03:27 PM

Confirmations

6,501,622

Merkle Root

9ce1d718f0bb1f0e134be35c38f8f4c3e031a344898913b3f39c3481e7a413c4
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.

6.733 × 10⁹⁵(96-digit number)
67337765564725413836…07476631815728701441
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
6.733 × 10⁹⁵(96-digit number)
67337765564725413836…07476631815728701441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.346 × 10⁹⁶(97-digit number)
13467553112945082767…14953263631457402881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.693 × 10⁹⁶(97-digit number)
26935106225890165534…29906527262914805761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.387 × 10⁹⁶(97-digit number)
53870212451780331069…59813054525829611521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.077 × 10⁹⁷(98-digit number)
10774042490356066213…19626109051659223041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.154 × 10⁹⁷(98-digit number)
21548084980712132427…39252218103318446081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.309 × 10⁹⁷(98-digit number)
43096169961424264855…78504436206636892161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.619 × 10⁹⁷(98-digit number)
86192339922848529711…57008872413273784321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.723 × 10⁹⁸(99-digit number)
17238467984569705942…14017744826547568641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.447 × 10⁹⁸(99-digit number)
34476935969139411884…28035489653095137281
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the Second 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,730,792 XPM·at block #6,810,836 · 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