Block #437,766

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/10/2014, 12:40:22 PM · Difficulty 10.3600 · 6,370,707 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
00c3dfda024deeaa68ff9f5a331ab9a14d34dcb711897ad878b8fe7c4a4f1e0b

Height

#437,766

Difficulty

10.360040

Transactions

13

Size

2.84 KB

Version

2

Bits

0a5c2b94

Nonce

29,765

Timestamp

3/10/2014, 12:40:22 PM

Confirmations

6,370,707

Merkle Root

fb57b8a1c97c99de1a117f6b09edb7964fdfd03c15f2350f9f76318e7000567d
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.856 × 10⁹⁷(98-digit number)
78567405642109282854…98058857409236364001
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.856 × 10⁹⁷(98-digit number)
78567405642109282854…98058857409236364001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.571 × 10⁹⁸(99-digit number)
15713481128421856570…96117714818472728001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.142 × 10⁹⁸(99-digit number)
31426962256843713141…92235429636945456001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.285 × 10⁹⁸(99-digit number)
62853924513687426283…84470859273890912001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.257 × 10⁹⁹(100-digit number)
12570784902737485256…68941718547781824001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.514 × 10⁹⁹(100-digit number)
25141569805474970513…37883437095563648001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.028 × 10⁹⁹(100-digit number)
50283139610949941026…75766874191127296001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.005 × 10¹⁰⁰(101-digit number)
10056627922189988205…51533748382254592001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.011 × 10¹⁰⁰(101-digit number)
20113255844379976410…03067496764509184001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.022 × 10¹⁰⁰(101-digit number)
40226511688759952821…06134993529018368001
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,711,840 XPM·at block #6,808,472 · 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