Block #568,977

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/30/2014, 8:40:55 PM · Difficulty 10.9644 · 6,237,658 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
10b080db5f76d2c8fed5c6baac0e6ef2dfec94940d8996afe060974755183209

Height

#568,977

Difficulty

10.964405

Transactions

2

Size

1.14 KB

Version

2

Bits

0af6e347

Nonce

177,464

Timestamp

5/30/2014, 8:40:55 PM

Confirmations

6,237,658

Merkle Root

dc57b1f76af3d41153d982060489a282086e7283d4b32ecc7175f22a4ab4c401
Transactions (2)
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.

4.786 × 10⁹²(93-digit number)
47863181943099754406…73027517466295844001
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
4.786 × 10⁹²(93-digit number)
47863181943099754406…73027517466295844001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.572 × 10⁹²(93-digit number)
95726363886199508812…46055034932591688001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.914 × 10⁹³(94-digit number)
19145272777239901762…92110069865183376001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.829 × 10⁹³(94-digit number)
38290545554479803525…84220139730366752001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.658 × 10⁹³(94-digit number)
76581091108959607050…68440279460733504001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.531 × 10⁹⁴(95-digit number)
15316218221791921410…36880558921467008001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.063 × 10⁹⁴(95-digit number)
30632436443583842820…73761117842934016001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.126 × 10⁹⁴(95-digit number)
61264872887167685640…47522235685868032001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.225 × 10⁹⁵(96-digit number)
12252974577433537128…95044471371736064001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.450 × 10⁹⁵(96-digit number)
24505949154867074256…90088942743472128001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.901 × 10⁹⁵(96-digit number)
49011898309734148512…80177885486944256001
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 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
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 2CC formula:

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