Block #371,123

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/22/2014, 3:22:08 PM · Difficulty 10.4369 · 6,442,704 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a607d51ebb41f4bc30de8deb80626756aab3f4ce212d98a31ed777bc2b3451c7

Height

#371,123

Difficulty

10.436891

Transactions

9

Size

1.97 KB

Version

2

Bits

0a6fd810

Nonce

230,059

Timestamp

1/22/2014, 3:22:08 PM

Confirmations

6,442,704

Merkle Root

a379f3ce54aed48d35abc2c18ffb69c20b2b5f1299cc57984b7f4630086e12a7
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.626 × 10⁹⁵(96-digit number)
26264236478804645028…79171339660694111999
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.626 × 10⁹⁵(96-digit number)
26264236478804645028…79171339660694111999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.252 × 10⁹⁵(96-digit number)
52528472957609290057…58342679321388223999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.050 × 10⁹⁶(97-digit number)
10505694591521858011…16685358642776447999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.101 × 10⁹⁶(97-digit number)
21011389183043716023…33370717285552895999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.202 × 10⁹⁶(97-digit number)
42022778366087432046…66741434571105791999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.404 × 10⁹⁶(97-digit number)
84045556732174864092…33482869142211583999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.680 × 10⁹⁷(98-digit number)
16809111346434972818…66965738284423167999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.361 × 10⁹⁷(98-digit number)
33618222692869945637…33931476568846335999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.723 × 10⁹⁷(98-digit number)
67236445385739891274…67862953137692671999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.344 × 10⁹⁸(99-digit number)
13447289077147978254…35725906275385343999
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,754,685 XPM·at block #6,813,826 · 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