Block #482,310

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/9/2014, 10:22:41 AM · Difficulty 10.5428 · 6,332,745 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
51aa348409ec28ccad1aae18c7b149ca76a0c0180b624f762e16fc53857e9614

Height

#482,310

Difficulty

10.542789

Transactions

1

Size

900 B

Version

2

Bits

0a8af43b

Nonce

160,204

Timestamp

4/9/2014, 10:22:41 AM

Confirmations

6,332,745

Merkle Root

96d2c7a808c07ac282cbc39ff7e6f070bea25383ddb0784a1a1b8992911bf6ba
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.

2.301 × 10⁹³(94-digit number)
23017709701599652495…43975325934576160001
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
2.301 × 10⁹³(94-digit number)
23017709701599652495…43975325934576160001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.603 × 10⁹³(94-digit number)
46035419403199304991…87950651869152320001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.207 × 10⁹³(94-digit number)
92070838806398609982…75901303738304640001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.841 × 10⁹⁴(95-digit number)
18414167761279721996…51802607476609280001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.682 × 10⁹⁴(95-digit number)
36828335522559443992…03605214953218560001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.365 × 10⁹⁴(95-digit number)
73656671045118887985…07210429906437120001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.473 × 10⁹⁵(96-digit number)
14731334209023777597…14420859812874240001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.946 × 10⁹⁵(96-digit number)
29462668418047555194…28841719625748480001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.892 × 10⁹⁵(96-digit number)
58925336836095110388…57683439251496960001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.178 × 10⁹⁶(97-digit number)
11785067367219022077…15366878502993920001
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,764,530 XPM·at block #6,815,054 · 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