Block #2,642,947

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/1/2018, 10:16:44 PM · Difficulty 11.6690 · 4,187,777 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bca53fee64c1ed9f2b554277d2e2688916ff08772478d84dc38081e0215c1c78

Height

#2,642,947

Difficulty

11.668993

Transactions

18

Size

4.44 KB

Version

2

Bits

0bab431b

Nonce

8,422,266

Timestamp

5/1/2018, 10:16:44 PM

Confirmations

4,187,777

Merkle Root

8eec8937f56451568e1d216843f48034acebf63a482c014450dde57e69f8e9e4
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.

2.696 × 10⁹⁷(98-digit number)
26960746469329637873…88190123945078947839
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
2.696 × 10⁹⁷(98-digit number)
26960746469329637873…88190123945078947839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.392 × 10⁹⁷(98-digit number)
53921492938659275746…76380247890157895679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.078 × 10⁹⁸(99-digit number)
10784298587731855149…52760495780315791359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.156 × 10⁹⁸(99-digit number)
21568597175463710298…05520991560631582719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.313 × 10⁹⁸(99-digit number)
43137194350927420597…11041983121263165439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.627 × 10⁹⁸(99-digit number)
86274388701854841194…22083966242526330879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.725 × 10⁹⁹(100-digit number)
17254877740370968238…44167932485052661759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.450 × 10⁹⁹(100-digit number)
34509755480741936477…88335864970105323519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.901 × 10⁹⁹(100-digit number)
69019510961483872955…76671729940210647039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.380 × 10¹⁰⁰(101-digit number)
13803902192296774591…53343459880421294079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.760 × 10¹⁰⁰(101-digit number)
27607804384593549182…06686919760842588159
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,889,927 XPM·at block #6,830,723 · 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