Block #3,479,226

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/17/2019, 3:28:40 AM · Difficulty 10.9791 · 3,365,617 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d1bed24a7230d99c73b636240fdca27ccd70a901c96dab0114a69c54f890b875

Height

#3,479,226

Difficulty

10.979099

Transactions

9

Size

6.47 KB

Version

2

Bits

0afaa63c

Nonce

1,262,281,821

Timestamp

12/17/2019, 3:28:40 AM

Confirmations

3,365,617

Merkle Root

638902f35e2be8f8dc3e796bd5d61b55cf06e5ec095f8e8bd98e80280a164a0a
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.

3.062 × 10⁹³(94-digit number)
30626048297288301226…21678628687056676001
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
3.062 × 10⁹³(94-digit number)
30626048297288301226…21678628687056676001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.125 × 10⁹³(94-digit number)
61252096594576602453…43357257374113352001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.225 × 10⁹⁴(95-digit number)
12250419318915320490…86714514748226704001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.450 × 10⁹⁴(95-digit number)
24500838637830640981…73429029496453408001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.900 × 10⁹⁴(95-digit number)
49001677275661281962…46858058992906816001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.800 × 10⁹⁴(95-digit number)
98003354551322563924…93716117985813632001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.960 × 10⁹⁵(96-digit number)
19600670910264512784…87432235971627264001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.920 × 10⁹⁵(96-digit number)
39201341820529025569…74864471943254528001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.840 × 10⁹⁵(96-digit number)
78402683641058051139…49728943886509056001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.568 × 10⁹⁶(97-digit number)
15680536728211610227…99457887773018112001
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:58,003,153 XPM·at block #6,844,842 · 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