Block #491,378

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/14/2014, 11:43:19 AM · Difficulty 10.6807 · 6,318,910 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e3781f6b129a20197104e92aa98b287d1624088bdded4232fbd5023585cdc5b4

Height

#491,378

Difficulty

10.680696

Transactions

9

Size

2.40 KB

Version

2

Bits

0aae421d

Nonce

711,169,405

Timestamp

4/14/2014, 11:43:19 AM

Confirmations

6,318,910

Merkle Root

6f5edff0a14b11125d1e3607884b29c971667f59ad93a5f8d6e7a5d05c9943c6
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.921 × 10⁹⁷(98-digit number)
39218828986920709398…45476389691124498721
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.921 × 10⁹⁷(98-digit number)
39218828986920709398…45476389691124498721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.843 × 10⁹⁷(98-digit number)
78437657973841418796…90952779382248997441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.568 × 10⁹⁸(99-digit number)
15687531594768283759…81905558764497994881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.137 × 10⁹⁸(99-digit number)
31375063189536567518…63811117528995989761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.275 × 10⁹⁸(99-digit number)
62750126379073135037…27622235057991979521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.255 × 10⁹⁹(100-digit number)
12550025275814627007…55244470115983959041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.510 × 10⁹⁹(100-digit number)
25100050551629254015…10488940231967918081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.020 × 10⁹⁹(100-digit number)
50200101103258508030…20977880463935836161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.004 × 10¹⁰⁰(101-digit number)
10040020220651701606…41955760927871672321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.008 × 10¹⁰⁰(101-digit number)
20080040441303403212…83911521855743344641
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,726,379 XPM·at block #6,810,287 · 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