Block #384,067

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/31/2014, 8:17:51 PM · Difficulty 10.4048 · 6,432,116 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d799192428e5c5e3bb75875676180563f6a0ec7dee4bcc66ff81b7942cc3ee06

Height

#384,067

Difficulty

10.404779

Transactions

4

Size

1.44 KB

Version

2

Bits

0a679f91

Nonce

2,272

Timestamp

1/31/2014, 8:17:51 PM

Confirmations

6,432,116

Merkle Root

69c119961ae88b4968e0aa4e7490a3cca002fe797b252258a4972b7c667179b0
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.

7.925 × 10⁹⁸(99-digit number)
79255161249745102749…23781127138147259039
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
7.925 × 10⁹⁸(99-digit number)
79255161249745102749…23781127138147259039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.585 × 10⁹⁹(100-digit number)
15851032249949020549…47562254276294518079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.170 × 10⁹⁹(100-digit number)
31702064499898041099…95124508552589036159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.340 × 10⁹⁹(100-digit number)
63404128999796082199…90249017105178072319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.268 × 10¹⁰⁰(101-digit number)
12680825799959216439…80498034210356144639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.536 × 10¹⁰⁰(101-digit number)
25361651599918432879…60996068420712289279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.072 × 10¹⁰⁰(101-digit number)
50723303199836865759…21992136841424578559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.014 × 10¹⁰¹(102-digit number)
10144660639967373151…43984273682849157119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.028 × 10¹⁰¹(102-digit number)
20289321279934746303…87968547365698314239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.057 × 10¹⁰¹(102-digit number)
40578642559869492607…75937094731396628479
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,773,590 XPM·at block #6,816,182 · 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