Block #434,772

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/8/2014, 11:36:42 AM · Difficulty 10.3523 · 6,374,857 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
113975cf57b6c433702e878b37f1d73d74c7411ad6c646657ba9b8d149267e6d

Height

#434,772

Difficulty

10.352264

Transactions

4

Size

2.10 KB

Version

2

Bits

0a5a2df5

Nonce

46,211

Timestamp

3/8/2014, 11:36:42 AM

Confirmations

6,374,857

Merkle Root

f4c06fa5a8ac9b754f6124b9f48e7b7be048954bff7c79e04f84dfa74e44ce94
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.

4.904 × 10⁹⁵(96-digit number)
49041131577655898070…63599013827890675201
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
4.904 × 10⁹⁵(96-digit number)
49041131577655898070…63599013827890675201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.808 × 10⁹⁵(96-digit number)
98082263155311796141…27198027655781350401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.961 × 10⁹⁶(97-digit number)
19616452631062359228…54396055311562700801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.923 × 10⁹⁶(97-digit number)
39232905262124718456…08792110623125401601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.846 × 10⁹⁶(97-digit number)
78465810524249436912…17584221246250803201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.569 × 10⁹⁷(98-digit number)
15693162104849887382…35168442492501606401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.138 × 10⁹⁷(98-digit number)
31386324209699774765…70336884985003212801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.277 × 10⁹⁷(98-digit number)
62772648419399549530…40673769970006425601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.255 × 10⁹⁸(99-digit number)
12554529683879909906…81347539940012851201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.510 × 10⁹⁸(99-digit number)
25109059367759819812…62695079880025702401
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,721,110 XPM·at block #6,809,628 · 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