Block #491,767

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/14/2014, 5:02:45 PM · Difficulty 10.6854 · 6,316,966 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e187896531d9992578cecb7ac44460a6faef0eecbbbccd88d0c8694fd747ab49

Height

#491,767

Difficulty

10.685423

Transactions

10

Size

2.91 KB

Version

2

Bits

0aaf77e0

Nonce

18,837,233

Timestamp

4/14/2014, 5:02:45 PM

Confirmations

6,316,966

Merkle Root

8c5cd434d20f2287970b9af6607f8d295c4124bce3cc306dee976041488b19b9
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.

7.581 × 10⁹³(94-digit number)
75813833388764097017…03218956760806789121
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
7.581 × 10⁹³(94-digit number)
75813833388764097017…03218956760806789121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.516 × 10⁹⁴(95-digit number)
15162766677752819403…06437913521613578241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.032 × 10⁹⁴(95-digit number)
30325533355505638806…12875827043227156481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.065 × 10⁹⁴(95-digit number)
60651066711011277613…25751654086454312961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.213 × 10⁹⁵(96-digit number)
12130213342202255522…51503308172908625921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.426 × 10⁹⁵(96-digit number)
24260426684404511045…03006616345817251841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.852 × 10⁹⁵(96-digit number)
48520853368809022090…06013232691634503681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.704 × 10⁹⁵(96-digit number)
97041706737618044181…12026465383269007361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.940 × 10⁹⁶(97-digit number)
19408341347523608836…24052930766538014721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.881 × 10⁹⁶(97-digit number)
38816682695047217672…48105861533076029441
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,713,910 XPM·at block #6,808,732 · 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