Block #2,646,393

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/3/2018, 8:24:53 AM · Difficulty 11.7493 · 4,190,299 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e3f383ee05420d284b9d0a90efebd83e45c0db7bf90c0ee737e81885d9794aad

Height

#2,646,393

Difficulty

11.749267

Transactions

2

Size

722 B

Version

2

Bits

0bbfcff5

Nonce

228,950,127

Timestamp

5/3/2018, 8:24:53 AM

Confirmations

4,190,299

Merkle Root

8cd41ef1463e3d40f74ada8674a97d0a0e9b849af2dd31bc03246111c94beb6e
Transactions (2)
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.702 × 10⁹⁷(98-digit number)
37022044755123870240…48712778474346680319
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.702 × 10⁹⁷(98-digit number)
37022044755123870240…48712778474346680319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.404 × 10⁹⁷(98-digit number)
74044089510247740481…97425556948693360639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.480 × 10⁹⁸(99-digit number)
14808817902049548096…94851113897386721279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.961 × 10⁹⁸(99-digit number)
29617635804099096192…89702227794773442559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.923 × 10⁹⁸(99-digit number)
59235271608198192385…79404455589546885119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.184 × 10⁹⁹(100-digit number)
11847054321639638477…58808911179093770239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.369 × 10⁹⁹(100-digit number)
23694108643279276954…17617822358187540479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.738 × 10⁹⁹(100-digit number)
47388217286558553908…35235644716375080959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.477 × 10⁹⁹(100-digit number)
94776434573117107816…70471289432750161919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.895 × 10¹⁰⁰(101-digit number)
18955286914623421563…40942578865500323839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.791 × 10¹⁰⁰(101-digit number)
37910573829246843126…81885157731000647679
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,937,816 XPM·at block #6,836,691 · 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