Block #309,288

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/13/2013, 12:50:58 PM · Difficulty 9.9948 · 6,500,563 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c432c4dea8f8f8056c1b146aeeb6b1faa804ed055db862fabf92c2ed05bbdea7

Height

#309,288

Difficulty

9.994780

Transactions

8

Size

2.80 KB

Version

2

Bits

09fea9e4

Nonce

103,446

Timestamp

12/13/2013, 12:50:58 PM

Confirmations

6,500,563

Merkle Root

624f992022e1fbde39908f26e095bcf3296b2ad41959ca3d208c02e848cbfce3
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.

5.183 × 10¹⁰²(103-digit number)
51834034865625551091…29476185701285286561
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
5.183 × 10¹⁰²(103-digit number)
51834034865625551091…29476185701285286561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.036 × 10¹⁰³(104-digit number)
10366806973125110218…58952371402570573121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.073 × 10¹⁰³(104-digit number)
20733613946250220436…17904742805141146241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.146 × 10¹⁰³(104-digit number)
41467227892500440873…35809485610282292481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.293 × 10¹⁰³(104-digit number)
82934455785000881746…71618971220564584961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.658 × 10¹⁰⁴(105-digit number)
16586891157000176349…43237942441129169921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.317 × 10¹⁰⁴(105-digit number)
33173782314000352698…86475884882258339841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.634 × 10¹⁰⁴(105-digit number)
66347564628000705396…72951769764516679681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.326 × 10¹⁰⁵(106-digit number)
13269512925600141079…45903539529033359361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.653 × 10¹⁰⁵(106-digit number)
26539025851200282158…91807079058066718721
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,722,895 XPM·at block #6,809,850 · 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