Block #569,679

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/31/2014, 7:37:09 AM · Difficulty 10.9648 · 6,244,535 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f66a7c69a82394bf71d5b4e4feb3131970c67045c7e7d9ea60c4c6a7dec4ef59

Height

#569,679

Difficulty

10.964755

Transactions

9

Size

2.69 KB

Version

2

Bits

0af6fa2a

Nonce

1,565,968,466

Timestamp

5/31/2014, 7:37:09 AM

Confirmations

6,244,535

Merkle Root

95b6b35e404428a1165576e71d665b6bb7ab0706c6a1cd6558bf124e9dcbe0b1
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.

3.004 × 10⁹⁷(98-digit number)
30043502569911555568…34824459413225310001
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
3.004 × 10⁹⁷(98-digit number)
30043502569911555568…34824459413225310001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.008 × 10⁹⁷(98-digit number)
60087005139823111137…69648918826450620001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.201 × 10⁹⁸(99-digit number)
12017401027964622227…39297837652901240001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.403 × 10⁹⁸(99-digit number)
24034802055929244454…78595675305802480001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.806 × 10⁹⁸(99-digit number)
48069604111858488909…57191350611604960001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.613 × 10⁹⁸(99-digit number)
96139208223716977819…14382701223209920001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.922 × 10⁹⁹(100-digit number)
19227841644743395563…28765402446419840001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.845 × 10⁹⁹(100-digit number)
38455683289486791127…57530804892839680001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.691 × 10⁹⁹(100-digit number)
76911366578973582255…15061609785679360001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.538 × 10¹⁰⁰(101-digit number)
15382273315794716451…30123219571358720001
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,757,780 XPM·at block #6,814,213 · 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