Block #272,734

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/25/2013, 10:21:57 AM · Difficulty 9.9534 · 6,535,713 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7b411faba330e66a442f802d685767065497f55c829ae7b865084a67a5395a37

Height

#272,734

Difficulty

9.953396

Transactions

10

Size

12.38 KB

Version

2

Bits

09f411c4

Nonce

3,489

Timestamp

11/25/2013, 10:21:57 AM

Confirmations

6,535,713

Merkle Root

b52ec4689772a7b744e4324fb38a7108604ee26cda7951d83e7fcda6591040e0
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.258 × 10¹⁰³(104-digit number)
22586229073687550306…91210305133668331999
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.258 × 10¹⁰³(104-digit number)
22586229073687550306…91210305133668331999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.517 × 10¹⁰³(104-digit number)
45172458147375100613…82420610267336663999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.034 × 10¹⁰³(104-digit number)
90344916294750201227…64841220534673327999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.806 × 10¹⁰⁴(105-digit number)
18068983258950040245…29682441069346655999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.613 × 10¹⁰⁴(105-digit number)
36137966517900080490…59364882138693311999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.227 × 10¹⁰⁴(105-digit number)
72275933035800160981…18729764277386623999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.445 × 10¹⁰⁵(106-digit number)
14455186607160032196…37459528554773247999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.891 × 10¹⁰⁵(106-digit number)
28910373214320064392…74919057109546495999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.782 × 10¹⁰⁵(106-digit number)
57820746428640128785…49838114219092991999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.156 × 10¹⁰⁶(107-digit number)
11564149285728025757…99676228438185983999
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,711,637 XPM·at block #6,808,446 · 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