Block #2,636,309

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/29/2018, 1:07:03 PM · Difficulty 11.3741 · 4,196,254 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
27aa829357e506e16b4a2035895e1236d4d69d5587066b244be5005ba7a4fcb8

Height

#2,636,309

Difficulty

11.374099

Transactions

10

Size

3.39 KB

Version

2

Bits

0b5fc4fc

Nonce

250,264,171

Timestamp

4/29/2018, 1:07:03 PM

Confirmations

4,196,254

Merkle Root

7a5d0a1a2f976f58001fcbdee12dd057e313a11f0516ee8986ed2c3c2fdd28f4
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.

3.060 × 10⁹⁴(95-digit number)
30609581340747700650…92047118325755406039
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
3.060 × 10⁹⁴(95-digit number)
30609581340747700650…92047118325755406039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.121 × 10⁹⁴(95-digit number)
61219162681495401301…84094236651510812079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.224 × 10⁹⁵(96-digit number)
12243832536299080260…68188473303021624159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.448 × 10⁹⁵(96-digit number)
24487665072598160520…36376946606043248319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.897 × 10⁹⁵(96-digit number)
48975330145196321041…72753893212086496639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.795 × 10⁹⁵(96-digit number)
97950660290392642082…45507786424172993279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.959 × 10⁹⁶(97-digit number)
19590132058078528416…91015572848345986559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.918 × 10⁹⁶(97-digit number)
39180264116157056833…82031145696691973119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.836 × 10⁹⁶(97-digit number)
78360528232314113666…64062291393383946239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.567 × 10⁹⁷(98-digit number)
15672105646462822733…28124582786767892479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.134 × 10⁹⁷(98-digit number)
31344211292925645466…56249165573535784959
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,904,661 XPM·at block #6,832,562 · 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