Block #2,252,071

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/15/2017, 3:18:20 AM · Difficulty 10.9485 · 4,586,550 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
812816adf34a55b627862bc0686558d18f44a38ca326924c5cb25c3aec8941d0

Height

#2,252,071

Difficulty

10.948512

Transactions

5

Size

1.22 KB

Version

2

Bits

0af2d1a9

Nonce

671,088,124

Timestamp

8/15/2017, 3:18:20 AM

Confirmations

4,586,550

Merkle Root

c6be15e4f49187a5996da4323d1c0966345134a3258013ce12c27a67b7eb1936
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.298 × 10⁹⁵(96-digit number)
22983462738557204038…39111510041418351681
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.298 × 10⁹⁵(96-digit number)
22983462738557204038…39111510041418351681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.596 × 10⁹⁵(96-digit number)
45966925477114408076…78223020082836703361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.193 × 10⁹⁵(96-digit number)
91933850954228816153…56446040165673406721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.838 × 10⁹⁶(97-digit number)
18386770190845763230…12892080331346813441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.677 × 10⁹⁶(97-digit number)
36773540381691526461…25784160662693626881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.354 × 10⁹⁶(97-digit number)
73547080763383052922…51568321325387253761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.470 × 10⁹⁷(98-digit number)
14709416152676610584…03136642650774507521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.941 × 10⁹⁷(98-digit number)
29418832305353221169…06273285301549015041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.883 × 10⁹⁷(98-digit number)
58837664610706442338…12546570603098030081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.176 × 10⁹⁸(99-digit number)
11767532922141288467…25093141206196060161
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,953,256 XPM·at block #6,838,620 · 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