Block #3,498,614

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/3/2020, 1:40:21 PM · Difficulty 10.9365 · 3,311,625 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bc33a7d10dc98b36d1a5c64db6aabf9f7b17a4027e903085a61aff6b31bec0e9

Height

#3,498,614

Difficulty

10.936459

Transactions

12

Size

3.63 KB

Version

2

Bits

0aefbbc3

Nonce

915,595,312

Timestamp

1/3/2020, 1:40:21 PM

Confirmations

3,311,625

Merkle Root

2fd5c3f591714b53e156a5286b8cdc6d878fc3408b9e19bb41a3ae12f70bd96d
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.

2.150 × 10⁹⁵(96-digit number)
21508689375084151794…80781899308134164759
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
2.150 × 10⁹⁵(96-digit number)
21508689375084151794…80781899308134164759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.301 × 10⁹⁵(96-digit number)
43017378750168303588…61563798616268329519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.603 × 10⁹⁵(96-digit number)
86034757500336607176…23127597232536659039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.720 × 10⁹⁶(97-digit number)
17206951500067321435…46255194465073318079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.441 × 10⁹⁶(97-digit number)
34413903000134642870…92510388930146636159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.882 × 10⁹⁶(97-digit number)
68827806000269285741…85020777860293272319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.376 × 10⁹⁷(98-digit number)
13765561200053857148…70041555720586544639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.753 × 10⁹⁷(98-digit number)
27531122400107714296…40083111441173089279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.506 × 10⁹⁷(98-digit number)
55062244800215428592…80166222882346178559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.101 × 10⁹⁸(99-digit number)
11012448960043085718…60332445764692357119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.202 × 10⁹⁸(99-digit number)
22024897920086171437…20664891529384714239
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,725,990 XPM·at block #6,810,238 · 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