Block #433,923

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/7/2014, 10:06:35 PM · Difficulty 10.3466 · 6,380,247 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7980b661d9aef1b9b04e35c57a39ceac9dd499ddb3f4fabd635c2645c5bc8453

Height

#433,923

Difficulty

10.346616

Transactions

6

Size

1.30 KB

Version

2

Bits

0a58bbd8

Nonce

105,691

Timestamp

3/7/2014, 10:06:35 PM

Confirmations

6,380,247

Merkle Root

9d4b5c5017b387fed7706bb81b51a33051d67a62005aeb5a0d98201b74750519
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.

5.361 × 10⁹³(94-digit number)
53615021307733485287…13926699135356993561
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
5.361 × 10⁹³(94-digit number)
53615021307733485287…13926699135356993561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.072 × 10⁹⁴(95-digit number)
10723004261546697057…27853398270713987121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.144 × 10⁹⁴(95-digit number)
21446008523093394114…55706796541427974241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.289 × 10⁹⁴(95-digit number)
42892017046186788229…11413593082855948481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.578 × 10⁹⁴(95-digit number)
85784034092373576459…22827186165711896961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.715 × 10⁹⁵(96-digit number)
17156806818474715291…45654372331423793921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.431 × 10⁹⁵(96-digit number)
34313613636949430583…91308744662847587841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.862 × 10⁹⁵(96-digit number)
68627227273898861167…82617489325695175681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.372 × 10⁹⁶(97-digit number)
13725445454779772233…65234978651390351361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.745 × 10⁹⁶(97-digit number)
27450890909559544467…30469957302780702721
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,757,431 XPM·at block #6,814,169 · 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