Block #280,968

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/28/2013, 8:57:35 PM · Difficulty 9.9759 · 6,526,397 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0d0bd75cdfb3bb5ad25a47f6b55033929d341034821baa871039134561123323

Height

#280,968

Difficulty

9.975883

Transactions

1

Size

1.11 KB

Version

2

Bits

09f9d37e

Nonce

36,290

Timestamp

11/28/2013, 8:57:35 PM

Confirmations

6,526,397

Merkle Root

8e6f149a05fd4cfe7f5d5ac0250628c677ff4dbf455a8428dda50c0249f73125
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.184 × 10⁹⁵(96-digit number)
41842982788820537408…16385933386808404481
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.184 × 10⁹⁵(96-digit number)
41842982788820537408…16385933386808404481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.368 × 10⁹⁵(96-digit number)
83685965577641074817…32771866773616808961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.673 × 10⁹⁶(97-digit number)
16737193115528214963…65543733547233617921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.347 × 10⁹⁶(97-digit number)
33474386231056429927…31087467094467235841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.694 × 10⁹⁶(97-digit number)
66948772462112859854…62174934188934471681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.338 × 10⁹⁷(98-digit number)
13389754492422571970…24349868377868943361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.677 × 10⁹⁷(98-digit number)
26779508984845143941…48699736755737886721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.355 × 10⁹⁷(98-digit number)
53559017969690287883…97399473511475773441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.071 × 10⁹⁸(99-digit number)
10711803593938057576…94798947022951546881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.142 × 10⁹⁸(99-digit number)
21423607187876115153…89597894045903093761
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,702,943 XPM·at block #6,807,364 · 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