From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00
	autolearn=unavailable autolearn_force=no version=3.4.4
Path: 
 border1.nntp.dca3.giganews.com!backlog3.nntp.dca3.giganews.com!border2.nntp.dca.giganews.com!nntp.giganews.com!news.bbs-scene.org!weretis.net!feeder1.news.weretis.net!news.roellig-ltd.de!open-news-network.org!poup.poupinou.org!dedibox.gegeweb.org!gegeweb.eu!nntpfeed.proxad.net!proxad.net!feeder2-2.proxad.net!newsfeed.arcor.de!newsspool1.arcor-online.net!news.arcor.de.POSTED!not-for-mail
Date: Tue, 27 May 2014 16:45:23 +0200
From: "G.B." <rm-dash-bau-haus@dash.futureapps.de>
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.9;
 rv:24.0) Gecko/20100101 Thunderbird/24.5.0
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Subject: Re: A way to do a huge Ada promotion
References: <lm01r6$g7a$1@speranza.aioe.org>
 <CJVgv.324742$1w1.112189@fx03.iad>
In-Reply-To: <CJVgv.324742$1w1.112189@fx03.iad>
Content-Type: text/plain; charset=windows-1252; format=flowed
Content-Transfer-Encoding: 7bit
Message-ID: <5384a502$0$6663$9b4e6d93@newsspool3.arcor-online.net>
Organization: Arcor
NNTP-Posting-Date: 27 May 2014 16:45:22 CEST
NNTP-Posting-Host: dc48374a.newsspool3.arcor-online.net
X-Trace: 
 DXC=O[C8@7]5aBX<<0iRN7DLEQMcF=Q^Z^V3X4Fo<]lROoRQ8kF<OcfhCO[4hg]m>G_fkYnc\616M64>ZLh>_cHTX3j]hLWF@I9;
 PmR
X-Complaints-To: usenet-abuse@arcor.de
X-Original-Bytes: 1806
Xref: number.nntp.dca.giganews.com comp.lang.ada:186654
Date: 2014-05-27T16:45:22+02:00
List-Id: <comp.lang.ada>

On 27.05.14 07:51, Shark8 wrote:
> IMO, the two items which [if adopted] would profoundly change the web
> are the following:

IMO, in view of apps and browser plugins, the only thing that
can actually change the web is a mathematically proven algorithm
that addresses this part of HTTP:

"10.4.3 402 Payment Required

"This code is reserved for future use."

http://www.w3.org/Protocols/rfc2616/rfc2616-sec10.html


Is this problem more difficult to solve than Fermat's last
conjecture? (Perhaps not to be discussed in an Ada newsgroup.)