Block #494,037

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/15/2014, 11:29:16 PM · Difficulty 10.7123 · 6,322,190 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
362e4b82e29f10a92c2fa5291a9312e6df35e18045549e439d0b4eadf130724f

Height

#494,037

Difficulty

10.712298

Transactions

10

Size

2.92 KB

Version

2

Bits

0ab65923

Nonce

58,103

Timestamp

4/15/2014, 11:29:16 PM

Confirmations

6,322,190

Merkle Root

ae336d51d6d3d4b92ec709633cb6615276e890c59b4bffe5eb053b289c3a79c8
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.878 × 10¹⁰¹(102-digit number)
18780811770586989144…07507206149700126241
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.878 × 10¹⁰¹(102-digit number)
18780811770586989144…07507206149700126241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.756 × 10¹⁰¹(102-digit number)
37561623541173978288…15014412299400252481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.512 × 10¹⁰¹(102-digit number)
75123247082347956576…30028824598800504961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.502 × 10¹⁰²(103-digit number)
15024649416469591315…60057649197601009921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.004 × 10¹⁰²(103-digit number)
30049298832939182630…20115298395202019841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.009 × 10¹⁰²(103-digit number)
60098597665878365261…40230596790404039681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.201 × 10¹⁰³(104-digit number)
12019719533175673052…80461193580808079361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.403 × 10¹⁰³(104-digit number)
24039439066351346104…60922387161616158721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.807 × 10¹⁰³(104-digit number)
48078878132702692209…21844774323232317441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.615 × 10¹⁰³(104-digit number)
96157756265405384418…43689548646464634881
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,942 XPM·at block #6,816,226 · 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