Block #483,222

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/9/2014, 10:35:47 PM · Difficulty 10.5591 · 6,327,196 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
df6fe5bb2c6152615fdf13923f793a0cdc0524dbf632e152fb7d65ad976ee72b

Height

#483,222

Difficulty

10.559146

Transactions

2

Size

1.25 KB

Version

2

Bits

0a8f242a

Nonce

909,199

Timestamp

4/9/2014, 10:35:47 PM

Confirmations

6,327,196

Merkle Root

91cfc7a31d2f683289a4869f5b9aaf167059af070165076ad07500657327ac61
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.522 × 10⁹⁷(98-digit number)
25228997382265077188…88900201449284972801
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.522 × 10⁹⁷(98-digit number)
25228997382265077188…88900201449284972801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.045 × 10⁹⁷(98-digit number)
50457994764530154376…77800402898569945601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.009 × 10⁹⁸(99-digit number)
10091598952906030875…55600805797139891201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.018 × 10⁹⁸(99-digit number)
20183197905812061750…11201611594279782401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.036 × 10⁹⁸(99-digit number)
40366395811624123501…22403223188559564801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.073 × 10⁹⁸(99-digit number)
80732791623248247002…44806446377119129601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.614 × 10⁹⁹(100-digit number)
16146558324649649400…89612892754238259201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.229 × 10⁹⁹(100-digit number)
32293116649299298801…79225785508476518401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.458 × 10⁹⁹(100-digit number)
64586233298598597602…58451571016953036801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.291 × 10¹⁰⁰(101-digit number)
12917246659719719520…16903142033906073601
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,727,425 XPM·at block #6,810,417 · 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