Block #562,173

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/25/2014, 10:57:22 PM · Difficulty 10.9660 · 6,245,959 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4cedcf085922f6e953fea24ff943c5e12ac48f9343f816d3ce109a736caf0324

Height

#562,173

Difficulty

10.965973

Transactions

8

Size

3.77 KB

Version

2

Bits

0af749fe

Nonce

173,390,512

Timestamp

5/25/2014, 10:57:22 PM

Confirmations

6,245,959

Merkle Root

dda6a472b358a3f2c5bd2ab9b6aa754b29cb393174f5cef0968356ad1d94dc38
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.811 × 10⁹⁸(99-digit number)
58119351602189546141…90753920728459270719
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.811 × 10⁹⁸(99-digit number)
58119351602189546141…90753920728459270719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.162 × 10⁹⁹(100-digit number)
11623870320437909228…81507841456918541439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.324 × 10⁹⁹(100-digit number)
23247740640875818456…63015682913837082879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.649 × 10⁹⁹(100-digit number)
46495481281751636913…26031365827674165759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.299 × 10⁹⁹(100-digit number)
92990962563503273827…52062731655348331519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.859 × 10¹⁰⁰(101-digit number)
18598192512700654765…04125463310696663039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.719 × 10¹⁰⁰(101-digit number)
37196385025401309530…08250926621393326079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.439 × 10¹⁰⁰(101-digit number)
74392770050802619061…16501853242786652159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.487 × 10¹⁰¹(102-digit number)
14878554010160523812…33003706485573304319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.975 × 10¹⁰¹(102-digit number)
29757108020321047624…66007412971146608639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.951 × 10¹⁰¹(102-digit number)
59514216040642095249…32014825942293217279
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,709,097 XPM·at block #6,808,131 · 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