Block #154,937

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/8/2013, 12:13:05 AM · Difficulty 9.8650 · 6,651,632 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
628b9fe346fef07da0b1379412ef817ff2ad13fe9daf3daa1c7429d32ecc76f6

Height

#154,937

Difficulty

9.865039

Transactions

2

Size

506 B

Version

2

Bits

09dd7331

Nonce

1,312

Timestamp

9/8/2013, 12:13:05 AM

Confirmations

6,651,632

Merkle Root

3108774cf5b78cc378f9de07b709236775d427bc6a16cc4cfd6f555b7b325d02
Transactions (2)
1 in → 1 out10.2700 XPM109 B
2 in → 1 out503.3800 XPM307 B
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.235 × 10⁹⁴(95-digit number)
62352148088256939961…31743354937058348501
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.235 × 10⁹⁴(95-digit number)
62352148088256939961…31743354937058348501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.247 × 10⁹⁵(96-digit number)
12470429617651387992…63486709874116697001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.494 × 10⁹⁵(96-digit number)
24940859235302775984…26973419748233394001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.988 × 10⁹⁵(96-digit number)
49881718470605551968…53946839496466788001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.976 × 10⁹⁵(96-digit number)
99763436941211103937…07893678992933576001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.995 × 10⁹⁶(97-digit number)
19952687388242220787…15787357985867152001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.990 × 10⁹⁶(97-digit number)
39905374776484441575…31574715971734304001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.981 × 10⁹⁶(97-digit number)
79810749552968883150…63149431943468608001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.596 × 10⁹⁷(98-digit number)
15962149910593776630…26298863886937216001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.192 × 10⁹⁷(98-digit number)
31924299821187553260…52597727773874432001
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,649 XPM·at block #6,806,568 · 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