Block #574,479

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/3/2014, 8:55:27 AM · Difficulty 10.9676 · 6,232,387 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c5902a201d15eaf60d4aed5d6c841a50b6c6a65edaaa47404c464a6281bbe406

Height

#574,479

Difficulty

10.967594

Transactions

6

Size

1.88 KB

Version

2

Bits

0af7b43f

Nonce

40,343

Timestamp

6/3/2014, 8:55:27 AM

Confirmations

6,232,387

Merkle Root

5677da9055ee15a4e34d115325708426552d6a3a615c6231c4365f5d060887bf
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.840 × 10¹⁰²(103-digit number)
18402568311319510063…21327998820314618881
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.840 × 10¹⁰²(103-digit number)
18402568311319510063…21327998820314618881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.680 × 10¹⁰²(103-digit number)
36805136622639020126…42655997640629237761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.361 × 10¹⁰²(103-digit number)
73610273245278040253…85311995281258475521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.472 × 10¹⁰³(104-digit number)
14722054649055608050…70623990562516951041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.944 × 10¹⁰³(104-digit number)
29444109298111216101…41247981125033902081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.888 × 10¹⁰³(104-digit number)
58888218596222432203…82495962250067804161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.177 × 10¹⁰⁴(105-digit number)
11777643719244486440…64991924500135608321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.355 × 10¹⁰⁴(105-digit number)
23555287438488972881…29983849000271216641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.711 × 10¹⁰⁴(105-digit number)
47110574876977945762…59967698000542433281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.422 × 10¹⁰⁴(105-digit number)
94221149753955891524…19935396001084866561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.884 × 10¹⁰⁵(106-digit number)
18844229950791178304…39870792002169733121
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,699,035 XPM·at block #6,806,865 · 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