Block #283,394

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/29/2013, 5:30:06 PM · Difficulty 9.9810 · 6,529,344 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
713b7673c620c6f40d2da6452f6ae523a486e94179eeb302b21a74eac265742a

Height

#283,394

Difficulty

9.981031

Transactions

1

Size

1.12 KB

Version

2

Bits

09fb24da

Nonce

4,248

Timestamp

11/29/2013, 5:30:06 PM

Confirmations

6,529,344

Merkle Root

350aa4b5137ad32f2774aec1ba431960f0ff2e278d02b1cb3d1be946ae8b78da
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.

5.985 × 10¹⁰⁰(101-digit number)
59857020441423171636…71311158929482880001
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
5.985 × 10¹⁰⁰(101-digit number)
59857020441423171636…71311158929482880001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.197 × 10¹⁰¹(102-digit number)
11971404088284634327…42622317858965760001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.394 × 10¹⁰¹(102-digit number)
23942808176569268654…85244635717931520001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.788 × 10¹⁰¹(102-digit number)
47885616353138537308…70489271435863040001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.577 × 10¹⁰¹(102-digit number)
95771232706277074617…40978542871726080001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.915 × 10¹⁰²(103-digit number)
19154246541255414923…81957085743452160001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.830 × 10¹⁰²(103-digit number)
38308493082510829847…63914171486904320001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.661 × 10¹⁰²(103-digit number)
76616986165021659694…27828342973808640001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.532 × 10¹⁰³(104-digit number)
15323397233004331938…55656685947617280001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.064 × 10¹⁰³(104-digit number)
30646794466008663877…11313371895234560001
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,745,946 XPM·at block #6,812,737 · 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