Block #161,561

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/12/2013, 6:05:40 PM · Difficulty 9.8596 · 6,654,836 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8e70af4ac6e4f9cc0b2ade5c9ef5fcc2b43499569fa779b02db57cfb068d04a0

Height

#161,561

Difficulty

9.859622

Transactions

8

Size

2.32 KB

Version

2

Bits

09dc102b

Nonce

337,063

Timestamp

9/12/2013, 6:05:40 PM

Confirmations

6,654,836

Merkle Root

4e10631ed325bc3c7fe87f9e4bb40dab0f0d4a4d1c4b38b5681345847fc75e8d
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.373 × 10⁹⁶(97-digit number)
13733845096227580617…45298218998120854719
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.373 × 10⁹⁶(97-digit number)
13733845096227580617…45298218998120854719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.746 × 10⁹⁶(97-digit number)
27467690192455161235…90596437996241709439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.493 × 10⁹⁶(97-digit number)
54935380384910322471…81192875992483418879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.098 × 10⁹⁷(98-digit number)
10987076076982064494…62385751984966837759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.197 × 10⁹⁷(98-digit number)
21974152153964128988…24771503969933675519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.394 × 10⁹⁷(98-digit number)
43948304307928257977…49543007939867351039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.789 × 10⁹⁷(98-digit number)
87896608615856515954…99086015879734702079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.757 × 10⁹⁸(99-digit number)
17579321723171303190…98172031759469404159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.515 × 10⁹⁸(99-digit number)
35158643446342606381…96344063518938808319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.031 × 10⁹⁸(99-digit number)
70317286892685212763…92688127037877616639
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,775,299 XPM·at block #6,816,396 · 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