Block #463,645

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/28/2014, 6:54:58 AM · Difficulty 10.4129 · 6,346,810 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b6e16b0ab2844393bcb2c057eb77973e4345f0c8cdda140e960f01ee2b3ac055

Height

#463,645

Difficulty

10.412923

Transactions

3

Size

626 B

Version

2

Bits

0a69b554

Nonce

183,291

Timestamp

3/28/2014, 6:54:58 AM

Confirmations

6,346,810

Merkle Root

370f28ca9f3ea8e8592f2c2233d0c6e753f63efc96ba15e09e327ae66a79526e
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.229 × 10⁹⁸(99-digit number)
22292733605076055246…30941571655978353839
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.229 × 10⁹⁸(99-digit number)
22292733605076055246…30941571655978353839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.458 × 10⁹⁸(99-digit number)
44585467210152110492…61883143311956707679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.917 × 10⁹⁸(99-digit number)
89170934420304220985…23766286623913415359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.783 × 10⁹⁹(100-digit number)
17834186884060844197…47532573247826830719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.566 × 10⁹⁹(100-digit number)
35668373768121688394…95065146495653661439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.133 × 10⁹⁹(100-digit number)
71336747536243376788…90130292991307322879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.426 × 10¹⁰⁰(101-digit number)
14267349507248675357…80260585982614645759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.853 × 10¹⁰⁰(101-digit number)
28534699014497350715…60521171965229291519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.706 × 10¹⁰⁰(101-digit number)
57069398028994701430…21042343930458583039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.141 × 10¹⁰¹(102-digit number)
11413879605798940286…42084687860917166079
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,727,726 XPM·at block #6,810,454 · 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