Block #433,398

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/7/2014, 1:39:11 PM · Difficulty 10.3440 · 6,380,990 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
357af73921da759cf175e9cd0501d6e9c33872f270bb8a6fa020d106aa2e0184

Height

#433,398

Difficulty

10.344002

Transactions

5

Size

1.92 KB

Version

2

Bits

0a58107e

Nonce

215,933

Timestamp

3/7/2014, 1:39:11 PM

Confirmations

6,380,990

Merkle Root

8f85deba702933d939c45a2c8eac47eeebd7bf193b1aa5a9be94503d9cb85e86
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.637 × 10¹⁰³(104-digit number)
36373364465098737473…85215940734935175041
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.637 × 10¹⁰³(104-digit number)
36373364465098737473…85215940734935175041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.274 × 10¹⁰³(104-digit number)
72746728930197474947…70431881469870350081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.454 × 10¹⁰⁴(105-digit number)
14549345786039494989…40863762939740700161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.909 × 10¹⁰⁴(105-digit number)
29098691572078989979…81727525879481400321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.819 × 10¹⁰⁴(105-digit number)
58197383144157979958…63455051758962800641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.163 × 10¹⁰⁵(106-digit number)
11639476628831595991…26910103517925601281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.327 × 10¹⁰⁵(106-digit number)
23278953257663191983…53820207035851202561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.655 × 10¹⁰⁵(106-digit number)
46557906515326383966…07640414071702405121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.311 × 10¹⁰⁵(106-digit number)
93115813030652767933…15280828143404810241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.862 × 10¹⁰⁶(107-digit number)
18623162606130553586…30561656286809620481
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,165 XPM·at block #6,814,387 · 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