Block #280,024

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/28/2013, 1:22:55 PM · Difficulty 9.9734 · 6,531,036 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a1cd73cb4e6a3c2819197da9949db5cdff93fb64f902bdbdd2ff93567b17c4f8

Height

#280,024

Difficulty

9.973387

Transactions

2

Size

3.07 KB

Version

2

Bits

09f92fe4

Nonce

652

Timestamp

11/28/2013, 1:22:55 PM

Confirmations

6,531,036

Merkle Root

6db97d3f41ba3cb813f39f935a7382f38032ba417172897061296b15c3636861
Transactions (2)
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.

2.352 × 10¹⁰¹(102-digit number)
23521602235570743678…56071005706138480641
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
2.352 × 10¹⁰¹(102-digit number)
23521602235570743678…56071005706138480641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.704 × 10¹⁰¹(102-digit number)
47043204471141487356…12142011412276961281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.408 × 10¹⁰¹(102-digit number)
94086408942282974712…24284022824553922561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.881 × 10¹⁰²(103-digit number)
18817281788456594942…48568045649107845121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.763 × 10¹⁰²(103-digit number)
37634563576913189884…97136091298215690241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.526 × 10¹⁰²(103-digit number)
75269127153826379769…94272182596431380481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.505 × 10¹⁰³(104-digit number)
15053825430765275953…88544365192862760961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.010 × 10¹⁰³(104-digit number)
30107650861530551907…77088730385725521921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.021 × 10¹⁰³(104-digit number)
60215301723061103815…54177460771451043841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.204 × 10¹⁰⁴(105-digit number)
12043060344612220763…08354921542902087681
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,732,585 XPM·at block #6,811,059 · 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