Block #3,374,202

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/29/2019, 4:28:17 PM · Difficulty 10.9946 · 3,436,871 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a89c570f4a53f7122b2614d0a8569124d60c015bdc9423a8e3db3035b9ea77f8

Height

#3,374,202

Difficulty

10.994625

Transactions

7

Size

2.62 KB

Version

2

Bits

0afe9fc6

Nonce

1,263,444,726

Timestamp

9/29/2019, 4:28:17 PM

Confirmations

3,436,871

Merkle Root

3d24ff34625d34b1f81c1b511f38e525de54c82a312e859e2e0682a9f2df7b1b
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.

5.004 × 10⁹⁶(97-digit number)
50043987641807388397…86237463555297263359
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
5.004 × 10⁹⁶(97-digit number)
50043987641807388397…86237463555297263359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.000 × 10⁹⁷(98-digit number)
10008797528361477679…72474927110594526719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.001 × 10⁹⁷(98-digit number)
20017595056722955359…44949854221189053439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.003 × 10⁹⁷(98-digit number)
40035190113445910718…89899708442378106879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.007 × 10⁹⁷(98-digit number)
80070380226891821436…79799416884756213759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.601 × 10⁹⁸(99-digit number)
16014076045378364287…59598833769512427519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.202 × 10⁹⁸(99-digit number)
32028152090756728574…19197667539024855039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.405 × 10⁹⁸(99-digit number)
64056304181513457148…38395335078049710079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.281 × 10⁹⁹(100-digit number)
12811260836302691429…76790670156099420159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.562 × 10⁹⁹(100-digit number)
25622521672605382859…53581340312198840319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.124 × 10⁹⁹(100-digit number)
51245043345210765719…07162680624397680639
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,732,689 XPM·at block #6,811,072 · 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