Block #491,304

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/14/2014, 10:31:57 AM · Difficulty 10.6805 · 6,316,587 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
11eeddb9836c57d8b587f0a1c0e545726f28d6c5a2ff45eab9e8401cfc868e51

Height

#491,304

Difficulty

10.680470

Transactions

2

Size

433 B

Version

2

Bits

0aae3347

Nonce

19,892,749

Timestamp

4/14/2014, 10:31:57 AM

Confirmations

6,316,587

Merkle Root

64942719372499901a274864c08ea380bf2de7b888ca50b4ca7fe934d3c03798
Transactions (2)
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.

9.730 × 10⁹⁹(100-digit number)
97308231169181058257…62612565282565975041
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
9.730 × 10⁹⁹(100-digit number)
97308231169181058257…62612565282565975041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.946 × 10¹⁰⁰(101-digit number)
19461646233836211651…25225130565131950081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.892 × 10¹⁰⁰(101-digit number)
38923292467672423303…50450261130263900161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.784 × 10¹⁰⁰(101-digit number)
77846584935344846606…00900522260527800321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.556 × 10¹⁰¹(102-digit number)
15569316987068969321…01801044521055600641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.113 × 10¹⁰¹(102-digit number)
31138633974137938642…03602089042111201281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.227 × 10¹⁰¹(102-digit number)
62277267948275877284…07204178084222402561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.245 × 10¹⁰²(103-digit number)
12455453589655175456…14408356168444805121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.491 × 10¹⁰²(103-digit number)
24910907179310350913…28816712336889610241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.982 × 10¹⁰²(103-digit number)
49821814358620701827…57633424673779220481
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,707,163 XPM·at block #6,807,890 · 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