Block #2,674,768

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/23/2018, 4:55:21 PM · Difficulty 11.6991 · 4,158,694 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7d9b21e5c65b393f4d5a81b503a19e26ef904dd8093afa0c2f8b935e2f3b23c7

Height

#2,674,768

Difficulty

11.699146

Transactions

2

Size

1.72 KB

Version

2

Bits

0bb2fb42

Nonce

51,049,778

Timestamp

5/23/2018, 4:55:21 PM

Confirmations

4,158,694

Merkle Root

8d67f2631f66749ada892392271d888a95b53451bf4375e751d08f8eaef1dd8e
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.799 × 10⁹⁷(98-digit number)
37994491585394630926…70164862627916887039
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.799 × 10⁹⁷(98-digit number)
37994491585394630926…70164862627916887039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.598 × 10⁹⁷(98-digit number)
75988983170789261852…40329725255833774079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.519 × 10⁹⁸(99-digit number)
15197796634157852370…80659450511667548159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.039 × 10⁹⁸(99-digit number)
30395593268315704741…61318901023335096319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.079 × 10⁹⁸(99-digit number)
60791186536631409482…22637802046670192639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.215 × 10⁹⁹(100-digit number)
12158237307326281896…45275604093340385279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.431 × 10⁹⁹(100-digit number)
24316474614652563792…90551208186680770559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.863 × 10⁹⁹(100-digit number)
48632949229305127585…81102416373361541119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.726 × 10⁹⁹(100-digit number)
97265898458610255171…62204832746723082239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.945 × 10¹⁰⁰(101-digit number)
19453179691722051034…24409665493446164479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.890 × 10¹⁰⁰(101-digit number)
38906359383444102068…48819330986892328959
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,911,896 XPM·at block #6,833,461 · 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