Block #490,198

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/13/2014, 5:42:23 PM · Difficulty 10.6741 · 6,335,010 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e0811e35c4b3e1d7101dcc881dded9c5392148beb29a8430988b0e8151f0a938

Height

#490,198

Difficulty

10.674121

Transactions

5

Size

1.85 KB

Version

2

Bits

0aac933a

Nonce

258,872,078

Timestamp

4/13/2014, 5:42:23 PM

Confirmations

6,335,010

Merkle Root

4302fc6af65c531e12e24b9a84520bd5e893a19da6da6efd8e7524fe193ee685
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.

1.796 × 10¹⁰⁰(101-digit number)
17960660183740456171…46529890154605731841
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
1.796 × 10¹⁰⁰(101-digit number)
17960660183740456171…46529890154605731841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.592 × 10¹⁰⁰(101-digit number)
35921320367480912343…93059780309211463681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.184 × 10¹⁰⁰(101-digit number)
71842640734961824686…86119560618422927361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.436 × 10¹⁰¹(102-digit number)
14368528146992364937…72239121236845854721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.873 × 10¹⁰¹(102-digit number)
28737056293984729874…44478242473691709441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.747 × 10¹⁰¹(102-digit number)
57474112587969459748…88956484947383418881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.149 × 10¹⁰²(103-digit number)
11494822517593891949…77912969894766837761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.298 × 10¹⁰²(103-digit number)
22989645035187783899…55825939789533675521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.597 × 10¹⁰²(103-digit number)
45979290070375567799…11651879579067351041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.195 × 10¹⁰²(103-digit number)
91958580140751135598…23303759158134702081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.839 × 10¹⁰³(104-digit number)
18391716028150227119…46607518316269404161
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,845,758 XPM·at block #6,825,207 · 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