Block #448,361

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/17/2014, 8:59:54 PM · Difficulty 10.3680 · 6,368,498 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
286e4823cefaaa9c7cea38271eca9705a44e641b1c46c848c12753a14128a186

Height

#448,361

Difficulty

10.367951

Transactions

6

Size

1.35 KB

Version

2

Bits

0a5e3207

Nonce

43,242

Timestamp

3/17/2014, 8:59:54 PM

Confirmations

6,368,498

Merkle Root

4319650eb5516b267b8309d37ac555d244f613f38aec2e3ddc6874706d6dc3d8
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.178 × 10⁹²(93-digit number)
21789413901332973634…14926259177737063471
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.178 × 10⁹²(93-digit number)
21789413901332973634…14926259177737063471
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.357 × 10⁹²(93-digit number)
43578827802665947268…29852518355474126941
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.715 × 10⁹²(93-digit number)
87157655605331894536…59705036710948253881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.743 × 10⁹³(94-digit number)
17431531121066378907…19410073421896507761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.486 × 10⁹³(94-digit number)
34863062242132757814…38820146843793015521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.972 × 10⁹³(94-digit number)
69726124484265515629…77640293687586031041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.394 × 10⁹⁴(95-digit number)
13945224896853103125…55280587375172062081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.789 × 10⁹⁴(95-digit number)
27890449793706206251…10561174750344124161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.578 × 10⁹⁴(95-digit number)
55780899587412412503…21122349500688248321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.115 × 10⁹⁵(96-digit number)
11156179917482482500…42244699001376496641
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,778,916 XPM·at block #6,816,858 · 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