Block #641,958

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/21/2014, 8:56:35 AM · Difficulty 10.9571 · 6,182,608 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8833922503068f45fbb808d3a68c260944a5b2fa7b1c95a23288c009eaf59412

Height

#641,958

Difficulty

10.957140

Transactions

4

Size

1.15 KB

Version

2

Bits

0af50723

Nonce

476,228,597

Timestamp

7/21/2014, 8:56:35 AM

Confirmations

6,182,608

Merkle Root

987c69c89b056247f4ab7b2d2af247155a35f3e22975be0b29f46bf1404cc3d1
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.

5.824 × 10⁹⁶(97-digit number)
58240471093049936937…37160272123056034639
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
5.824 × 10⁹⁶(97-digit number)
58240471093049936937…37160272123056034639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.164 × 10⁹⁷(98-digit number)
11648094218609987387…74320544246112069279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.329 × 10⁹⁷(98-digit number)
23296188437219974774…48641088492224138559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.659 × 10⁹⁷(98-digit number)
46592376874439949549…97282176984448277119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.318 × 10⁹⁷(98-digit number)
93184753748879899099…94564353968896554239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.863 × 10⁹⁸(99-digit number)
18636950749775979819…89128707937793108479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.727 × 10⁹⁸(99-digit number)
37273901499551959639…78257415875586216959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.454 × 10⁹⁸(99-digit number)
74547802999103919279…56514831751172433919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.490 × 10⁹⁹(100-digit number)
14909560599820783855…13029663502344867839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.981 × 10⁹⁹(100-digit number)
29819121199641567711…26059327004689735679
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,840,593 XPM·at block #6,824,565 · 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