Block #971,213

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/12/2015, 5:59:52 PM · Difficulty 10.8357 · 5,836,918 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0928dcd3c6eb87b999852d2f2de80e543eec133c2a337a84afce2f068790ccad

Height

#971,213

Difficulty

10.835745

Transactions

9

Size

38.82 KB

Version

2

Bits

0ad5f360

Nonce

51,259,249

Timestamp

3/12/2015, 5:59:52 PM

Confirmations

5,836,918

Merkle Root

2391b2cb2f3cfeada907d16b099390c017f82ae911af78a6f3d4f44fdc6f611e
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.

5.053 × 10⁹⁸(99-digit number)
50530914119635996374…88897543688361738239
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
5.053 × 10⁹⁸(99-digit number)
50530914119635996374…88897543688361738239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.010 × 10⁹⁹(100-digit number)
10106182823927199274…77795087376723476479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.021 × 10⁹⁹(100-digit number)
20212365647854398549…55590174753446952959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.042 × 10⁹⁹(100-digit number)
40424731295708797099…11180349506893905919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.084 × 10⁹⁹(100-digit number)
80849462591417594199…22360699013787811839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.616 × 10¹⁰⁰(101-digit number)
16169892518283518839…44721398027575623679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.233 × 10¹⁰⁰(101-digit number)
32339785036567037679…89442796055151247359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.467 × 10¹⁰⁰(101-digit number)
64679570073134075359…78885592110302494719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.293 × 10¹⁰¹(102-digit number)
12935914014626815071…57771184220604989439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.587 × 10¹⁰¹(102-digit number)
25871828029253630143…15542368441209978879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.174 × 10¹⁰¹(102-digit number)
51743656058507260287…31084736882419957759
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,709,089 XPM·at block #6,808,130 · 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