Block #284,184

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/30/2013, 1:09:54 AM · Difficulty 9.9823 · 6,540,436 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
018118dd0ff69060beaeeacb63d8501d8412a4ddea69336934a314340ea6968d

Height

#284,184

Difficulty

9.982257

Transactions

7

Size

1.70 KB

Version

2

Bits

09fb752d

Nonce

25,773

Timestamp

11/30/2013, 1:09:54 AM

Confirmations

6,540,436

Merkle Root

021070d42061317267272589fce5d2164a3a753f8ebdce0a4d6d86cc135a86e5
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.105 × 10¹⁰⁰(101-digit number)
21056398403914365674…02581799641218482399
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.105 × 10¹⁰⁰(101-digit number)
21056398403914365674…02581799641218482399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.211 × 10¹⁰⁰(101-digit number)
42112796807828731349…05163599282436964799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.422 × 10¹⁰⁰(101-digit number)
84225593615657462698…10327198564873929599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.684 × 10¹⁰¹(102-digit number)
16845118723131492539…20654397129747859199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.369 × 10¹⁰¹(102-digit number)
33690237446262985079…41308794259495718399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.738 × 10¹⁰¹(102-digit number)
67380474892525970158…82617588518991436799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.347 × 10¹⁰²(103-digit number)
13476094978505194031…65235177037982873599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.695 × 10¹⁰²(103-digit number)
26952189957010388063…30470354075965747199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.390 × 10¹⁰²(103-digit number)
53904379914020776127…60940708151931494399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.078 × 10¹⁰³(104-digit number)
10780875982804155225…21881416303862988799
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,841,022 XPM·at block #6,824,619 · 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