Block #565,807

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/28/2014, 12:47:09 PM · Difficulty 10.9656 · 6,243,641 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6a19c4e204b7eca69c1f4e38c71916800c0c0f219065f7a23fe885f90037d46e

Height

#565,807

Difficulty

10.965569

Transactions

4

Size

1.01 KB

Version

2

Bits

0af72f82

Nonce

68,744,729

Timestamp

5/28/2014, 12:47:09 PM

Confirmations

6,243,641

Merkle Root

fb2b8a95d32cc3e3026adeac924be83f938cfb3be95321224b1bdc875322636f
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.

7.345 × 10⁹⁶(97-digit number)
73450740746044810223…35465809601331784299
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
7.345 × 10⁹⁶(97-digit number)
73450740746044810223…35465809601331784299
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.469 × 10⁹⁷(98-digit number)
14690148149208962044…70931619202663568599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.938 × 10⁹⁷(98-digit number)
29380296298417924089…41863238405327137199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.876 × 10⁹⁷(98-digit number)
58760592596835848178…83726476810654274399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.175 × 10⁹⁸(99-digit number)
11752118519367169635…67452953621308548799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.350 × 10⁹⁸(99-digit number)
23504237038734339271…34905907242617097599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.700 × 10⁹⁸(99-digit number)
47008474077468678542…69811814485234195199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.401 × 10⁹⁸(99-digit number)
94016948154937357085…39623628970468390399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.880 × 10⁹⁹(100-digit number)
18803389630987471417…79247257940936780799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.760 × 10⁹⁹(100-digit number)
37606779261974942834…58494515881873561599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.521 × 10⁹⁹(100-digit number)
75213558523949885668…16989031763747123199
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,719,655 XPM·at block #6,809,447 · 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