Block #291,069

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/3/2013, 12:08:29 AM · Difficulty 9.9896 · 6,519,096 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
101426e4041ab0ada6393895fe925e02b27a2f36e0c4807bff2227d09232a7f3

Height

#291,069

Difficulty

9.989640

Transactions

3

Size

1.25 KB

Version

2

Bits

09fd590f

Nonce

3,686

Timestamp

12/3/2013, 12:08:29 AM

Confirmations

6,519,096

Merkle Root

c9fa95a3367a0b25fa461b4756e50bd611c4f7622561eeda59ca8db5d8dfec34
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.

8.369 × 10¹⁰³(104-digit number)
83690230000608082577…53245573640273847999
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
8.369 × 10¹⁰³(104-digit number)
83690230000608082577…53245573640273847999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.673 × 10¹⁰⁴(105-digit number)
16738046000121616515…06491147280547695999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.347 × 10¹⁰⁴(105-digit number)
33476092000243233031…12982294561095391999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.695 × 10¹⁰⁴(105-digit number)
66952184000486466062…25964589122190783999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.339 × 10¹⁰⁵(106-digit number)
13390436800097293212…51929178244381567999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.678 × 10¹⁰⁵(106-digit number)
26780873600194586424…03858356488763135999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.356 × 10¹⁰⁵(106-digit number)
53561747200389172849…07716712977526271999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.071 × 10¹⁰⁶(107-digit number)
10712349440077834569…15433425955052543999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.142 × 10¹⁰⁶(107-digit number)
21424698880155669139…30866851910105087999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.284 × 10¹⁰⁶(107-digit number)
42849397760311338279…61733703820210175999
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,725,387 XPM·at block #6,810,164 · 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