Block #2,734,602

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/5/2018, 2:55:26 AM · Difficulty 11.6172 · 4,096,550 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3cf606d6125e8510e6e9b51c5faa17eba8df0c070d0904aabaa1409194e25a0a

Height

#2,734,602

Difficulty

11.617224

Transactions

8

Size

2.62 KB

Version

2

Bits

0b9e025e

Nonce

481,939,426

Timestamp

7/5/2018, 2:55:26 AM

Confirmations

4,096,550

Merkle Root

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

4.274 × 10⁹⁶(97-digit number)
42749381408933085870…65959991662725708799
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
4.274 × 10⁹⁶(97-digit number)
42749381408933085870…65959991662725708799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.549 × 10⁹⁶(97-digit number)
85498762817866171740…31919983325451417599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.709 × 10⁹⁷(98-digit number)
17099752563573234348…63839966650902835199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.419 × 10⁹⁷(98-digit number)
34199505127146468696…27679933301805670399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.839 × 10⁹⁷(98-digit number)
68399010254292937392…55359866603611340799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.367 × 10⁹⁸(99-digit number)
13679802050858587478…10719733207222681599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.735 × 10⁹⁸(99-digit number)
27359604101717174956…21439466414445363199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.471 × 10⁹⁸(99-digit number)
54719208203434349913…42878932828890726399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.094 × 10⁹⁹(100-digit number)
10943841640686869982…85757865657781452799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.188 × 10⁹⁹(100-digit number)
21887683281373739965…71515731315562905599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.377 × 10⁹⁹(100-digit number)
43775366562747479931…43031462631125811199
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,893,354 XPM·at block #6,831,151 · 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