Block #493,014

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/15/2014, 11:58:41 AM · Difficulty 10.6926 · 6,314,086 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b80df7b0a3e9726ef245275c227940c8352dafa89395029086132f0d9db8e8c0

Height

#493,014

Difficulty

10.692583

Transactions

2

Size

54.47 KB

Version

2

Bits

0ab14d20

Nonce

105,995

Timestamp

4/15/2014, 11:58:41 AM

Confirmations

6,314,086

Merkle Root

9b6e4cfb9bf6b69ee613e2025a32cc097e917ea9d9a05a09c2905dc17c0c55e7
Transactions (2)
1 in → 1 out9.3100 XPM110 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.

3.352 × 10⁹⁹(100-digit number)
33526229929872384081…09631834851976786101
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
3.352 × 10⁹⁹(100-digit number)
33526229929872384081…09631834851976786101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.705 × 10⁹⁹(100-digit number)
67052459859744768162…19263669703953572201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.341 × 10¹⁰⁰(101-digit number)
13410491971948953632…38527339407907144401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.682 × 10¹⁰⁰(101-digit number)
26820983943897907265…77054678815814288801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.364 × 10¹⁰⁰(101-digit number)
53641967887795814530…54109357631628577601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.072 × 10¹⁰¹(102-digit number)
10728393577559162906…08218715263257155201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.145 × 10¹⁰¹(102-digit number)
21456787155118325812…16437430526514310401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.291 × 10¹⁰¹(102-digit number)
42913574310236651624…32874861053028620801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.582 × 10¹⁰¹(102-digit number)
85827148620473303248…65749722106057241601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.716 × 10¹⁰²(103-digit number)
17165429724094660649…31499444212114483201
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,700,899 XPM·at block #6,807,099 · 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