Block #357,637

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/13/2014, 1:09:55 PM · Difficulty 10.3797 · 6,451,710 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0bfef725e9a6e7dde77a814f1bfe493695a4492dacf7ac2a42f940de55e368d0

Height

#357,637

Difficulty

10.379741

Transactions

2

Size

2.30 KB

Version

2

Bits

0a6136b5

Nonce

24,108

Timestamp

1/13/2014, 1:09:55 PM

Confirmations

6,451,710

Merkle Root

8268d6987d2845458ecea889a65b6834bacac695419a3088cc84e5c703585cc0
Transactions (2)
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.515 × 10¹⁰²(103-digit number)
15158012410785394363…24155864311457433599
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.515 × 10¹⁰²(103-digit number)
15158012410785394363…24155864311457433599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.031 × 10¹⁰²(103-digit number)
30316024821570788726…48311728622914867199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.063 × 10¹⁰²(103-digit number)
60632049643141577452…96623457245829734399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.212 × 10¹⁰³(104-digit number)
12126409928628315490…93246914491659468799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.425 × 10¹⁰³(104-digit number)
24252819857256630981…86493828983318937599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.850 × 10¹⁰³(104-digit number)
48505639714513261962…72987657966637875199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.701 × 10¹⁰³(104-digit number)
97011279429026523924…45975315933275750399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.940 × 10¹⁰⁴(105-digit number)
19402255885805304784…91950631866551500799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.880 × 10¹⁰⁴(105-digit number)
38804511771610609569…83901263733103001599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.760 × 10¹⁰⁴(105-digit number)
77609023543221219139…67802527466206003199
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,718,841 XPM·at block #6,809,346 · 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