Block #2,643,502

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/2/2018, 3:15:16 AM · Difficulty 11.6854 · 4,201,076 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d53dafccbe22cbd02d405da78ad1aaae475f4e372e214e5f470337c4398557d0

Height

#2,643,502

Difficulty

11.685437

Transactions

16

Size

5.40 KB

Version

2

Bits

0baf78c6

Nonce

392,066,908

Timestamp

5/2/2018, 3:15:16 AM

Confirmations

4,201,076

Merkle Root

0e5267e724c03fa7e81604675e1a03221e6140d573fa57a6ac28659b1beec92e
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.431 × 10⁹⁵(96-digit number)
24313952777357075774…95559483473514659839
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.431 × 10⁹⁵(96-digit number)
24313952777357075774…95559483473514659839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.862 × 10⁹⁵(96-digit number)
48627905554714151548…91118966947029319679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.725 × 10⁹⁵(96-digit number)
97255811109428303096…82237933894058639359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.945 × 10⁹⁶(97-digit number)
19451162221885660619…64475867788117278719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.890 × 10⁹⁶(97-digit number)
38902324443771321238…28951735576234557439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.780 × 10⁹⁶(97-digit number)
77804648887542642477…57903471152469114879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.556 × 10⁹⁷(98-digit number)
15560929777508528495…15806942304938229759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.112 × 10⁹⁷(98-digit number)
31121859555017056990…31613884609876459519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.224 × 10⁹⁷(98-digit number)
62243719110034113981…63227769219752919039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.244 × 10⁹⁸(99-digit number)
12448743822006822796…26455538439505838079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.489 × 10⁹⁸(99-digit number)
24897487644013645592…52911076879011676159
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:58,001,030 XPM·at block #6,844,577 · 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