Block #541,749

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/13/2014, 3:40:35 PM · Difficulty 10.9408 · 6,274,943 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5e3e2c096872811b5943897eafa047fd485e75c5dd13e0f98ced642ee304ea89

Height

#541,749

Difficulty

10.940812

Transactions

9

Size

2.69 KB

Version

2

Bits

0af0d912

Nonce

341,760,784

Timestamp

5/13/2014, 3:40:35 PM

Confirmations

6,274,943

Merkle Root

ac21c623f7984200211d7481af4c57d74d3abdb3be34ed144ccc9b1c08e38c5d
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.

4.691 × 10¹⁰⁰(101-digit number)
46918393459397482938…14598167273527767041
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
4.691 × 10¹⁰⁰(101-digit number)
46918393459397482938…14598167273527767041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.383 × 10¹⁰⁰(101-digit number)
93836786918794965876…29196334547055534081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.876 × 10¹⁰¹(102-digit number)
18767357383758993175…58392669094111068161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.753 × 10¹⁰¹(102-digit number)
37534714767517986350…16785338188222136321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.506 × 10¹⁰¹(102-digit number)
75069429535035972700…33570676376444272641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.501 × 10¹⁰²(103-digit number)
15013885907007194540…67141352752888545281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.002 × 10¹⁰²(103-digit number)
30027771814014389080…34282705505777090561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.005 × 10¹⁰²(103-digit number)
60055543628028778160…68565411011554181121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.201 × 10¹⁰³(104-digit number)
12011108725605755632…37130822023108362241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.402 × 10¹⁰³(104-digit number)
24022217451211511264…74261644046216724481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.804 × 10¹⁰³(104-digit number)
48044434902423022528…48523288092433448961
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,777,658 XPM·at block #6,816,691 · 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