Block #282,383

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/29/2013, 9:04:28 AM · Difficulty 9.9790 · 6,534,582 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7afb37154100e54ec97a918ee1167baaeecd4baf89351e800f0487ff44182230

Height

#282,383

Difficulty

9.978996

Transactions

4

Size

879 B

Version

2

Bits

09fa9f75

Nonce

63,676

Timestamp

11/29/2013, 9:04:28 AM

Confirmations

6,534,582

Merkle Root

837cb484142655fa1a6d8f28d7bf8a9df7b5092d6bff62ef771ea06aff39862d
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.938 × 10⁹¹(92-digit number)
59382526324029547472…12487648866503789331
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.938 × 10⁹¹(92-digit number)
59382526324029547472…12487648866503789331
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.187 × 10⁹²(93-digit number)
11876505264805909494…24975297733007578661
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.375 × 10⁹²(93-digit number)
23753010529611818989…49950595466015157321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.750 × 10⁹²(93-digit number)
47506021059223637978…99901190932030314641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.501 × 10⁹²(93-digit number)
95012042118447275956…99802381864060629281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.900 × 10⁹³(94-digit number)
19002408423689455191…99604763728121258561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.800 × 10⁹³(94-digit number)
38004816847378910382…99209527456242517121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.600 × 10⁹³(94-digit number)
76009633694757820765…98419054912485034241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.520 × 10⁹⁴(95-digit number)
15201926738951564153…96838109824970068481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.040 × 10⁹⁴(95-digit number)
30403853477903128306…93676219649940136961
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,779,756 XPM·at block #6,816,964 · 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