Block #2,622,659

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/20/2018, 7:24:42 PM · Difficulty 11.2262 · 4,210,933 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e3a16a741c382510fc18e6b4503e79c66f0d2e59935820f6e323420bbf77d17a

Height

#2,622,659

Difficulty

11.226186

Transactions

5

Size

1.45 KB

Version

2

Bits

0b39e74e

Nonce

375,645,263

Timestamp

4/20/2018, 7:24:42 PM

Confirmations

4,210,933

Merkle Root

86b8fd6c7fb87f9f904ff7b8259d05e04c38db8b022e3ff9e270d1ebe2fb8b67
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.054 × 10⁹⁶(97-digit number)
40549996702489512326…88324513378667566079
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.054 × 10⁹⁶(97-digit number)
40549996702489512326…88324513378667566079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.109 × 10⁹⁶(97-digit number)
81099993404979024652…76649026757335132159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.621 × 10⁹⁷(98-digit number)
16219998680995804930…53298053514670264319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.243 × 10⁹⁷(98-digit number)
32439997361991609861…06596107029340528639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.487 × 10⁹⁷(98-digit number)
64879994723983219722…13192214058681057279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.297 × 10⁹⁸(99-digit number)
12975998944796643944…26384428117362114559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.595 × 10⁹⁸(99-digit number)
25951997889593287888…52768856234724229119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.190 × 10⁹⁸(99-digit number)
51903995779186575777…05537712469448458239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.038 × 10⁹⁹(100-digit number)
10380799155837315155…11075424938896916479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.076 × 10⁹⁹(100-digit number)
20761598311674630311…22150849877793832959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.152 × 10⁹⁹(100-digit number)
41523196623349260622…44301699755587665919
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,912,943 XPM·at block #6,833,591 · 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