Block #356,638

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/12/2014, 9:11:33 PM · Difficulty 10.3812 · 6,470,521 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0461359be7827f628e56aed4154622988e097ef6394f4376b29ae7d291763b1c

Height

#356,638

Difficulty

10.381180

Transactions

2

Size

1.13 KB

Version

2

Bits

0a6194fc

Nonce

29,993

Timestamp

1/12/2014, 9:11:33 PM

Confirmations

6,470,521

Merkle Root

8378598ceab9efbe4831035562c2d8bb16ceed1e60717470ae5be4ec6606af67
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.355 × 10⁹⁵(96-digit number)
13550093219337279593…53224128108223987199
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.355 × 10⁹⁵(96-digit number)
13550093219337279593…53224128108223987199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.710 × 10⁹⁵(96-digit number)
27100186438674559186…06448256216447974399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.420 × 10⁹⁵(96-digit number)
54200372877349118373…12896512432895948799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.084 × 10⁹⁶(97-digit number)
10840074575469823674…25793024865791897599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.168 × 10⁹⁶(97-digit number)
21680149150939647349…51586049731583795199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.336 × 10⁹⁶(97-digit number)
43360298301879294698…03172099463167590399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.672 × 10⁹⁶(97-digit number)
86720596603758589397…06344198926335180799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.734 × 10⁹⁷(98-digit number)
17344119320751717879…12688397852670361599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.468 × 10⁹⁷(98-digit number)
34688238641503435758…25376795705340723199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.937 × 10⁹⁷(98-digit number)
69376477283006871517…50753591410681446399
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,861,457 XPM·at block #6,827,158 · 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