Block #565,034

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/28/2014, 1:56:43 AM · Difficulty 10.9647 · 6,261,960 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c096d72f72ad01eb10a57a5c0b0ff05f92f2d6eae834e66e8bbf3e7830c81671

Height

#565,034

Difficulty

10.964697

Transactions

10

Size

2.58 KB

Version

2

Bits

0af6f65f

Nonce

1,366,256,454

Timestamp

5/28/2014, 1:56:43 AM

Confirmations

6,261,960

Merkle Root

439b3bc49d13d4d2ba82144fb3dc7e59b2f32e7c2bcfa0e5ec0afdf7258eb6b3
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.698 × 10⁸⁹(90-digit number)
16985767172758335562…35581337515159284429
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.698 × 10⁸⁹(90-digit number)
16985767172758335562…35581337515159284429
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.397 × 10⁸⁹(90-digit number)
33971534345516671125…71162675030318568859
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.794 × 10⁸⁹(90-digit number)
67943068691033342251…42325350060637137719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.358 × 10⁹⁰(91-digit number)
13588613738206668450…84650700121274275439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.717 × 10⁹⁰(91-digit number)
27177227476413336900…69301400242548550879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.435 × 10⁹⁰(91-digit number)
54354454952826673800…38602800485097101759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.087 × 10⁹¹(92-digit number)
10870890990565334760…77205600970194203519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.174 × 10⁹¹(92-digit number)
21741781981130669520…54411201940388407039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.348 × 10⁹¹(92-digit number)
43483563962261339040…08822403880776814079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.696 × 10⁹¹(92-digit number)
86967127924522678081…17644807761553628159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.739 × 10⁹²(93-digit number)
17393425584904535616…35289615523107256319
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,860,127 XPM·at block #6,826,993 · 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