Block #459,643

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/25/2014, 11:12:14 AM · Difficulty 10.4176 · 6,367,343 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fce05ee99d3fc93060601ac51baa39a8f1655bceb2203c9c8ab699d64a3930f1

Height

#459,643

Difficulty

10.417551

Transactions

2

Size

4.47 KB

Version

2

Bits

0a6ae4a0

Nonce

342,747

Timestamp

3/25/2014, 11:12:14 AM

Confirmations

6,367,343

Merkle Root

0cfd45319bd887975d51809643fd298ac53d7af4531e16738baa820d64f53ecd
Transactions (2)
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.025 × 10¹⁰¹(102-digit number)
20258514513925253427…13200148726457570559
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.025 × 10¹⁰¹(102-digit number)
20258514513925253427…13200148726457570559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.051 × 10¹⁰¹(102-digit number)
40517029027850506855…26400297452915141119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.103 × 10¹⁰¹(102-digit number)
81034058055701013710…52800594905830282239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.620 × 10¹⁰²(103-digit number)
16206811611140202742…05601189811660564479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.241 × 10¹⁰²(103-digit number)
32413623222280405484…11202379623321128959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.482 × 10¹⁰²(103-digit number)
64827246444560810968…22404759246642257919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.296 × 10¹⁰³(104-digit number)
12965449288912162193…44809518493284515839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.593 × 10¹⁰³(104-digit number)
25930898577824324387…89619036986569031679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.186 × 10¹⁰³(104-digit number)
51861797155648648774…79238073973138063359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.037 × 10¹⁰⁴(105-digit number)
10372359431129729754…58476147946276126719
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,063 XPM·at block #6,826,985 · 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