Block #2,572,524

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/18/2018, 3:33:09 PM · Difficulty 10.9949 · 4,269,811 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6db19a44b9c0d22dcbf9df6476c21629f24c2375c421186fa56089dc43b59560

Height

#2,572,524

Difficulty

10.994907

Transactions

48

Size

10.26 KB

Version

2

Bits

0afeb23d

Nonce

971,973,180

Timestamp

3/18/2018, 3:33:09 PM

Confirmations

4,269,811

Merkle Root

8653a18a5f824628b2f936011447a239173dcd6f5698a9007e713c27226e34cc
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.

1.215 × 10⁹⁴(95-digit number)
12153739851421011480…80977322432400009741
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
1.215 × 10⁹⁴(95-digit number)
12153739851421011480…80977322432400009741
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.430 × 10⁹⁴(95-digit number)
24307479702842022960…61954644864800019481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.861 × 10⁹⁴(95-digit number)
48614959405684045921…23909289729600038961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.722 × 10⁹⁴(95-digit number)
97229918811368091843…47818579459200077921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.944 × 10⁹⁵(96-digit number)
19445983762273618368…95637158918400155841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.889 × 10⁹⁵(96-digit number)
38891967524547236737…91274317836800311681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.778 × 10⁹⁵(96-digit number)
77783935049094473474…82548635673600623361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.555 × 10⁹⁶(97-digit number)
15556787009818894694…65097271347201246721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.111 × 10⁹⁶(97-digit number)
31113574019637789389…30194542694402493441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.222 × 10⁹⁶(97-digit number)
62227148039275578779…60389085388804986881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.244 × 10⁹⁷(98-digit number)
12445429607855115755…20778170777609973761
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,983,086 XPM·at block #6,842,334 · 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