Block #356,403

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/12/2014, 5:37:55 PM · Difficulty 10.3785 · 6,454,250 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
56768f52e63199fd5764de13dab42f1f5764a07f07f70bb44b271c82cc948ff7

Height

#356,403

Difficulty

10.378459

Transactions

6

Size

3.88 KB

Version

2

Bits

0a60e2ab

Nonce

112,453

Timestamp

1/12/2014, 5:37:55 PM

Confirmations

6,454,250

Merkle Root

667bf70d37f58aaa6d3b4f8a007faef30ec46f96d7936e037804701eb359007d
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.

7.552 × 10⁹⁸(99-digit number)
75529147559380691974…75067184839507033119
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
7.552 × 10⁹⁸(99-digit number)
75529147559380691974…75067184839507033119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.510 × 10⁹⁹(100-digit number)
15105829511876138394…50134369679014066239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.021 × 10⁹⁹(100-digit number)
30211659023752276789…00268739358028132479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.042 × 10⁹⁹(100-digit number)
60423318047504553579…00537478716056264959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.208 × 10¹⁰⁰(101-digit number)
12084663609500910715…01074957432112529919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.416 × 10¹⁰⁰(101-digit number)
24169327219001821431…02149914864225059839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.833 × 10¹⁰⁰(101-digit number)
48338654438003642863…04299829728450119679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.667 × 10¹⁰⁰(101-digit number)
96677308876007285727…08599659456900239359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.933 × 10¹⁰¹(102-digit number)
19335461775201457145…17199318913800478719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.867 × 10¹⁰¹(102-digit number)
38670923550402914290…34398637827600957439
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,729,314 XPM·at block #6,810,652 · 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