Block #622,725

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/8/2014, 3:42:33 AM · Difficulty 10.9547 · 6,194,399 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7b9d0341eb2c7a9581e81d09165e0a666ac8bb859fbb596486aa61370620731d

Height

#622,725

Difficulty

10.954679

Transactions

4

Size

2.89 KB

Version

2

Bits

0af465db

Nonce

2,110,153,641

Timestamp

7/8/2014, 3:42:33 AM

Confirmations

6,194,399

Merkle Root

2ee602868285602269b192d9097fc326b7610ac07ed529d11527fd7a63046fd2
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.247 × 10⁹⁸(99-digit number)
32473316391845421875…86016873150852710399
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.247 × 10⁹⁸(99-digit number)
32473316391845421875…86016873150852710399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.494 × 10⁹⁸(99-digit number)
64946632783690843751…72033746301705420799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.298 × 10⁹⁹(100-digit number)
12989326556738168750…44067492603410841599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.597 × 10⁹⁹(100-digit number)
25978653113476337500…88134985206821683199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.195 × 10⁹⁹(100-digit number)
51957306226952675001…76269970413643366399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.039 × 10¹⁰⁰(101-digit number)
10391461245390535000…52539940827286732799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.078 × 10¹⁰⁰(101-digit number)
20782922490781070000…05079881654573465599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.156 × 10¹⁰⁰(101-digit number)
41565844981562140001…10159763309146931199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.313 × 10¹⁰⁰(101-digit number)
83131689963124280002…20319526618293862399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.662 × 10¹⁰¹(102-digit number)
16626337992624856000…40639053236587724799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.325 × 10¹⁰¹(102-digit number)
33252675985249712000…81278106473175449599
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,781,025 XPM·at block #6,817,123 · 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