Block #542,718

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/14/2014, 2:15:48 AM · Difficulty 10.9446 · 6,265,928 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5cfbd531eb24e6da4f0815277e16fd1ce1217d46c2c406fb487899e4a361239d

Height

#542,718

Difficulty

10.944633

Transactions

3

Size

650 B

Version

2

Bits

0af1d376

Nonce

302,791,713

Timestamp

5/14/2014, 2:15:48 AM

Confirmations

6,265,928

Merkle Root

eb046cc47268fc05319f97126d2243e78354ce9fe5f78fbbf512ad8b2748c8dc
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.939 × 10⁹⁵(96-digit number)
49392406565544580565…86373913875831974319
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.939 × 10⁹⁵(96-digit number)
49392406565544580565…86373913875831974319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.878 × 10⁹⁵(96-digit number)
98784813131089161130…72747827751663948639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.975 × 10⁹⁶(97-digit number)
19756962626217832226…45495655503327897279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.951 × 10⁹⁶(97-digit number)
39513925252435664452…90991311006655794559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.902 × 10⁹⁶(97-digit number)
79027850504871328904…81982622013311589119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.580 × 10⁹⁷(98-digit number)
15805570100974265780…63965244026623178239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.161 × 10⁹⁷(98-digit number)
31611140201948531561…27930488053246356479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.322 × 10⁹⁷(98-digit number)
63222280403897063123…55860976106492712959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.264 × 10⁹⁸(99-digit number)
12644456080779412624…11721952212985425919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.528 × 10⁹⁸(99-digit number)
25288912161558825249…23443904425970851839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.057 × 10⁹⁸(99-digit number)
50577824323117650498…46887808851941703679
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,713,220 XPM·at block #6,808,645 · 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.

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