Block #262,274

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/16/2013, 4:26:04 PM · Difficulty 9.9692 · 6,562,970 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2cb5a4f2434b79fee5b98ddfe63395b1eda55734d55ab33ba3a7d3ba396a3d64

Height

#262,274

Difficulty

9.969199

Transactions

2

Size

458 B

Version

2

Bits

09f81d70

Nonce

340,397

Timestamp

11/16/2013, 4:26:04 PM

Confirmations

6,562,970

Merkle Root

4595b30f654215f891289af4a24500d3bc4eb5b8136d60bdb583a87f0bc3eb9a
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.344 × 10⁹³(94-digit number)
13443174403889438515…65452876705185008001
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.344 × 10⁹³(94-digit number)
13443174403889438515…65452876705185008001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.688 × 10⁹³(94-digit number)
26886348807778877031…30905753410370016001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.377 × 10⁹³(94-digit number)
53772697615557754063…61811506820740032001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.075 × 10⁹⁴(95-digit number)
10754539523111550812…23623013641480064001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.150 × 10⁹⁴(95-digit number)
21509079046223101625…47246027282960128001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.301 × 10⁹⁴(95-digit number)
43018158092446203250…94492054565920256001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.603 × 10⁹⁴(95-digit number)
86036316184892406501…88984109131840512001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.720 × 10⁹⁵(96-digit number)
17207263236978481300…77968218263681024001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.441 × 10⁹⁵(96-digit number)
34414526473956962600…55936436527362048001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.882 × 10⁹⁵(96-digit number)
68829052947913925201…11872873054724096001
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,846,046 XPM·at block #6,825,243 · 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