Block #433,399

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/7/2014, 1:39:11 PM · Difficulty 10.3439 · 6,375,351 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7bdc851f2748ad134f10be529e6b9ce5d58b4b75f9f21657d60fe2ad70b190c9

Height

#433,399

Difficulty

10.343934

Transactions

6

Size

1.31 KB

Version

2

Bits

0a580c16

Nonce

9,649

Timestamp

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

Confirmations

6,375,351

Merkle Root

1ce8d7bb243b542eeb6420237fd20c892f1c55f5fc0bbdcba5c6583f58a7303a
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.

2.151 × 10¹⁰⁴(105-digit number)
21513113097538289744…93623684006487279361
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
2.151 × 10¹⁰⁴(105-digit number)
21513113097538289744…93623684006487279361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.302 × 10¹⁰⁴(105-digit number)
43026226195076579489…87247368012974558721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.605 × 10¹⁰⁴(105-digit number)
86052452390153158978…74494736025949117441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.721 × 10¹⁰⁵(106-digit number)
17210490478030631795…48989472051898234881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.442 × 10¹⁰⁵(106-digit number)
34420980956061263591…97978944103796469761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.884 × 10¹⁰⁵(106-digit number)
68841961912122527182…95957888207592939521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.376 × 10¹⁰⁶(107-digit number)
13768392382424505436…91915776415185879041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.753 × 10¹⁰⁶(107-digit number)
27536784764849010873…83831552830371758081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.507 × 10¹⁰⁶(107-digit number)
55073569529698021746…67663105660743516161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.101 × 10¹⁰⁷(108-digit number)
11014713905939604349…35326211321487032321
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,714,049 XPM·at block #6,808,749 · 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