Block #284,769

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/30/2013, 6:12:04 AM · Difficulty 9.9832 · 6,522,297 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
04367db449e5ee0141f664b6416664ca6eadf197db52b9d7506d464aa11cea3f

Height

#284,769

Difficulty

9.983249

Transactions

3

Size

653 B

Version

2

Bits

09fbb635

Nonce

6,250

Timestamp

11/30/2013, 6:12:04 AM

Confirmations

6,522,297

Merkle Root

afb01cf9fc92b37e172f01240c9b6ee40ae7e4c8d3d381e9be079ab87f32b953
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.296 × 10⁹³(94-digit number)
42965405186355648685…58915304085785119201
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.296 × 10⁹³(94-digit number)
42965405186355648685…58915304085785119201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.593 × 10⁹³(94-digit number)
85930810372711297370…17830608171570238401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.718 × 10⁹⁴(95-digit number)
17186162074542259474…35661216343140476801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.437 × 10⁹⁴(95-digit number)
34372324149084518948…71322432686280953601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.874 × 10⁹⁴(95-digit number)
68744648298169037896…42644865372561907201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.374 × 10⁹⁵(96-digit number)
13748929659633807579…85289730745123814401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.749 × 10⁹⁵(96-digit number)
27497859319267615158…70579461490247628801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.499 × 10⁹⁵(96-digit number)
54995718638535230317…41158922980495257601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.099 × 10⁹⁶(97-digit number)
10999143727707046063…82317845960990515201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.199 × 10⁹⁶(97-digit number)
21998287455414092126…64635691921981030401
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,626 XPM·at block #6,807,065 · 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