Block #454,649

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/22/2014, 2:25:53 AM · Difficulty 10.3963 · 6,362,314 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8e196600f42d92816adcf4d445c57da80e14f445f75097d39286fc392e13ff78

Height

#454,649

Difficulty

10.396340

Transactions

2

Size

1.16 KB

Version

2

Bits

0a657685

Nonce

179,924

Timestamp

3/22/2014, 2:25:53 AM

Confirmations

6,362,314

Merkle Root

8fb0dad2feb4fc6ca1538a62f342734bc04cb102906f94f4a0f409bbc73b2df6
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.

1.143 × 10¹⁰¹(102-digit number)
11432691686177586251…09861539628650488359
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
1.143 × 10¹⁰¹(102-digit number)
11432691686177586251…09861539628650488359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.286 × 10¹⁰¹(102-digit number)
22865383372355172502…19723079257300976719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.573 × 10¹⁰¹(102-digit number)
45730766744710345005…39446158514601953439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.146 × 10¹⁰¹(102-digit number)
91461533489420690010…78892317029203906879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.829 × 10¹⁰²(103-digit number)
18292306697884138002…57784634058407813759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.658 × 10¹⁰²(103-digit number)
36584613395768276004…15569268116815627519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.316 × 10¹⁰²(103-digit number)
73169226791536552008…31138536233631255039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.463 × 10¹⁰³(104-digit number)
14633845358307310401…62277072467262510079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.926 × 10¹⁰³(104-digit number)
29267690716614620803…24554144934525020159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.853 × 10¹⁰³(104-digit number)
58535381433229241606…49108289869050040319
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,779,740 XPM·at block #6,816,962 · 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