Block #479,081

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/7/2014, 11:46:13 AM · Difficulty 10.5003 · 6,330,679 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
70ea24a17bb438e69604ad3e34eaebc498a497ca52b49381430e4d7df5780d86

Height

#479,081

Difficulty

10.500339

Transactions

4

Size

1.58 KB

Version

2

Bits

0a801634

Nonce

8,081

Timestamp

4/7/2014, 11:46:13 AM

Confirmations

6,330,679

Merkle Root

de3c187d333d690370902db8e603e622cbf070ad63e7d3b3752d5dd09e7fc2b6
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.943 × 10⁹⁷(98-digit number)
79434903039575658623…81176341523015838721
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.943 × 10⁹⁷(98-digit number)
79434903039575658623…81176341523015838721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.588 × 10⁹⁸(99-digit number)
15886980607915131724…62352683046031677441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.177 × 10⁹⁸(99-digit number)
31773961215830263449…24705366092063354881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.354 × 10⁹⁸(99-digit number)
63547922431660526898…49410732184126709761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.270 × 10⁹⁹(100-digit number)
12709584486332105379…98821464368253419521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.541 × 10⁹⁹(100-digit number)
25419168972664210759…97642928736506839041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.083 × 10⁹⁹(100-digit number)
50838337945328421518…95285857473013678081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.016 × 10¹⁰⁰(101-digit number)
10167667589065684303…90571714946027356161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.033 × 10¹⁰⁰(101-digit number)
20335335178131368607…81143429892054712321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.067 × 10¹⁰⁰(101-digit number)
40670670356262737214…62286859784109424641
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,722,166 XPM·at block #6,809,759 · 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