Block #284,535

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/30/2013, 4:07:19 AM · Difficulty 9.9829 · 6,542,765 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b8a9714e5a51b55eb059bcdeb97cfdb7f969bfd216adc30a20ef139b8533c0bc

Height

#284,535

Difficulty

9.982870

Transactions

3

Size

798 B

Version

2

Bits

09fb9d60

Nonce

13,717

Timestamp

11/30/2013, 4:07:19 AM

Confirmations

6,542,765

Merkle Root

d891af394b7cb63cdf4d989b5f5edbab541888b93d6a7cd65f4a704c355f44e5
Transactions (3)
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.

4.510 × 10⁹⁶(97-digit number)
45101043479575446178…15578095590406805121
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
4.510 × 10⁹⁶(97-digit number)
45101043479575446178…15578095590406805121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.020 × 10⁹⁶(97-digit number)
90202086959150892356…31156191180813610241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.804 × 10⁹⁷(98-digit number)
18040417391830178471…62312382361627220481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.608 × 10⁹⁷(98-digit number)
36080834783660356942…24624764723254440961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.216 × 10⁹⁷(98-digit number)
72161669567320713885…49249529446508881921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.443 × 10⁹⁸(99-digit number)
14432333913464142777…98499058893017763841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.886 × 10⁹⁸(99-digit number)
28864667826928285554…96998117786035527681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.772 × 10⁹⁸(99-digit number)
57729335653856571108…93996235572071055361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.154 × 10⁹⁹(100-digit number)
11545867130771314221…87992471144142110721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.309 × 10⁹⁹(100-digit number)
23091734261542628443…75984942288284221441
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,862,510 XPM·at block #6,827,299 · 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