Block #436,782

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/9/2014, 8:10:10 PM · Difficulty 10.3606 · 6,370,207 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4debe161a785cfb0ab81bd672f7bb55b99fd8e9dfb406d582b73d2ed77cfe572

Height

#436,782

Difficulty

10.360591

Transactions

8

Size

3.21 KB

Version

2

Bits

0a5c4fac

Nonce

532,379

Timestamp

3/9/2014, 8:10:10 PM

Confirmations

6,370,207

Merkle Root

f752bd5a48b0450506fbc547ae335290f336cbe6866871836f28c9d94bfe78b9
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.744 × 10⁹⁸(99-digit number)
27440450482966888650…31447558822335897601
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.744 × 10⁹⁸(99-digit number)
27440450482966888650…31447558822335897601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.488 × 10⁹⁸(99-digit number)
54880900965933777301…62895117644671795201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.097 × 10⁹⁹(100-digit number)
10976180193186755460…25790235289343590401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.195 × 10⁹⁹(100-digit number)
21952360386373510920…51580470578687180801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.390 × 10⁹⁹(100-digit number)
43904720772747021841…03160941157374361601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.780 × 10⁹⁹(100-digit number)
87809441545494043682…06321882314748723201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.756 × 10¹⁰⁰(101-digit number)
17561888309098808736…12643764629497446401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.512 × 10¹⁰⁰(101-digit number)
35123776618197617473…25287529258994892801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.024 × 10¹⁰⁰(101-digit number)
70247553236395234946…50575058517989785601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.404 × 10¹⁰¹(102-digit number)
14049510647279046989…01150117035979571201
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,700,015 XPM·at block #6,806,988 · 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