Block #262,936

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/17/2013, 8:26:40 AM · Difficulty 9.9673 · 6,581,621 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3ad38c28e12cbece27eb07fe00bab12815c1369d4b6c9e45639e7695daadbee2

Height

#262,936

Difficulty

9.967343

Transactions

8

Size

3.51 KB

Version

2

Bits

09f7a3ca

Nonce

7,393

Timestamp

11/17/2013, 8:26:40 AM

Confirmations

6,581,621

Merkle Root

9c07d3c9d81017142276ddc954cd2412849ae69285c188e437ca115eded03e37
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.105 × 10⁹⁵(96-digit number)
61059121477211184749…81282779135923296599
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.105 × 10⁹⁵(96-digit number)
61059121477211184749…81282779135923296599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.221 × 10⁹⁶(97-digit number)
12211824295442236949…62565558271846593199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.442 × 10⁹⁶(97-digit number)
24423648590884473899…25131116543693186399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.884 × 10⁹⁶(97-digit number)
48847297181768947799…50262233087386372799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.769 × 10⁹⁶(97-digit number)
97694594363537895599…00524466174772745599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.953 × 10⁹⁷(98-digit number)
19538918872707579119…01048932349545491199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.907 × 10⁹⁷(98-digit number)
39077837745415158239…02097864699090982399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.815 × 10⁹⁷(98-digit number)
78155675490830316479…04195729398181964799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.563 × 10⁹⁸(99-digit number)
15631135098166063295…08391458796363929599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.126 × 10⁹⁸(99-digit number)
31262270196332126591…16782917592727859199
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:58,000,859 XPM·at block #6,844,556 · 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