Block #272,538

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/25/2013, 7:40:21 AM · Difficulty 9.9530 · 6,536,440 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
540d4f6041e7df40d62b350f65bea1bd992ed2b555857c80b22d33574fad2c2b

Height

#272,538

Difficulty

9.953021

Transactions

1

Size

1.01 KB

Version

2

Bits

09f3f928

Nonce

52,782

Timestamp

11/25/2013, 7:40:21 AM

Confirmations

6,536,440

Merkle Root

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

1.589 × 10⁹⁴(95-digit number)
15893097024367185298…75242330707412522001
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
1.589 × 10⁹⁴(95-digit number)
15893097024367185298…75242330707412522001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.178 × 10⁹⁴(95-digit number)
31786194048734370597…50484661414825044001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.357 × 10⁹⁴(95-digit number)
63572388097468741195…00969322829650088001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.271 × 10⁹⁵(96-digit number)
12714477619493748239…01938645659300176001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.542 × 10⁹⁵(96-digit number)
25428955238987496478…03877291318600352001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.085 × 10⁹⁵(96-digit number)
50857910477974992956…07754582637200704001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.017 × 10⁹⁶(97-digit number)
10171582095594998591…15509165274401408001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.034 × 10⁹⁶(97-digit number)
20343164191189997182…31018330548802816001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.068 × 10⁹⁶(97-digit number)
40686328382379994365…62036661097605632001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.137 × 10⁹⁶(97-digit number)
81372656764759988730…24073322195211264001
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,715,880 XPM·at block #6,808,977 · 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