Block #605,473

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/28/2014, 1:09:19 PM · Difficulty 10.9099 · 6,210,677 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7abbe0b753ed202b72324d651b3309b2a1335973052c0c9b20eac27206181a24

Height

#605,473

Difficulty

10.909891

Transactions

4

Size

1.27 KB

Version

2

Bits

0ae8ee9a

Nonce

10,638

Timestamp

6/28/2014, 1:09:19 PM

Confirmations

6,210,677

Merkle Root

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

6.392 × 10⁹²(93-digit number)
63926948370093773978…94172909200172203301
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
6.392 × 10⁹²(93-digit number)
63926948370093773978…94172909200172203301
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.278 × 10⁹³(94-digit number)
12785389674018754795…88345818400344406601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.557 × 10⁹³(94-digit number)
25570779348037509591…76691636800688813201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.114 × 10⁹³(94-digit number)
51141558696075019183…53383273601377626401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.022 × 10⁹⁴(95-digit number)
10228311739215003836…06766547202755252801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.045 × 10⁹⁴(95-digit number)
20456623478430007673…13533094405510505601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.091 × 10⁹⁴(95-digit number)
40913246956860015346…27066188811021011201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.182 × 10⁹⁴(95-digit number)
81826493913720030692…54132377622042022401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.636 × 10⁹⁵(96-digit number)
16365298782744006138…08264755244084044801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.273 × 10⁹⁵(96-digit number)
32730597565488012277…16529510488168089601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.546 × 10⁹⁵(96-digit number)
65461195130976024554…33059020976336179201
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,773,321 XPM·at block #6,816,149 · 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