Block #3,241,270

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/26/2019, 4:11:51 AM · Difficulty 11.0038 · 3,600,982 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cbdfd222c201296e8383536e9c668fc5f4b359355cba87d782ed65bf2a13c1cb

Height

#3,241,270

Difficulty

11.003806

Transactions

6

Size

1.45 KB

Version

2

Bits

0b00f966

Nonce

1,255,682,302

Timestamp

6/26/2019, 4:11:51 AM

Confirmations

3,600,982

Merkle Root

24bed54a2f2e196a5b63d516f4a3c67e2eeb1805c86d86dac82d681e4bc2d0a8
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.876 × 10⁹⁴(95-digit number)
18762721709801094645…66638970846318535019
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.876 × 10⁹⁴(95-digit number)
18762721709801094645…66638970846318535019
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.752 × 10⁹⁴(95-digit number)
37525443419602189290…33277941692637070039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.505 × 10⁹⁴(95-digit number)
75050886839204378580…66555883385274140079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.501 × 10⁹⁵(96-digit number)
15010177367840875716…33111766770548280159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.002 × 10⁹⁵(96-digit number)
30020354735681751432…66223533541096560319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.004 × 10⁹⁵(96-digit number)
60040709471363502864…32447067082193120639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.200 × 10⁹⁶(97-digit number)
12008141894272700572…64894134164386241279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.401 × 10⁹⁶(97-digit number)
24016283788545401145…29788268328772482559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.803 × 10⁹⁶(97-digit number)
48032567577090802291…59576536657544965119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.606 × 10⁹⁶(97-digit number)
96065135154181604583…19153073315089930239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.921 × 10⁹⁷(98-digit number)
19213027030836320916…38306146630179860479
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,982,413 XPM·at block #6,842,251 · 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