Block #159,755

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/11/2013, 9:22:19 AM · Difficulty 9.8638 · 6,650,534 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
48b1bd7ca53f2ba41c72795c0ffcef2206e1b6f0246fc50384d871606ccf280c

Height

#159,755

Difficulty

9.863831

Transactions

2

Size

734 B

Version

2

Bits

09dd2408

Nonce

180,005

Timestamp

9/11/2013, 9:22:19 AM

Confirmations

6,650,534

Merkle Root

7e15a4a8129d555aa035fc24e0ff76876a4d3f73f9724a30fcd66e7cb6940759
Transactions (2)
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.

3.709 × 10⁹⁶(97-digit number)
37096176559455256468…80640609169614551999
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
3.709 × 10⁹⁶(97-digit number)
37096176559455256468…80640609169614551999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.419 × 10⁹⁶(97-digit number)
74192353118910512937…61281218339229103999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.483 × 10⁹⁷(98-digit number)
14838470623782102587…22562436678458207999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.967 × 10⁹⁷(98-digit number)
29676941247564205175…45124873356916415999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.935 × 10⁹⁷(98-digit number)
59353882495128410350…90249746713832831999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.187 × 10⁹⁸(99-digit number)
11870776499025682070…80499493427665663999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.374 × 10⁹⁸(99-digit number)
23741552998051364140…60998986855331327999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.748 × 10⁹⁸(99-digit number)
47483105996102728280…21997973710662655999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.496 × 10⁹⁸(99-digit number)
94966211992205456560…43995947421325311999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.899 × 10⁹⁹(100-digit number)
18993242398441091312…87991894842650623999
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,726,387 XPM·at block #6,810,288 · 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