Block #464,212

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/28/2014, 3:36:50 PM · Difficulty 10.4188 · 6,342,073 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2869169b152af4ac061be5fab8f70f6dd69e0c97cfe0378b86c19a5be221e3f0

Height

#464,212

Difficulty

10.418850

Transactions

4

Size

880 B

Version

2

Bits

0a6b39be

Nonce

1,271,342

Timestamp

3/28/2014, 3:36:50 PM

Confirmations

6,342,073

Merkle Root

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

8.970 × 10⁹⁸(99-digit number)
89700610776558072227…98217125130128175041
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
8.970 × 10⁹⁸(99-digit number)
89700610776558072227…98217125130128175041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.794 × 10⁹⁹(100-digit number)
17940122155311614445…96434250260256350081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.588 × 10⁹⁹(100-digit number)
35880244310623228891…92868500520512700161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.176 × 10⁹⁹(100-digit number)
71760488621246457782…85737001041025400321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.435 × 10¹⁰⁰(101-digit number)
14352097724249291556…71474002082050800641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.870 × 10¹⁰⁰(101-digit number)
28704195448498583112…42948004164101601281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.740 × 10¹⁰⁰(101-digit number)
57408390896997166225…85896008328203202561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.148 × 10¹⁰¹(102-digit number)
11481678179399433245…71792016656406405121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.296 × 10¹⁰¹(102-digit number)
22963356358798866490…43584033312812810241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.592 × 10¹⁰¹(102-digit number)
45926712717597732980…87168066625625620481
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,694,366 XPM·at block #6,806,284 · 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