Block #455,745

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/22/2014, 5:56:38 PM · Difficulty 10.4169 · 6,371,254 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
342ebec578348f601e7fd85d03718b35a2f7b04abcb7d751e226c5ecee6c7cbb

Height

#455,745

Difficulty

10.416854

Transactions

2

Size

1.73 KB

Version

2

Bits

0a6ab6f2

Nonce

283,031

Timestamp

3/22/2014, 5:56:38 PM

Confirmations

6,371,254

Merkle Root

28469980eca10a0e618f5476475581ed472a6e1e4d0e694c7929999b36db70dd
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.232 × 10⁹⁸(99-digit number)
32329622369059591824…24110922970997286079
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.232 × 10⁹⁸(99-digit number)
32329622369059591824…24110922970997286079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.465 × 10⁹⁸(99-digit number)
64659244738119183648…48221845941994572159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.293 × 10⁹⁹(100-digit number)
12931848947623836729…96443691883989144319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.586 × 10⁹⁹(100-digit number)
25863697895247673459…92887383767978288639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.172 × 10⁹⁹(100-digit number)
51727395790495346918…85774767535956577279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.034 × 10¹⁰⁰(101-digit number)
10345479158099069383…71549535071913154559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.069 × 10¹⁰⁰(101-digit number)
20690958316198138767…43099070143826309119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.138 × 10¹⁰⁰(101-digit number)
41381916632396277535…86198140287652618239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.276 × 10¹⁰⁰(101-digit number)
82763833264792555070…72396280575305236479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.655 × 10¹⁰¹(102-digit number)
16552766652958511014…44792561150610472959
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,860,168 XPM·at block #6,826,998 · 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