Block #437,082

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/10/2014, 1:21:02 AM · Difficulty 10.3593 · 6,379,142 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a505d12012ac7bbfc9a0be6345af772ebcb13e07c69741f873397235b189ee2a

Height

#437,082

Difficulty

10.359331

Transactions

1

Size

1.02 KB

Version

2

Bits

0a5bfd1e

Nonce

196,305

Timestamp

3/10/2014, 1:21:02 AM

Confirmations

6,379,142

Merkle Root

47b0cda3b2c04726c47a10b84c7f1e1c997079dfb321b9b7a3a1ff212ea8ee2c
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.086 × 10¹⁰¹(102-digit number)
40861601137497149927…01941983150646136641
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.086 × 10¹⁰¹(102-digit number)
40861601137497149927…01941983150646136641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.172 × 10¹⁰¹(102-digit number)
81723202274994299855…03883966301292273281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.634 × 10¹⁰²(103-digit number)
16344640454998859971…07767932602584546561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.268 × 10¹⁰²(103-digit number)
32689280909997719942…15535865205169093121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.537 × 10¹⁰²(103-digit number)
65378561819995439884…31071730410338186241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.307 × 10¹⁰³(104-digit number)
13075712363999087976…62143460820676372481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.615 × 10¹⁰³(104-digit number)
26151424727998175953…24286921641352744961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.230 × 10¹⁰³(104-digit number)
52302849455996351907…48573843282705489921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.046 × 10¹⁰⁴(105-digit number)
10460569891199270381…97147686565410979841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.092 × 10¹⁰⁴(105-digit number)
20921139782398540763…94295373130821959681
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,918 XPM·at block #6,816,223 · 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