Block #331,266

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/27/2013, 6:29:04 AM · Difficulty 10.1656 · 6,494,201 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fba983f23981a6df2bcfea5494a4b7a1fe21fb037730311b56b84f0d4bb97afd

Height

#331,266

Difficulty

10.165618

Transactions

5

Size

1.22 KB

Version

2

Bits

0a2a65f8

Nonce

188,564

Timestamp

12/27/2013, 6:29:04 AM

Confirmations

6,494,201

Merkle Root

b87134a917865f7e5317b5b04b6391b570413b4734ce7dbb53fb32c99e81b214
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.276 × 10⁹⁷(98-digit number)
12763587179047812750…51426607205368012799
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.276 × 10⁹⁷(98-digit number)
12763587179047812750…51426607205368012799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.552 × 10⁹⁷(98-digit number)
25527174358095625500…02853214410736025599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.105 × 10⁹⁷(98-digit number)
51054348716191251000…05706428821472051199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.021 × 10⁹⁸(99-digit number)
10210869743238250200…11412857642944102399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.042 × 10⁹⁸(99-digit number)
20421739486476500400…22825715285888204799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.084 × 10⁹⁸(99-digit number)
40843478972953000800…45651430571776409599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.168 × 10⁹⁸(99-digit number)
81686957945906001601…91302861143552819199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.633 × 10⁹⁹(100-digit number)
16337391589181200320…82605722287105638399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.267 × 10⁹⁹(100-digit number)
32674783178362400640…65211444574211276799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.534 × 10⁹⁹(100-digit number)
65349566356724801281…30422889148422553599
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,847,828 XPM·at block #6,825,466 · 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