Block #320,988

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/20/2013, 12:58:08 AM · Difficulty 10.1850 · 6,489,467 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
89acc53ee96c03934241bc69fc984d71c1a15c6db4b57086831cc416dc757496

Height

#320,988

Difficulty

10.184974

Transactions

11

Size

2.81 KB

Version

2

Bits

0a2f5a79

Nonce

62,012

Timestamp

12/20/2013, 12:58:08 AM

Confirmations

6,489,467

Merkle Root

230f3192029b90dabbe2e69dc124b3aedacbb949566490b3c1948bab5c6c56ec
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.057 × 10¹⁰⁴(105-digit number)
10575810688464953776…59949148255535718399
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.057 × 10¹⁰⁴(105-digit number)
10575810688464953776…59949148255535718399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.115 × 10¹⁰⁴(105-digit number)
21151621376929907552…19898296511071436799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.230 × 10¹⁰⁴(105-digit number)
42303242753859815105…39796593022142873599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.460 × 10¹⁰⁴(105-digit number)
84606485507719630211…79593186044285747199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.692 × 10¹⁰⁵(106-digit number)
16921297101543926042…59186372088571494399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.384 × 10¹⁰⁵(106-digit number)
33842594203087852084…18372744177142988799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.768 × 10¹⁰⁵(106-digit number)
67685188406175704169…36745488354285977599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.353 × 10¹⁰⁶(107-digit number)
13537037681235140833…73490976708571955199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.707 × 10¹⁰⁶(107-digit number)
27074075362470281667…46981953417143910399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.414 × 10¹⁰⁶(107-digit number)
54148150724940563335…93963906834287820799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.082 × 10¹⁰⁷(108-digit number)
10829630144988112667…87927813668575641599
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,727,726 XPM·at block #6,810,454 · 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