Block #383,975

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/31/2014, 6:31:56 PM · Difficulty 10.4060 · 6,432,686 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
71737e4f6442fbe99da64238c07d7dadb8927bc89d29ab10c7150a763addc418

Height

#383,975

Difficulty

10.406007

Transactions

6

Size

1.23 KB

Version

2

Bits

0a67f00d

Nonce

126,436

Timestamp

1/31/2014, 6:31:56 PM

Confirmations

6,432,686

Merkle Root

bf349224955917bf3326344459639fdf32f44b6d4640587fab90ad6aa502b118
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.211 × 10¹⁰⁰(101-digit number)
12114899649534386030…65714360088701711759
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.211 × 10¹⁰⁰(101-digit number)
12114899649534386030…65714360088701711759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.422 × 10¹⁰⁰(101-digit number)
24229799299068772061…31428720177403423519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.845 × 10¹⁰⁰(101-digit number)
48459598598137544122…62857440354806847039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.691 × 10¹⁰⁰(101-digit number)
96919197196275088244…25714880709613694079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.938 × 10¹⁰¹(102-digit number)
19383839439255017648…51429761419227388159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.876 × 10¹⁰¹(102-digit number)
38767678878510035297…02859522838454776319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.753 × 10¹⁰¹(102-digit number)
77535357757020070595…05719045676909552639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.550 × 10¹⁰²(103-digit number)
15507071551404014119…11438091353819105279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.101 × 10¹⁰²(103-digit number)
31014143102808028238…22876182707638210559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.202 × 10¹⁰²(103-digit number)
62028286205616056476…45752365415276421119
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,777,406 XPM·at block #6,816,660 · 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