Block #513,421

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/27/2014, 12:39:14 PM · Difficulty 10.8352 · 6,317,062 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
19ccb9011d5e1db371c6d305b72dde7f10f9a6fa06642c89bc9d27a47e5db532

Height

#513,421

Difficulty

10.835211

Transactions

1

Size

697 B

Version

2

Bits

0ad5d063

Nonce

4,139

Timestamp

4/27/2014, 12:39:14 PM

Confirmations

6,317,062

Merkle Root

a95cc802ed34810b0fbb1f2c375165310b0a4367965898df4a9eefb7ae62ab7c
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.449 × 10⁹⁴(95-digit number)
24493246619225783836…13495268989863536639
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.449 × 10⁹⁴(95-digit number)
24493246619225783836…13495268989863536639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.898 × 10⁹⁴(95-digit number)
48986493238451567672…26990537979727073279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.797 × 10⁹⁴(95-digit number)
97972986476903135345…53981075959454146559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.959 × 10⁹⁵(96-digit number)
19594597295380627069…07962151918908293119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.918 × 10⁹⁵(96-digit number)
39189194590761254138…15924303837816586239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.837 × 10⁹⁵(96-digit number)
78378389181522508276…31848607675633172479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.567 × 10⁹⁶(97-digit number)
15675677836304501655…63697215351266344959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.135 × 10⁹⁶(97-digit number)
31351355672609003310…27394430702532689919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.270 × 10⁹⁶(97-digit number)
62702711345218006621…54788861405065379839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.254 × 10⁹⁷(98-digit number)
12540542269043601324…09577722810130759679
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,888,112 XPM·at block #6,830,482 · 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