Block #537,323

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/11/2014, 7:58:39 PM · Difficulty 10.9152 · 6,273,495 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a9b603de34685beb0995d03cc57b1c42fbeb9153260ae4414165c5504575199c

Height

#537,323

Difficulty

10.915194

Transactions

9

Size

3.93 KB

Version

2

Bits

0aea4a21

Nonce

142,346,552

Timestamp

5/11/2014, 7:58:39 PM

Confirmations

6,273,495

Merkle Root

f1fb17d1223a5ba03395a06ab74f69a7d2c8dc30a9ae2b6c33feedde8d52937b
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.

2.562 × 10⁹⁸(99-digit number)
25625386673258506170…31142175071142512641
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
2.562 × 10⁹⁸(99-digit number)
25625386673258506170…31142175071142512641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.125 × 10⁹⁸(99-digit number)
51250773346517012340…62284350142285025281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.025 × 10⁹⁹(100-digit number)
10250154669303402468…24568700284570050561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.050 × 10⁹⁹(100-digit number)
20500309338606804936…49137400569140101121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.100 × 10⁹⁹(100-digit number)
41000618677213609872…98274801138280202241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.200 × 10⁹⁹(100-digit number)
82001237354427219745…96549602276560404481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.640 × 10¹⁰⁰(101-digit number)
16400247470885443949…93099204553120808961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.280 × 10¹⁰⁰(101-digit number)
32800494941770887898…86198409106241617921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.560 × 10¹⁰⁰(101-digit number)
65600989883541775796…72396818212483235841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.312 × 10¹⁰¹(102-digit number)
13120197976708355159…44793636424966471681
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,645 XPM·at block #6,810,817 · 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