Block #268,536

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/22/2013, 5:35:10 AM · Difficulty 9.9569 · 6,539,576 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
383ba1fe2917751f301faf4eb57e451ca4cb7e8d1cffa61fd882a1579d0bbc69

Height

#268,536

Difficulty

9.956910

Transactions

6

Size

2.44 KB

Version

2

Bits

09f4f80c

Nonce

3,093

Timestamp

11/22/2013, 5:35:10 AM

Confirmations

6,539,576

Merkle Root

8ccb697d74548aa953f4e5d835bcf02bbb1be788b7bf066bc20f933b951dda91
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.

7.690 × 10¹⁰⁴(105-digit number)
76903582588572930771…85677106080232888321
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
7.690 × 10¹⁰⁴(105-digit number)
76903582588572930771…85677106080232888321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.538 × 10¹⁰⁵(106-digit number)
15380716517714586154…71354212160465776641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.076 × 10¹⁰⁵(106-digit number)
30761433035429172308…42708424320931553281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.152 × 10¹⁰⁵(106-digit number)
61522866070858344617…85416848641863106561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.230 × 10¹⁰⁶(107-digit number)
12304573214171668923…70833697283726213121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.460 × 10¹⁰⁶(107-digit number)
24609146428343337846…41667394567452426241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.921 × 10¹⁰⁶(107-digit number)
49218292856686675693…83334789134904852481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.843 × 10¹⁰⁶(107-digit number)
98436585713373351387…66669578269809704961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.968 × 10¹⁰⁷(108-digit number)
19687317142674670277…33339156539619409921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.937 × 10¹⁰⁷(108-digit number)
39374634285349340555…66678313079238819841
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,708,943 XPM·at block #6,808,111 · 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