Block #450,171

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/19/2014, 2:55:57 AM · Difficulty 10.3704 · 6,357,703 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
12ac696cead269578b7735aeb720ab6ccf45a06c8f22293654e10735efb2f56f

Height

#450,171

Difficulty

10.370437

Transactions

2

Size

1.44 KB

Version

2

Bits

0a5ed4f1

Nonce

67,402

Timestamp

3/19/2014, 2:55:57 AM

Confirmations

6,357,703

Merkle Root

3930b640743c4e6439ff110cc184d267f456d1915c467fdf500735379c0fd496
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.

4.173 × 10¹⁰²(103-digit number)
41732001002690361642…00478505403250664419
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
4.173 × 10¹⁰²(103-digit number)
41732001002690361642…00478505403250664419
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.346 × 10¹⁰²(103-digit number)
83464002005380723284…00957010806501328839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.669 × 10¹⁰³(104-digit number)
16692800401076144656…01914021613002657679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.338 × 10¹⁰³(104-digit number)
33385600802152289313…03828043226005315359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.677 × 10¹⁰³(104-digit number)
66771201604304578627…07656086452010630719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.335 × 10¹⁰⁴(105-digit number)
13354240320860915725…15312172904021261439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.670 × 10¹⁰⁴(105-digit number)
26708480641721831451…30624345808042522879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.341 × 10¹⁰⁴(105-digit number)
53416961283443662902…61248691616085045759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.068 × 10¹⁰⁵(106-digit number)
10683392256688732580…22497383232170091519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.136 × 10¹⁰⁵(106-digit number)
21366784513377465160…44994766464340183039
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,707,033 XPM·at block #6,807,873 · 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