Block #576,181

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/4/2014, 10:23:10 AM · Difficulty 10.9687 · 6,230,954 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a8fd592d09dbe785286ce2f78ac6d9883ba80da4b42f1f478abb7de25c05976a

Height

#576,181

Difficulty

10.968750

Transactions

5

Size

1.81 KB

Version

2

Bits

0af7fff9

Nonce

104,558,498

Timestamp

6/4/2014, 10:23:10 AM

Confirmations

6,230,954

Merkle Root

8a4bfd627e6085ab561035693a7f7790d8c6890ae5fbc7be378c325cde33f18c
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.991 × 10⁹⁹(100-digit number)
19916860010508144401…33587890131766271999
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.991 × 10⁹⁹(100-digit number)
19916860010508144401…33587890131766271999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.983 × 10⁹⁹(100-digit number)
39833720021016288803…67175780263532543999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.966 × 10⁹⁹(100-digit number)
79667440042032577607…34351560527065087999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.593 × 10¹⁰⁰(101-digit number)
15933488008406515521…68703121054130175999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.186 × 10¹⁰⁰(101-digit number)
31866976016813031043…37406242108260351999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.373 × 10¹⁰⁰(101-digit number)
63733952033626062086…74812484216520703999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.274 × 10¹⁰¹(102-digit number)
12746790406725212417…49624968433041407999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.549 × 10¹⁰¹(102-digit number)
25493580813450424834…99249936866082815999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.098 × 10¹⁰¹(102-digit number)
50987161626900849668…98499873732165631999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.019 × 10¹⁰²(103-digit number)
10197432325380169933…96999747464331263999
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,701,185 XPM·at block #6,807,134 · 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