Block #268,966

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/22/2013, 3:01:21 PM · Difficulty 9.9557 · 6,537,621 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ff439f713296b1a18708e36d798425b0208b7f177d186b24c105e5fea6ef40c8

Height

#268,966

Difficulty

9.955726

Transactions

1

Size

1.98 KB

Version

2

Bits

09f4aa6e

Nonce

395,881

Timestamp

11/22/2013, 3:01:21 PM

Confirmations

6,537,621

Merkle Root

237fe1d52258c6da526314bda38899f84e9684eb58a0fdc5ad2f504b703c1c6a
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.

6.790 × 10⁹⁵(96-digit number)
67909579431484995794…12161210609415808001
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
6.790 × 10⁹⁵(96-digit number)
67909579431484995794…12161210609415808001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.358 × 10⁹⁶(97-digit number)
13581915886296999158…24322421218831616001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.716 × 10⁹⁶(97-digit number)
27163831772593998317…48644842437663232001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.432 × 10⁹⁶(97-digit number)
54327663545187996635…97289684875326464001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.086 × 10⁹⁷(98-digit number)
10865532709037599327…94579369750652928001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.173 × 10⁹⁷(98-digit number)
21731065418075198654…89158739501305856001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.346 × 10⁹⁷(98-digit number)
43462130836150397308…78317479002611712001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.692 × 10⁹⁷(98-digit number)
86924261672300794617…56634958005223424001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.738 × 10⁹⁸(99-digit number)
17384852334460158923…13269916010446848001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.476 × 10⁹⁸(99-digit number)
34769704668920317847…26539832020893696001
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,696,793 XPM·at block #6,806,586 · 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