Block #441,889

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/13/2014, 11:05:16 AM · Difficulty 10.3495 · 6,374,268 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3110e8504340aa9be4988a0c660667b8e00c2ba4cab3bc78b050e2bd72a3201c

Height

#441,889

Difficulty

10.349455

Transactions

1

Size

935 B

Version

2

Bits

0a5975e7

Nonce

148,471

Timestamp

3/13/2014, 11:05:16 AM

Confirmations

6,374,268

Merkle Root

00f361c728914878da023018a6ed697317c42943069483144cde6f1c273881c0
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.

6.073 × 10⁹³(94-digit number)
60737322451073158286…97272824291176705281
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
6.073 × 10⁹³(94-digit number)
60737322451073158286…97272824291176705281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.214 × 10⁹⁴(95-digit number)
12147464490214631657…94545648582353410561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.429 × 10⁹⁴(95-digit number)
24294928980429263314…89091297164706821121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.858 × 10⁹⁴(95-digit number)
48589857960858526629…78182594329413642241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.717 × 10⁹⁴(95-digit number)
97179715921717053258…56365188658827284481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.943 × 10⁹⁵(96-digit number)
19435943184343410651…12730377317654568961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.887 × 10⁹⁵(96-digit number)
38871886368686821303…25460754635309137921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.774 × 10⁹⁵(96-digit number)
77743772737373642606…50921509270618275841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.554 × 10⁹⁶(97-digit number)
15548754547474728521…01843018541236551681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.109 × 10⁹⁶(97-digit number)
31097509094949457042…03686037082473103361
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,773,378 XPM·at block #6,816,156 · 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