Block #468,963

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/31/2014, 8:57:44 PM · Difficulty 10.4332 · 6,339,211 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
127e449aad4f5975f79dc2de397dbdf8be32effcc27b3060c8b7bc544e6e7864

Height

#468,963

Difficulty

10.433151

Transactions

5

Size

1.04 KB

Version

2

Bits

0a6ee2fc

Nonce

552,280

Timestamp

3/31/2014, 8:57:44 PM

Confirmations

6,339,211

Merkle Root

43f7093da7fa26dcf5ab1e2929f8c2cc0ce972332307db88322575a52b854c8e
Transactions (5)
1 in → 1 out9.2100 XPM116 B
2 in → 1 out18.6200 XPM271 B
2 in → 1 out18.8500 XPM273 B
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.

1.491 × 10¹⁰³(104-digit number)
14911142741924455121…65233560425352178401
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
1.491 × 10¹⁰³(104-digit number)
14911142741924455121…65233560425352178401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.982 × 10¹⁰³(104-digit number)
29822285483848910242…30467120850704356801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.964 × 10¹⁰³(104-digit number)
59644570967697820484…60934241701408713601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.192 × 10¹⁰⁴(105-digit number)
11928914193539564096…21868483402817427201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.385 × 10¹⁰⁴(105-digit number)
23857828387079128193…43736966805634854401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.771 × 10¹⁰⁴(105-digit number)
47715656774158256387…87473933611269708801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.543 × 10¹⁰⁴(105-digit number)
95431313548316512774…74947867222539417601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.908 × 10¹⁰⁵(106-digit number)
19086262709663302554…49895734445078835201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.817 × 10¹⁰⁵(106-digit number)
38172525419326605109…99791468890157670401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.634 × 10¹⁰⁵(106-digit number)
76345050838653210219…99582937780315340801
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,709,440 XPM·at block #6,808,173 · 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