Block #423,719

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/28/2014, 3:00:16 PM · Difficulty 10.3790 · 6,386,218 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dec9f7f451fd436f57aa6d261afdaba28206d7fbfc4c9fcdee607bfdaadc1e36

Height

#423,719

Difficulty

10.378961

Transactions

2

Size

4.46 KB

Version

2

Bits

0a61039c

Nonce

12,471

Timestamp

2/28/2014, 3:00:16 PM

Confirmations

6,386,218

Merkle Root

fded6d8de273908dbf316ae84b81d905d2774d9a4e1e4192204e1df9d056c9d4
Transactions (2)
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.

3.677 × 10¹⁰⁴(105-digit number)
36774484286652605087…00058000315495178241
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
3.677 × 10¹⁰⁴(105-digit number)
36774484286652605087…00058000315495178241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.354 × 10¹⁰⁴(105-digit number)
73548968573305210174…00116000630990356481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.470 × 10¹⁰⁵(106-digit number)
14709793714661042034…00232001261980712961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.941 × 10¹⁰⁵(106-digit number)
29419587429322084069…00464002523961425921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.883 × 10¹⁰⁵(106-digit number)
58839174858644168139…00928005047922851841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.176 × 10¹⁰⁶(107-digit number)
11767834971728833627…01856010095845703681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.353 × 10¹⁰⁶(107-digit number)
23535669943457667255…03712020191691407361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.707 × 10¹⁰⁶(107-digit number)
47071339886915334511…07424040383382814721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.414 × 10¹⁰⁶(107-digit number)
94142679773830669023…14848080766765629441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.882 × 10¹⁰⁷(108-digit number)
18828535954766133804…29696161533531258881
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,723,584 XPM·at block #6,809,936 · 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