Block #357,682

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/13/2014, 2:02:14 PM · Difficulty 10.3852 · 6,452,917 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fa8308cd1301534e1f8b6d2d0071c4241eea12e345e8929a6a744fbe20994d43

Height

#357,682

Difficulty

10.385220

Transactions

11

Size

2.56 KB

Version

2

Bits

0a629dce

Nonce

29,686

Timestamp

1/13/2014, 2:02:14 PM

Confirmations

6,452,917

Merkle Root

2e377df0dd4e6b330816ed81da76275b5deb71d1ca1a73b5948bb782788929ca
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.792 × 10¹⁰¹(102-digit number)
27921764422748577342…61749374142113969279
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.792 × 10¹⁰¹(102-digit number)
27921764422748577342…61749374142113969279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.584 × 10¹⁰¹(102-digit number)
55843528845497154684…23498748284227938559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.116 × 10¹⁰²(103-digit number)
11168705769099430936…46997496568455877119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.233 × 10¹⁰²(103-digit number)
22337411538198861873…93994993136911754239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.467 × 10¹⁰²(103-digit number)
44674823076397723747…87989986273823508479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.934 × 10¹⁰²(103-digit number)
89349646152795447495…75979972547647016959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.786 × 10¹⁰³(104-digit number)
17869929230559089499…51959945095294033919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.573 × 10¹⁰³(104-digit number)
35739858461118178998…03919890190588067839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.147 × 10¹⁰³(104-digit number)
71479716922236357996…07839780381176135679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.429 × 10¹⁰⁴(105-digit number)
14295943384447271599…15679560762352271359
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,728,880 XPM·at block #6,810,598 · 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