Block #280,228

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/28/2013, 3:01:10 PM · Difficulty 9.9740 · 6,529,232 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
65587eb621394448887ad31fb573473c2e8d62faf364e44dfd418fa1ec487e41

Height

#280,228

Difficulty

9.973950

Transactions

3

Size

3.64 KB

Version

2

Bits

09f954ca

Nonce

38,045

Timestamp

11/28/2013, 3:01:10 PM

Confirmations

6,529,232

Merkle Root

ddd5fe0bf86008e2828223d9bfaf8def4c77ebfda2d6861ef82efa082ca26117
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.

1.491 × 10⁹⁹(100-digit number)
14912359536394928764…81865988811439091201
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
1.491 × 10⁹⁹(100-digit number)
14912359536394928764…81865988811439091201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.982 × 10⁹⁹(100-digit number)
29824719072789857529…63731977622878182401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.964 × 10⁹⁹(100-digit number)
59649438145579715058…27463955245756364801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.192 × 10¹⁰⁰(101-digit number)
11929887629115943011…54927910491512729601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.385 × 10¹⁰⁰(101-digit number)
23859775258231886023…09855820983025459201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.771 × 10¹⁰⁰(101-digit number)
47719550516463772046…19711641966050918401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.543 × 10¹⁰⁰(101-digit number)
95439101032927544093…39423283932101836801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.908 × 10¹⁰¹(102-digit number)
19087820206585508818…78846567864203673601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.817 × 10¹⁰¹(102-digit number)
38175640413171017637…57693135728407347201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.635 × 10¹⁰¹(102-digit number)
76351280826342035275…15386271456814694401
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,719,752 XPM·at block #6,809,459 · 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