Block #564,069

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/27/2014, 9:41:18 AM · Difficulty 10.9647 · 6,245,844 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4a5584f558a3c79e8c27416e675ed4147bcdedbd113f74e9934da5014171b033

Height

#564,069

Difficulty

10.964736

Transactions

5

Size

1.52 KB

Version

2

Bits

0af6f8ec

Nonce

57,445,603

Timestamp

5/27/2014, 9:41:18 AM

Confirmations

6,245,844

Merkle Root

1471803d8c0b6ac188089a569f18f338867adb74a1c41074e73f018ee13c5ef7
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.

1.178 × 10⁹⁹(100-digit number)
11783073459328895476…70778859188981862399
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
1.178 × 10⁹⁹(100-digit number)
11783073459328895476…70778859188981862399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.356 × 10⁹⁹(100-digit number)
23566146918657790953…41557718377963724799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.713 × 10⁹⁹(100-digit number)
47132293837315581906…83115436755927449599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.426 × 10⁹⁹(100-digit number)
94264587674631163812…66230873511854899199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.885 × 10¹⁰⁰(101-digit number)
18852917534926232762…32461747023709798399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.770 × 10¹⁰⁰(101-digit number)
37705835069852465525…64923494047419596799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.541 × 10¹⁰⁰(101-digit number)
75411670139704931050…29846988094839193599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.508 × 10¹⁰¹(102-digit number)
15082334027940986210…59693976189678387199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.016 × 10¹⁰¹(102-digit number)
30164668055881972420…19387952379356774399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.032 × 10¹⁰¹(102-digit number)
60329336111763944840…38775904758713548799
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,723,388 XPM·at block #6,809,912 · 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