Block #528,366

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/6/2014, 2:45:57 PM · Difficulty 10.8866 · 6,278,051 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ab00e3e962f3f87246f655823eefa60f02a3eb76a3dc0c36a97a104bd9f78c69

Height

#528,366

Difficulty

10.886636

Transactions

1

Size

696 B

Version

2

Bits

0ae2fa8f

Nonce

250,331

Timestamp

5/6/2014, 2:45:57 PM

Confirmations

6,278,051

Merkle Root

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

7.352 × 10⁹¹(92-digit number)
73525679158626629620…43168073445847776641
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
7.352 × 10⁹¹(92-digit number)
73525679158626629620…43168073445847776641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.470 × 10⁹²(93-digit number)
14705135831725325924…86336146891695553281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.941 × 10⁹²(93-digit number)
29410271663450651848…72672293783391106561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.882 × 10⁹²(93-digit number)
58820543326901303696…45344587566782213121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.176 × 10⁹³(94-digit number)
11764108665380260739…90689175133564426241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.352 × 10⁹³(94-digit number)
23528217330760521478…81378350267128852481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.705 × 10⁹³(94-digit number)
47056434661521042957…62756700534257704961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.411 × 10⁹³(94-digit number)
94112869323042085914…25513401068515409921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.882 × 10⁹⁴(95-digit number)
18822573864608417182…51026802137030819841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.764 × 10⁹⁴(95-digit number)
37645147729216834365…02053604274061639681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.529 × 10⁹⁴(95-digit number)
75290295458433668731…04107208548123279361
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,695,431 XPM·at block #6,806,416 · 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