Block #374,488

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/25/2014, 1:38:28 AM · Difficulty 10.4229 · 6,442,602 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
83ac7dd91c8b622693c0954fccf1ffd9e4cd705ffde20fc8c063b795295bc060

Height

#374,488

Difficulty

10.422907

Transactions

6

Size

1.31 KB

Version

2

Bits

0a6c43a4

Nonce

194,214

Timestamp

1/25/2014, 1:38:28 AM

Confirmations

6,442,602

Merkle Root

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

2.976 × 10¹⁰⁰(101-digit number)
29763902862350971719…74035734259166468759
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
2.976 × 10¹⁰⁰(101-digit number)
29763902862350971719…74035734259166468759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.952 × 10¹⁰⁰(101-digit number)
59527805724701943439…48071468518332937519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.190 × 10¹⁰¹(102-digit number)
11905561144940388687…96142937036665875039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.381 × 10¹⁰¹(102-digit number)
23811122289880777375…92285874073331750079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.762 × 10¹⁰¹(102-digit number)
47622244579761554751…84571748146663500159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.524 × 10¹⁰¹(102-digit number)
95244489159523109502…69143496293327000319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.904 × 10¹⁰²(103-digit number)
19048897831904621900…38286992586654000639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.809 × 10¹⁰²(103-digit number)
38097795663809243801…76573985173308001279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.619 × 10¹⁰²(103-digit number)
76195591327618487602…53147970346616002559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.523 × 10¹⁰³(104-digit number)
15239118265523697520…06295940693232005119
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,780,759 XPM·at block #6,817,089 · 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