Block #363,021

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/17/2014, 3:09:42 AM · Difficulty 10.4144 · 6,443,939 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5fab5b03c248500c48e17b32a3fa18a5c3bc85bbfd3b675cbe9f63fd104f089b

Height

#363,021

Difficulty

10.414403

Transactions

8

Size

1.91 KB

Version

2

Bits

0a6a164c

Nonce

73,108

Timestamp

1/17/2014, 3:09:42 AM

Confirmations

6,443,939

Merkle Root

25e9212f3375e6b4a540efc83189b46f7bb5821199e561ceb53b374b1d9f1cf0
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.

3.767 × 10¹⁰⁰(101-digit number)
37670557590428313358…39587899669873365599
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
3.767 × 10¹⁰⁰(101-digit number)
37670557590428313358…39587899669873365599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.534 × 10¹⁰⁰(101-digit number)
75341115180856626717…79175799339746731199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.506 × 10¹⁰¹(102-digit number)
15068223036171325343…58351598679493462399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.013 × 10¹⁰¹(102-digit number)
30136446072342650686…16703197358986924799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.027 × 10¹⁰¹(102-digit number)
60272892144685301373…33406394717973849599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.205 × 10¹⁰²(103-digit number)
12054578428937060274…66812789435947699199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.410 × 10¹⁰²(103-digit number)
24109156857874120549…33625578871895398399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.821 × 10¹⁰²(103-digit number)
48218313715748241098…67251157743790796799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.643 × 10¹⁰²(103-digit number)
96436627431496482197…34502315487581593599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.928 × 10¹⁰³(104-digit number)
19287325486299296439…69004630975163187199
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,699,778 XPM·at block #6,806,959 · 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