Block #3,235,369

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/22/2019, 1:36:29 AM · Difficulty 10.9960 · 3,605,126 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
03678e66ed290d3691ba44509067acbeeef445d4aff681e9b5f390a94b2bf425

Height

#3,235,369

Difficulty

10.995980

Transactions

9

Size

2.48 KB

Version

2

Bits

0afef890

Nonce

434,188,702

Timestamp

6/22/2019, 1:36:29 AM

Confirmations

3,605,126

Merkle Root

297feb9c7ea5bf0abf06abc11a96367cc04be72a61ffe4044e323284774637a0
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.905 × 10⁹²(93-digit number)
29057821985013711588…57444481587257937999
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.905 × 10⁹²(93-digit number)
29057821985013711588…57444481587257937999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.811 × 10⁹²(93-digit number)
58115643970027423176…14888963174515875999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.162 × 10⁹³(94-digit number)
11623128794005484635…29777926349031751999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.324 × 10⁹³(94-digit number)
23246257588010969270…59555852698063503999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.649 × 10⁹³(94-digit number)
46492515176021938541…19111705396127007999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.298 × 10⁹³(94-digit number)
92985030352043877082…38223410792254015999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.859 × 10⁹⁴(95-digit number)
18597006070408775416…76446821584508031999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.719 × 10⁹⁴(95-digit number)
37194012140817550833…52893643169016063999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.438 × 10⁹⁴(95-digit number)
74388024281635101666…05787286338032127999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.487 × 10⁹⁵(96-digit number)
14877604856327020333…11574572676064255999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.975 × 10⁹⁵(96-digit number)
29755209712654040666…23149145352128511999
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,968,292 XPM·at block #6,840,494 · 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