Block #452,504

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/20/2014, 3:20:51 PM · Difficulty 10.3903 · 6,353,937 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2f4eb70419ae5bb1101dd24153c8f484793252f3c905f971341f15d30e4cdba3

Height

#452,504

Difficulty

10.390262

Transactions

9

Size

2.75 KB

Version

2

Bits

0a63e833

Nonce

69,747

Timestamp

3/20/2014, 3:20:51 PM

Confirmations

6,353,937

Merkle Root

c5511ce8ad03bb48ea4096d5ac7d842c0326bbdff28ad048ea4dde489510239f
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.695 × 10⁹⁷(98-digit number)
56951744809686481127…19620615954286681601
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.695 × 10⁹⁷(98-digit number)
56951744809686481127…19620615954286681601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.139 × 10⁹⁸(99-digit number)
11390348961937296225…39241231908573363201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.278 × 10⁹⁸(99-digit number)
22780697923874592450…78482463817146726401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.556 × 10⁹⁸(99-digit number)
45561395847749184901…56964927634293452801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.112 × 10⁹⁸(99-digit number)
91122791695498369803…13929855268586905601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.822 × 10⁹⁹(100-digit number)
18224558339099673960…27859710537173811201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.644 × 10⁹⁹(100-digit number)
36449116678199347921…55719421074347622401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.289 × 10⁹⁹(100-digit number)
72898233356398695842…11438842148695244801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.457 × 10¹⁰⁰(101-digit number)
14579646671279739168…22877684297390489601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.915 × 10¹⁰⁰(101-digit number)
29159293342559478337…45755368594780979201
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,695,616 XPM·at block #6,806,440 · 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