Block #2,139,822

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/1/2017, 12:37:43 AM · Difficulty 10.8777 · 4,703,269 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
07bb49d1db3ada9325a3692602e81448a2bb1bf42a9d722a743ae2ad584a8a2b

Height

#2,139,822

Difficulty

10.877673

Transactions

3

Size

1.36 KB

Version

2

Bits

0ae0af2f

Nonce

761,976,151

Timestamp

6/1/2017, 12:37:43 AM

Confirmations

4,703,269

Merkle Root

38d20d66771aadac5e92ea5b29d81c002e7b6e2395fbe77e20b3865575da09c6
Transactions (3)
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.266 × 10⁹³(94-digit number)
32665473651327380946…79108340011007464959
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.266 × 10⁹³(94-digit number)
32665473651327380946…79108340011007464959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.533 × 10⁹³(94-digit number)
65330947302654761893…58216680022014929919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.306 × 10⁹⁴(95-digit number)
13066189460530952378…16433360044029859839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.613 × 10⁹⁴(95-digit number)
26132378921061904757…32866720088059719679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.226 × 10⁹⁴(95-digit number)
52264757842123809514…65733440176119439359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.045 × 10⁹⁵(96-digit number)
10452951568424761902…31466880352238878719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.090 × 10⁹⁵(96-digit number)
20905903136849523805…62933760704477757439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.181 × 10⁹⁵(96-digit number)
41811806273699047611…25867521408955514879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.362 × 10⁹⁵(96-digit number)
83623612547398095223…51735042817911029759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.672 × 10⁹⁶(97-digit number)
16724722509479619044…03470085635822059519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.344 × 10⁹⁶(97-digit number)
33449445018959238089…06940171271644119039
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,989,090 XPM·at block #6,843,090 · 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