Block #3,364,141

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/21/2019, 8:21:27 PM · Difficulty 10.9955 · 3,462,744 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d18d1fbae0b987aee6df4acb110b477f527031fe9b906f043e4f68df4dfa4a1a

Height

#3,364,141

Difficulty

10.995520

Transactions

5

Size

1.28 KB

Version

2

Bits

0afeda6b

Nonce

818,163,313

Timestamp

9/21/2019, 8:21:27 PM

Confirmations

3,462,744

Merkle Root

1c1eb24d65ef62fa531224a4f2d46a64b37f2db6061721d76ab20d7972c654ff
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.

1.140 × 10⁹⁸(99-digit number)
11400398561411263800…52055636430801018879
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
1.140 × 10⁹⁸(99-digit number)
11400398561411263800…52055636430801018879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.280 × 10⁹⁸(99-digit number)
22800797122822527601…04111272861602037759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.560 × 10⁹⁸(99-digit number)
45601594245645055203…08222545723204075519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.120 × 10⁹⁸(99-digit number)
91203188491290110406…16445091446408151039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.824 × 10⁹⁹(100-digit number)
18240637698258022081…32890182892816302079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.648 × 10⁹⁹(100-digit number)
36481275396516044162…65780365785632604159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.296 × 10⁹⁹(100-digit number)
72962550793032088325…31560731571265208319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.459 × 10¹⁰⁰(101-digit number)
14592510158606417665…63121463142530416639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.918 × 10¹⁰⁰(101-digit number)
29185020317212835330…26242926285060833279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.837 × 10¹⁰⁰(101-digit number)
58370040634425670660…52485852570121666559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.167 × 10¹⁰¹(102-digit number)
11674008126885134132…04971705140243333119
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,859,245 XPM·at block #6,826,884 · 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