Block #437,889

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/10/2014, 2:47:33 PM · Difficulty 10.3598 · 6,376,586 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2da2cd85ac1787ed4c570089c7ce20b931df8c3fa523a559309744606e11fc69

Height

#437,889

Difficulty

10.359776

Transactions

3

Size

1.59 KB

Version

2

Bits

0a5c1a48

Nonce

36,785

Timestamp

3/10/2014, 2:47:33 PM

Confirmations

6,376,586

Merkle Root

90fc4afcf54a43d21c7e28eabd0f95f5b99927dd5cb94ebf29de1e5e525e836c
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.

1.459 × 10⁹²(93-digit number)
14594111338982398611…40581169254677712641
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
1.459 × 10⁹²(93-digit number)
14594111338982398611…40581169254677712641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.918 × 10⁹²(93-digit number)
29188222677964797222…81162338509355425281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.837 × 10⁹²(93-digit number)
58376445355929594445…62324677018710850561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.167 × 10⁹³(94-digit number)
11675289071185918889…24649354037421701121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.335 × 10⁹³(94-digit number)
23350578142371837778…49298708074843402241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.670 × 10⁹³(94-digit number)
46701156284743675556…98597416149686804481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.340 × 10⁹³(94-digit number)
93402312569487351112…97194832299373608961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.868 × 10⁹⁴(95-digit number)
18680462513897470222…94389664598747217921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.736 × 10⁹⁴(95-digit number)
37360925027794940444…88779329197494435841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.472 × 10⁹⁴(95-digit number)
74721850055589880889…77558658394988871681
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,759,875 XPM·at block #6,814,474 · 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