Block #433,603

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/7/2014, 4:46:13 PM · Difficulty 10.3464 · 6,373,017 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
344fcd443367bf6bd37b27d88128665aea2ac2a3503d9b7fea12e62ad2c3abba

Height

#433,603

Difficulty

10.346414

Transactions

3

Size

1.56 KB

Version

2

Bits

0a58ae93

Nonce

16,793

Timestamp

3/7/2014, 4:46:13 PM

Confirmations

6,373,017

Merkle Root

3a2677fe8f89d34913acc696d920341eeb0c6d0c75b2ef71130367abf7cb6869
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.

8.388 × 10⁹⁹(100-digit number)
83886654568013919724…14241204141843128751
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
8.388 × 10⁹⁹(100-digit number)
83886654568013919724…14241204141843128751
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.677 × 10¹⁰⁰(101-digit number)
16777330913602783944…28482408283686257501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.355 × 10¹⁰⁰(101-digit number)
33554661827205567889…56964816567372515001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.710 × 10¹⁰⁰(101-digit number)
67109323654411135779…13929633134745030001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.342 × 10¹⁰¹(102-digit number)
13421864730882227155…27859266269490060001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.684 × 10¹⁰¹(102-digit number)
26843729461764454311…55718532538980120001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.368 × 10¹⁰¹(102-digit number)
53687458923528908623…11437065077960240001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.073 × 10¹⁰²(103-digit number)
10737491784705781724…22874130155920480001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.147 × 10¹⁰²(103-digit number)
21474983569411563449…45748260311840960001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.294 × 10¹⁰²(103-digit number)
42949967138823126899…91496520623681920001
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,697,060 XPM·at block #6,806,619 · 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