Block #3,431,879

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/13/2019, 7:55:03 PM · Difficulty 10.9803 · 3,410,835 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e09248e561e9e4d9f7a5da4c6a87080c3ae879aa22f5bfba6d4cedc40c743d03

Height

#3,431,879

Difficulty

10.980263

Transactions

2

Size

19.21 KB

Version

2

Bits

0afaf28a

Nonce

2,138,929,449

Timestamp

11/13/2019, 7:55:03 PM

Confirmations

3,410,835

Merkle Root

99b2f9216a5f64c96164d0e1f0a04b7e1b41b6a6baca482813f68866e013afe1
Transactions (2)
1 in → 1 out8.7000 XPM110 B
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.

8.152 × 10⁹⁶(97-digit number)
81524693095872443373…31148605089682508799
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
8.152 × 10⁹⁶(97-digit number)
81524693095872443373…31148605089682508799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.630 × 10⁹⁷(98-digit number)
16304938619174488674…62297210179365017599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.260 × 10⁹⁷(98-digit number)
32609877238348977349…24594420358730035199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.521 × 10⁹⁷(98-digit number)
65219754476697954698…49188840717460070399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.304 × 10⁹⁸(99-digit number)
13043950895339590939…98377681434920140799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.608 × 10⁹⁸(99-digit number)
26087901790679181879…96755362869840281599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.217 × 10⁹⁸(99-digit number)
52175803581358363758…93510725739680563199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.043 × 10⁹⁹(100-digit number)
10435160716271672751…87021451479361126399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.087 × 10⁹⁹(100-digit number)
20870321432543345503…74042902958722252799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.174 × 10⁹⁹(100-digit number)
41740642865086691007…48085805917444505599
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,986,049 XPM·at block #6,842,713 · 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