Block #261,477

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/15/2013, 6:50:07 PM · Difficulty 9.9721 · 6,551,383 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7414dbb130b9c1f4b95ea588d4a9ec6709b19ad7069d388fa1e2711476ecfad0

Height

#261,477

Difficulty

9.972070

Transactions

1

Size

1.75 KB

Version

2

Bits

09f8d994

Nonce

57,910

Timestamp

11/15/2013, 6:50:07 PM

Confirmations

6,551,383

Merkle Root

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

2.238 × 10⁹⁹(100-digit number)
22389900701824271525…12892165066113827839
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
2.238 × 10⁹⁹(100-digit number)
22389900701824271525…12892165066113827839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.477 × 10⁹⁹(100-digit number)
44779801403648543051…25784330132227655679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.955 × 10⁹⁹(100-digit number)
89559602807297086102…51568660264455311359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.791 × 10¹⁰⁰(101-digit number)
17911920561459417220…03137320528910622719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.582 × 10¹⁰⁰(101-digit number)
35823841122918834441…06274641057821245439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.164 × 10¹⁰⁰(101-digit number)
71647682245837668882…12549282115642490879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.432 × 10¹⁰¹(102-digit number)
14329536449167533776…25098564231284981759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.865 × 10¹⁰¹(102-digit number)
28659072898335067552…50197128462569963519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.731 × 10¹⁰¹(102-digit number)
57318145796670135105…00394256925139927039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.146 × 10¹⁰²(103-digit number)
11463629159334027021…00788513850279854079
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:57,746,917 XPM·at block #6,812,859 · 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