Block #332,776

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/28/2013, 7:38:17 AM · Difficulty 10.1662 · 6,475,344 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c421ffd7163210d02b0a3a2620e1cb2fce155bd8f607bf7404944413b5cf09c0

Height

#332,776

Difficulty

10.166209

Transactions

33

Size

10.02 KB

Version

2

Bits

0a2a8cab

Nonce

34,889

Timestamp

12/28/2013, 7:38:17 AM

Confirmations

6,475,344

Merkle Root

21de7838ab799197167ee98788dcd5bd840b40173260d58ad5435245e3b2ba7f
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.724 × 10⁹⁸(99-digit number)
17244387681168389085…13967581674987329199
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.724 × 10⁹⁸(99-digit number)
17244387681168389085…13967581674987329199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.448 × 10⁹⁸(99-digit number)
34488775362336778171…27935163349974658399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.897 × 10⁹⁸(99-digit number)
68977550724673556342…55870326699949316799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.379 × 10⁹⁹(100-digit number)
13795510144934711268…11740653399898633599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.759 × 10⁹⁹(100-digit number)
27591020289869422537…23481306799797267199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.518 × 10⁹⁹(100-digit number)
55182040579738845074…46962613599594534399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.103 × 10¹⁰⁰(101-digit number)
11036408115947769014…93925227199189068799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.207 × 10¹⁰⁰(101-digit number)
22072816231895538029…87850454398378137599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.414 × 10¹⁰⁰(101-digit number)
44145632463791076059…75700908796756275199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.829 × 10¹⁰⁰(101-digit number)
88291264927582152119…51401817593512550399
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,708,999 XPM·at block #6,808,119 · 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