Block #538,931

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/12/2014, 12:51:30 PM · Difficulty 10.9247 · 6,303,916 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
73f1cf6fbe0f5f6144ac133bdb0b495f8d1f7531e08a1789989c6cffb8c1c515

Height

#538,931

Difficulty

10.924666

Transactions

9

Size

2.26 KB

Version

2

Bits

0aecb6e7

Nonce

49,858,998

Timestamp

5/12/2014, 12:51:30 PM

Confirmations

6,303,916

Merkle Root

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

4.164 × 10⁹⁹(100-digit number)
41643872325744343952…96497492389423939201
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
4.164 × 10⁹⁹(100-digit number)
41643872325744343952…96497492389423939201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.328 × 10⁹⁹(100-digit number)
83287744651488687905…92994984778847878401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.665 × 10¹⁰⁰(101-digit number)
16657548930297737581…85989969557695756801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.331 × 10¹⁰⁰(101-digit number)
33315097860595475162…71979939115391513601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.663 × 10¹⁰⁰(101-digit number)
66630195721190950324…43959878230783027201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.332 × 10¹⁰¹(102-digit number)
13326039144238190064…87919756461566054401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.665 × 10¹⁰¹(102-digit number)
26652078288476380129…75839512923132108801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.330 × 10¹⁰¹(102-digit number)
53304156576952760259…51679025846264217601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.066 × 10¹⁰²(103-digit number)
10660831315390552051…03358051692528435201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.132 × 10¹⁰²(103-digit number)
21321662630781104103…06716103385056870401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.264 × 10¹⁰²(103-digit number)
42643325261562208207…13432206770113740801
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 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
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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,987,121 XPM·at block #6,842,846 · 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.
Privacy Policy·

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